On the linear complexity of the power generator

DOI10.1023/A:1011264815860zbMath1019.94008OpenAlexW1546597647MaRDI QIDQ5939679

Igor E. Shparlinski

Publication date: 23 April 2003

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1011264815860

zbMATH Keywords

power generatorcryptographyBlum-Blum-Shub generatorlinear complexityRSA generator

Mathematics Subject Classification ID

Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Cryptography (94A60)

Related Items (8)

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 ⋮ On the power generator and its multivariate analogue ⋮ On the uniformity of distribution of the RSA pairs ⋮ Period of the power generator and small values of Carmichael’s function ⋮ On the elliptic curve endomorphism generator ⋮ On the linear complexity profile of nonlinear congruential pseudorandom number generators with Dickson polynomials

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