PSEUDOIRREDUCIBLE POLYNOMIALS: PROBABILISTIC IRREDUCIBILITY TESTING

    loading  Checking for direct PDF access through Ovid

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.

Related Topics

    loading  Loading Related Articles