Deterministic analysis of aleatoric methods of polynomial factorization over finite fields

DOI10.1006/jnth.1994.1024zbMath0802.11055OpenAlexW1983297160MaRDI QIDQ1323866

M. Rothstein, Hans J. Zassenhaus

Publication date: 15 December 1994

Published in: Journal of Number Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jnth.1994.1024

zbMATH Keywords

complexityfinite fieldmonic polynomialsCantor-Zassenhaus algorithmdeterministic factorization algorithm

Mathematics Subject Classification ID

Number-theoretic algorithms; complexity (11Y16) Polynomials over finite fields (11T06)

Related Items (1)

Factoring polynomials over finite fields: A survey

This page was built for publication: Deterministic analysis of aleatoric methods of polynomial factorization over finite fields