McEliece Cryptosystem Implementation: Theory and Practice
PQCrypto '08 Proceedings of the 2nd International Workshop on Post-Quantum Cryptography
Binary Representations of Finite Fields and Their Application to Complexity Theory
Finite Fields and Their Applications
| Hi-index | 754.84 |
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