Title :
On the linear complexity profile of the power generator
Author :
Griffin, Frances ; Shparlinski, Igor E.
Author_Institution :
Dept. of Comput., Macquarie Univ., NSW, Australia
fDate :
9/1/2000 12:00:00 AM
Abstract :
We obtain a lower bound on the linear complexity profile of the power generator of pseudo-random numbers modulo a Blum integer. A different method is also proposed to estimate the linear complexity profile of the Blum-Blum-Shub (1986) generator. In particular, these results imply that lattice reduction attacks on such generators are not feasible
Keywords :
computational complexity; cryptography; random number generation; Blum integer; Blum-Blum-Shub generator; RSA generator; cryptography; lattice reduction attacks; linear complexity profile; lower bound; power generator; pseudo-random numbers; pseudorandom number generator; Cryptography; H infinity control; Lattices; Power generation;
Journal_Title :
Information Theory, IEEE Transactions on
