Pseudoirreducible Polynomials: Probabilistic Irreducibility Testing

Authors:
L. V. Kovalchuk
Affiliations:
Department of Special Telecommunication Systems and Information Privacy Protection of Security Service of Ukraine, Kiev, Ukraine
Venue:
Cybernetics and Systems Analysis
Year:
2004

Citing 2
Cited 1

A course in number theory and cryptography

A course in number theory and cryptography
An algorithm for solving the discrete log problem on hyperelliptic curves

EUROCRYPT'00 Proceedings of the 19th international conference on Theory and application of cryptographic techniques

Works of the Kiev school of theoretical cryptography

Cybernetics and Systems Analysis

Quantified Score

Hi-index	0.00

Visualization

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.