Factoring polynomials using binary representations of finite fields

DOI10.1109/18.567667zbMath0873.11066OpenAlexW2153395632MaRDI QIDQ4336291

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

factorization of polynomials over finite fieldsdeterministic algorithmbinary representations of finite fieldsequal-degree factorization problem

Mathematics Subject Classification ID

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

Related Items (1)

McEliece Cryptosystem Implementation: Theory and Practice

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