Abstract
Polynomial analogs of pseudoprime numbers are created (Fermat pseudoprimes, Euler pseudoprimes, and strong pseudoprimes). Some of their properties and interrelations are described. Efficient probabilistic algorithms of irreducibility testing are given that are analogs of the Fermat, Solovay-Strassen, and Miller-Rabin algorithms.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
REFERENCES
R. Lidl and H. Niederrieter, Finite Fields, Addison-Wesley, London (1983).
N. Koblitz, A Course of Number Theory and Cryptography, Springer, Berlin (1994).
P. Gaudry, “An algorithm for solving the discrete log problem on hyperelliptic curves,” in: Eurocrypt 2000 (LNCS 1807), Springer (2000), pp. 19–34.
O. V. Verbitsky, Introduction to Cryptology [in Ukrainian], Vydavn. Nauk.-Tekhn. Literatury, L'viv (1998).
L. Carlits, “The arithmetic of polynomials in Galois field,” American J. of Mathematics, 54, No. 1 (Jan.), 39–50 (1932).
DSTU 4145–2002. Cryptographic Data Protection: Digital Signatures Based on Elliptic Curves.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Kovalchuk, L.V. Pseudoirreducible Polynomials: Probabilistic Irreducibility Testing. Cybernetics and Systems Analysis 40, 610–616 (2004). https://doi.org/10.1023/B:CASA.0000047882.56182.83
Issue Date:
DOI: https://doi.org/10.1023/B:CASA.0000047882.56182.83