Pseudoirreducible polynomials: probabilistic irreducibility testing

DOI10.1023/B:CASA.0000047882.56182.83zbMath1109.11063OpenAlexW2063848037MaRDI QIDQ2574232

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 curveprobabilistic algorithmirreducible polynomialpseudoprime number

Mathematics Subject Classification ID

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

Related Items (1)

Works of the Kiev school of theoretical cryptography

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