Publication date
January 2000
DOI Publisher
Institute of Electrical and Electronics Engineers (IEEE) ISSN
0018-9448 Journal
IEEE Transactions on Information Theory Citation count (estimate)
25Abstract
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.4 page(s
Add to ORKG