Pseudoirreducible polynomials: probabilistic irreducibility testing

DOI10.1023/B:CASA.0000047882.56182.83MaRDI QIDQ2574232zbMATH OpenOpenAlexFDO

Authors L. V. Koval'chuk

Publication date 18 November 2005

Published in Cybernetics and Systems Analysis (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/b:casa.0000047882.56182.83

zbMATH Keywords

elliptic curveirreducible polynomialprobabilistic algorithmpseudoprime number

Mathematics Subject Classification ID

Polynomials over finite fields (11T06) Number-theoretic algorithms; complexity (11Y16) Randomized algorithms (68W20) Analysis of algorithms (68W40)

Recommendations

• scientific article; zbMATH DE number 1008373
• Probabilistic absolute irreducibility test for polynomials
• scientific article; zbMATH DE number 1189231
• Irreducibility of a polynomial over the field of p elements with p prime.
• Irreducibility of multivariate polynomials

Cited in

(3)

• A heuristic irreducibility test for univariate polynomials
• Euler pseudoprime polynomials and strong pseudoprime polynomials
• Works of the Kiev school of theoretical cryptography

This page was built for publication: Pseudoirreducible polynomials: probabilistic irreducibility testing

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