Factoring Polynomials Over Finite Fields 论文

1967Bell System Technical Journal引用 322

Coding theory and cryptographyCryptography and Residue ArithmeticPolynomial and algebraic computation

Polynomial and algebraic computation Coding theory and cryptography Cryptography and Residue Arithmetic

作者

摘要

We present here an algorithm for factoring a given polynomial over GF(q) into powers of irreducible polynomials. The method reduces the factorization of a polynomial of degree m over GF(q) to the solution of about m(q − 1)/q linear equations in as many unknowns over GF(q).

作者查看全部 (1)

Elwyn R. Berlekamp

Factoring Polynomials Over Finite Fields 论文

摘要

作者查看全部 (1)

相关技术

相关事件

相关文章