Factoring polynomials using binary representations of finite fields

IEEE Transactions on Information Theory

Volumn 43, Issue 1, 1997, Pages 147-153

  Ganz, Jürg ^a  

^a Union Bank of Switzerland   (Switzerland)

Author keywords

Binary representations; Deterministic algorithm; Factorization; Finite fields; Polynomials

Indexed keywords

ALGORITHMS; MATHEMATICAL MODELS; POLYNOMIALS; PROBLEM SOLVING;

BINARY REPRESENTATIONS; DETERMINISTIC ALGORITHM; FACTORIZATION; FINITE FIELDS;

BINARY CODES;

EID: 0030871521     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/18.567667     Document Type: Article

References (13)

1. E. R. Berlekamp, " Factoring polynomials over large finite fields," Math. of Comput., vol. 24, no. 111, pp. 713-735, July 1970.
2. m)," Symbolic and Algebraic Computation, (Lecture Notes in Computer Science), vol. 358. Berlin: Springer-Verlag, 1988, pp. 259-270.
3. q[X]," Ann. Discr. Math., vol. 17, pp. 149-157, 1983.
4. _, " Improving an algorithm for factoring polynomials over a finite field and constructing large irreducible polynomials," IEEE Trans. Inform. Theory, vol. IT-29, no. 3, pp. 378-385, May 1983.
5. J. von zur Gathen, " Factoring polynomials and primitive elements for special primes," Theoret. Comput. Sci., vol. 52, pp. 77-89, 1987.
6. R. Lidl and H. Niederreiter, Finite Fields. Reading, MA: Addison-Wesley, 1983.
7. A. Lempel, G. Seroussi, and J. Ziv, " On the power of straight-line computations in finite fields," IEEE Trans. Inform. Theory, vol. IT-28, no. 6, pp. 875-880, Nov. 1982.
8. V. Strassen, " Berechnung und Programm. I," Acta Informatica, vol. 1, pp. 320-335, 1972.
9. J. Ganz, " Algebraic complexity in finite fields," Ph.D. dissertation, no. 10867, Swiss Federal Institute of Technology, Zürich, Switzerland, 1994.
10. D. E. Knuth, The Art of Computer Programming: Volume 2-Seminumerical Algorithms, 2nd ed. Reading, MA: Addison-Wesley, 1981.
11. S. C. Pohlig and M. E. Hellman, " An improved algorithm for computing logarithms over GF(p) and its cryptographic significance," IEEE Trans. Inform. Theory, vol. IT-24, no. 1, pp. 106-110, Jan. 1978.
12. L. Rönyai, " Factoring polynomials modulo special primes," Combinatorica, vol. 9, no. 2, pp. 199-206, 1989.
13. V. Shoup, " Smoothness and factoring polynomials over finite fields," Inform. Proccess. Lett., vol. 38, pp. 39-42, Apr. 1991.