Please use this identifier to cite or link to this item: https://doi.org/10.1109/TIT.2002.806144
Title: On the linear and nonlinear complexity profile of nonlinear pseudorandom number generators
Authors: Gutierrez, J.
Shparlinski, I.E.
Winterhof, A. 
Keywords: Inversive generator
Linear and nonlinear complexity profile
Nonlinear pseudorandom number generators
Quadratic exponential generator
Issue Date: Jan-2003
Citation: Gutierrez, J., Shparlinski, I.E., Winterhof, A. (2003-01). On the linear and nonlinear complexity profile of nonlinear pseudorandom number generators. IEEE Transactions on Information Theory 49 (1) : 60-64. ScholarBank@NUS Repository. https://doi.org/10.1109/TIT.2002.806144
Abstract: 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.
Source Title: IEEE Transactions on Information Theory
URI: http://scholarbank.nus.edu.sg/handle/10635/131483
ISSN: 00189448
DOI: 10.1109/TIT.2002.806144
Appears in Collections:Staff Publications

Show full item record
Files in This Item:
There are no files associated with this item.

SCOPUSTM   
Citations

30
checked on Sep 20, 2018

WEB OF SCIENCETM
Citations

28
checked on Sep 5, 2018

Page view(s)

8
checked on Jul 5, 2018

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.