We describe probabilistic primality tests applicable to integers whose prime factors are all congruent to 1 mod r where r is a positive integer; r = 2 is the Miller-Rabin test. We show that if ν rounds of our test do not find n = (r + 1) 2 composite, then n is prime with probability of error less th
Euler Pseudoprime Polynomials and Strong Pseudoprime Polynomials
✍ Scribed by Véronique Mauduit
- Publisher
- Elsevier Science
- Year
- 2000
- Tongue
- English
- Weight
- 211 KB
- Volume
- 6
- Category
- Article
- ISSN
- 1071-5797
No coin nor oath required. For personal study only.
✦ Synopsis
It is usual to emphasize the analogy between the integers and polynomials with coe$cients in a "nite "eld, comparing di!erent notions in the two points of view. We introduce a particular rank one Drinfeld module to get an exponentiation for polynomials and then de"ne the notions of Euler pseudoprimes and strong pseudoprimes for polynomials with coe$cients in a "nite "eld. As for the integers, we have Solovay}Strassen and Miller}Rabin tests for polynomials.
📜 SIMILAR VOLUMES
The strong Chebyshev distribution and the Chebyshev orthogonal Laurent polynomials are examined in detail. Explicit formulas are derived for the orthogonal Laurent polynomials, uniform convergence of the associated continued fraction is established, and the zeros of the Chebyshev L-polynomials are g