On the linear complexity profile of the power generator

DOI10.1109/18.868485zbMath0997.94012OpenAlexW2123087644MaRDI QIDQ2705938

Frances Griffin, Igor E. Shparlinski

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

zbMATH Keywords

linear complexity profilepower generatorcryptographyBlum-Blum-Shub generatorlinear complexityRSA generatorpseudo-random numbersBlum integerlattice reduction attacks

Mathematics Subject Classification ID

Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Cryptography (94A60) Random number generation in numerical analysis (65C10)

Related Items (9)

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 some sequences derived from elliptic curves ⋮ A new complexity metric for FH/SS sequences using fuzzy entropy ⋮ 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 ⋮ On the uniformity of distribution of the RSA pairs ⋮ On the linear complexity profile of nonlinear congruential pseudorandom number generators with Dickson polynomials

This page was built for publication: On the linear complexity profile of the power generator