On the linear complexity profile of the power generator
From MaRDI portal
Publication:2705938
DOI10.1109/18.868485zbMath0997.94012MaRDI QIDQ2705938
Igor E. Shparlinski, Frances Griffin
Publication date: 19 March 2001
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/33127b6b5d5c2fa8eeb00cac4672ca150cd4a416
linear complexity profile; power generator; cryptography; Blum-Blum-Shub generator; linear complexity; RSA generator; pseudo-random numbers; Blum integer; lattice reduction attacks
94A55: Shift register sequences and sequences over finite alphabets in information and communication theory
94A60: Cryptography
65C10: Random number generation in numerical analysis
Related Items
On the power generator and its multivariate analogue, On the cycle structure of repeated exponentiation modulo a prime, On the linear complexity profile of nonlinear congruential pseudorandom number generators with Rédei functions, On the linear complexity profile of nonlinear congruential pseudorandom number generators with Dickson polynomials, On the uniformity of distribution of the RSA pairs