An improvement of Rabin's probabilistic algorithm for generating irreducible polynomials over GF(p)

DOI10.1016/0020-0190(80)90011-3MaRDI QIDQ1151027zbMATH OpenOpenAlexFDO

Authors Jacques Calmet, Rüdiger Loos

Publication date 1980

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0020-0190(80)90011-3

zbMATH Keywords

computer algebrapolynomial factorizationaverage computing time

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Polynomials over finite fields (11T06) Algorithms in computer science (68W99)

Cites work

• scientific article; zbMATH DE number 3597592 (Why is no real title available?)
• scientific article; zbMATH DE number 3303654 (Why is no real title available?)
• Factoring Polynomials Over Large Finite Fields
• Probabilistic Algorithms in Finite Fields

Cited in

(3)

• A New Algorithm for Factoring Polynomials Over Finite Fields
• Factoring polynomials over finite fields: A survey
• Algebraic algorithms in GF(q)

This page was built for publication: An improvement of Rabin's probabilistic algorithm for generating irreducible polynomials over GF(p)

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