Periodical
A generalisation of the Cantor-Zassenhaus algorithm
| العنوان: | A generalisation of the Cantor-Zassenhaus algorithm |
|---|---|
| المؤلفون: | Hidber, C. |
| المصدر: | Computing; December 1997, Vol. 59 Issue: 4 p325-330, 6p |
| مستخلص: | Abstract: We generalise the Cantor-Zassenhaus algorithm for factoring polynomials over finite fields. The generalisation yields a class of factorisation algorithms. We compute their factorisation probability and their least upper bound. We then give a simple characterisation of the algorithms reaching the least upper bound. As an example we show the Cantor-Zassenhaus and the Ben-Or algorithms have a factorisation probability equal to the least upper bound. |
| قاعدة البيانات: | Supplemental Index |
| تدمد: | 0010485X 14365057 |
|---|---|
| DOI: | 10.1007/BF02684415 |