TY - JOUR
T1 - On the linear and nonlinear complexity profile of nonlinear pseudorandom number generators
AU - Gutierrez, Jaime
AU - Shparlinski, Igor E.
AU - Winterhof, Arne
N1 - Copyright 2003 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 - 2003/1
Y1 - 2003/1
N2 - The lower bounds on the linear and nonlinear complexity profile of a general nonlinear pseudorandom number generator were obtained. The linear complexity and the linear complexity profile are important cryptographic characteristics of sequences. The nonlinear generator called the quadratic exponential generator are studied.
AB - The lower bounds on the linear and nonlinear complexity profile of a general nonlinear pseudorandom number generator were obtained. The linear complexity and the linear complexity profile are important cryptographic characteristics of sequences. The nonlinear generator called the quadratic exponential generator are studied.
UR - http://www.scopus.com/inward/record.url?scp=0037265750&partnerID=8YFLogxK
U2 - 10.1109/TIT.2002.806144
DO - 10.1109/TIT.2002.806144
M3 - Article
AN - SCOPUS:0037265750
SN - 0018-9448
VL - 49
SP - 60
EP - 64
JO - IEEE Transactions on Information Theory
JF - IEEE Transactions on Information Theory
IS - 1
ER -