On the linear complexity profile of the power generator

Frances Griffin; Igor E. Shparlinski

doi:10.1109/18.868485

On the linear complexity profile of the power generator

Frances Griffin
, Igor E. Shparlinski

Research output: Contribution to journal › Article › peer-review

26 Citations (Scopus)

92 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 language	English
Pages (from-to)	2159-2162
Number of pages	4
Journal	IEEE Transactions on Information Theory
Volume	46
Issue number	6
DOIs	https://doi.org/10.1109/18.868485
Publication status	Published - Sept 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 [email protected]. By choosing to view this document, you agree to all provisions of the copyright laws protecting it.

Access to Document

10.1109/18.868485

Publisher version (open access).pdfFinal published version, 89.7 KB

Cite this

@article{273d6cf78d574cf6ae52952876784799,

title = "On the linear complexity profile of the power generator",

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.",

author = "Frances Griffin and Shparlinski, \{Igor E.\}",

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{\^a}€{\texttrademark}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 [email protected]. By choosing to view this document, you agree to all provisions of the copyright laws protecting it.",

year = "2000",

month = sep,

doi = "10.1109/18.868485",

language = "English",

volume = "46",

pages = "2159--2162",

journal = "IEEE Transactions on Information Theory",

issn = "0018-9448",

publisher = "Institute of Electrical and Electronics Engineers (IEEE)",

number = "6",

}

TY - JOUR

T1 - On the linear complexity profile of the power generator

AU - Griffin, Frances

AU - Shparlinski, Igor E.

N1 - 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 [email protected]. By choosing to view this document, you agree to all provisions of the copyright laws protecting it.

PY - 2000/9

Y1 - 2000/9

N2 - 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.

AB - 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.

UR - https://www.scopus.com/pages/publications/0034271997

U2 - 10.1109/18.868485

DO - 10.1109/18.868485

M3 - Article

AN - SCOPUS:0034271997

SN - 0018-9448

VL - 46

SP - 2159

EP - 2162

JO - IEEE Transactions on Information Theory

JF - IEEE Transactions on Information Theory

IS - 6

ER -

On the linear complexity profile of the power generator

Abstract

Bibliographical note

Access to Document

Other files and links

Fingerprint

Cite this