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

DOI10.1016/0020-0190(80)90011-3zbMath0456.68034OpenAlexW2061874356MaRDI QIDQ1151027

Rüdiger Loos, Jacques Calmet

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

polynomial factorizationcomputer algebraaverage computing time

Mathematics Subject Classification ID

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

Related Items

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

Cites Work

• Probabilistic Algorithms in Finite Fields
• Factoring Polynomials Over Large Finite Fields
• Unnamed Item
• Unnamed Item