Factoring polynomials using binary representations of finite fields

DOI10.1109/18.567667MaRDI QIDQ4336291zbMATH OpenOpenAlexFDO

Authors Jürg Ganz

Publication date 29 September 1997

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/18.567667

zbMATH Keywords

binary representations of finite fieldsdeterministic algorithmequal-degree factorization problemfactorization of polynomials over finite fields

Mathematics Subject Classification ID

Polynomials over finite fields (11T06) Number-theoretic algorithms; complexity (11Y16) Theory of error-correcting codes and error-detecting codes (94B99)

Recommendations

• Factoring polynomials over finite fields
• Factoring polynomials over finite fields
• Factoring polynomials over arbitrary finite fields
• Factoring polynomials over special finite fields
• scientific article; zbMATH DE number 1594303
• Factorization of a class of polynomials over finite fields
• Factoring multivariate polynomials over finite fields
• On Bivariate Polynomial Factorization over Finite Fields
• scientific article; zbMATH DE number 1273637
• Polynomial factorization algorithms over number fields

Cited in

(7)

• Binary cyclotomic polynomials: representation via words and algorithms
• McEliece Cryptosystem Implementation: Theory and Practice
• Polynomial Factorization and Nonrandomness of Bits of Algebraic and Some Transcendental Numbers
• scientific article; zbMATH DE number 1273637 (Why is no real title available?)
• scientific article; zbMATH DE number 691482 (Why is no real title available?)
• Factoring a binary polynomial of degree over one million
• Finding normal binary floating-point factors efficiently

This page was built for publication: Factoring polynomials using binary representations of finite fields

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4336291)