Period of the power generator and small values of Carmichael’s function
From MaRDI portal
Publication:2723531
DOI10.1090/S0025-5718-00-01282-5zbMath1029.11043WikidataQ56475224 ScholiaQ56475224MaRDI QIDQ2723531
Igor E. Shparlinski, John B. Friedlander, Carl B. Pomerance
Publication date: 5 July 2001
Published in: Mathematics of Computation (Search for Journal in Brave)
11T71: Algebraic coding theory; cryptography (number-theoretic aspects)
94A60: Cryptography
11B50: Sequences (mod (m))
11N56: Rate of growth of arithmetic functions
11K45: Pseudo-random numbers; Monte Carlo methods
Related Items
Mordell’s exponential sum estimate revisited, Square-free values of the Carmichael function., On the cycle structure of repeated exponentiation modulo a prime, Compositions with the Euler and Carmichael functions, On the uniformity of distribution of the RSA pairs, On the distribution of the power generator
Cites Work
- On a problem of Oppenheim concerning Factorisatio Numerorum
- Integers without large prime factors
- There are infinitely many Carmichael numbers
- Analysis of iterated modular exponentiation: The orbits of \(x^\alpha \mod N\)
- Fast generation of prime numbers and secure public-key cryptographic parameters.
- Stronger security proofs for RSA and Rabin bits.
- On the distribution of the power generator
- Carmichael's lambda function
- A Simple Unpredictable Pseudo-Random Number Generator
- On the distribution of amicable numbers.
- Shifted primes without large prime factors
- Properties of the x/sup 2/ mod N pseudorandom number generator
- On the linear complexity of the power generator
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item