On the linear complexity profile of the power generator

Frances Griffin, Igor E. Shparlinski

Research output: Contribution to journalArticlepeer-review

22 Citations (Scopus)
9 Downloads (Pure)

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 generator. In particular, these results imply that lattice reduction attacks on such generators are not feasible.

Original languageEnglish
Pages (from-to)2159-2162
Number of pages4
JournalIEEE Transactions on Information Theory
Volume46
Issue number6
DOIs
Publication statusPublished - Sep 2000

Bibliographical note

Copyright 2000 IEEE. Reprinted from IEEE transactions on information theory. This material is posted here with permission of the IEEE. Such permission of the IEEE does not in any way imply IEEE endorsement of any of Macquarie University’s products or services. Internal or personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution must be obtained from the IEEE by writing to pubs-permissions@ieee.org. By choosing to view this document, you agree to all provisions of the copyright laws protecting it.

Cite this