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
On generalized Lucas pseudoprimes
✍ Scribed by I. Joó
- Publisher
- Akadmiai Kiad
- Year
- 1990
- Tongue
- English
- Weight
- 293 KB
- Volume
- 55
- Category
- Article
- ISSN
- 1588-2632
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
Lidl, R. and W.B. Mtiller. Generalizations of the Fibonacci pseudoprimes test, Discrete Mathematics 92 (lwl) 211-220. Di Port0 and Filipponi recently described a generalization of the standard test for an odd composite integer n to be a pseudoprime (cf. [2]). Instead of evaluating powers of a given
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 pseudoprime