Period of the power generator and small values of Carmichael’s function

DOI10.1090/S0025-5718-00-01282-5zbMath1029.11043WikidataQ56475224 ScholiaQ56475224MaRDI QIDQ2723531

Igor E. Shparlinski, Carl B. Pomerance, John B. Friedlander

Publication date: 5 July 2001

Published in: Mathematics of Computation (Search for Journal in Brave)

zbMATH Keywords

Blum-Blum-Shub generatorRSA generatorCarmichael's function

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60) Sequences (mod (m)) (11B50) Rate of growth of arithmetic functions (11N56) Pseudo-random numbers; Monte Carlo methods (11K45)

Related Items (22)

On the cycle structure of repeated exponentiation modulo a prime ⋮ Power maps in finite groups ⋮ Functional graphs of polynomials over finite fields ⋮ TIDE: a novel approach to constructing timed-release encryption ⋮ On the power generator and its multivariate analogue ⋮ Applications of timed-release encryption with implicit authentication ⋮ Square-free values of the Carmichael function. ⋮ On the uniformity of distribution of the RSA pairs ⋮ Iteration entropy ⋮ On the distribution of the power generator ⋮ ON THE DIVISORS OF xⁿ – 1 IN 𝔽_p[x] ⋮ The density of numbers \(n\) having a prescribed G.C.D. with the \(n\)th Fibonacci number ⋮ Mordell’s exponential sum estimate revisited ⋮ On the degree growth in some polynomial dynamical systems and nonlinear pseudorandom number generators ⋮ On the period of the Naor-Reingold sequence ⋮ Connected components of the graph generated by power maps in prime finite fields ⋮ Random Generators and Normal Numbers ⋮ FIXED AND PERIODIC POINTS OF POLYNOMIALS GENERATED BY MINIMAL POLYNOMIALS OF 2cos(2π/n) ⋮ On sets of integers which contain no three terms in geometric progression ⋮ The structure of digraphs associated with the congruence x k ≡ y (mod n) ⋮ The reciprocal sum of divisors of Mersenne numbers ⋮ Compositions with the Euler and Carmichael functions

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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

This page was built for publication: Period of the power generator and small values of Carmichael’s function