• DocumentCode
    1381622
  • 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
  • Volume
    46
  • Issue
    6
  • fYear
    2000
  • fDate
    9/1/2000 12:00:00 AM
  • Firstpage
    2159
  • Lastpage
    2162
  • 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;
  • fLanguage
    English
  • Journal_Title
    Information Theory, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0018-9448
  • Type

    jour

  • DOI
    10.1109/18.868485
  • Filename
    868485
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=1381622