By Topic

Factoring polynomials using binary representations of finite fields

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
J. Ganz ; Union Bank of Switzerland, Zurich, Switzerland

The factorization of polynomials over finite fields is considered. A new deterministic algorithm is proposed that solves the equal-degree factorization problem by combining Berlekamp's (1970) trace algorithm iterative method with the concept of binary representations of finite fields. The interesting aspects of the new algorithm are its simple structure, the easy proof of its correctness, and its efficiency when an efficient realization of the mapping from the finite field to a binary representation is known. Some results about binary representations of finite fields are derived to show that the new factoring algorithm is also nonasymptotically efficient for every finite field. The only practical drawback may be the precomputation of some constants needed in the binary representation, but several suggestions are given to improve this when more about the finite field is known

Published in:

IEEE Transactions on Information Theory  (Volume:43 ,  Issue: 1 )