On the linear and nonlinear complexity profile of nonlinear pseudorandom number generators
J Gutierrez, IE Shparlinski… - IEEE Transactions on …, 2003 - ieeexplore.ieee.org
IEEE Transactions on Information Theory, 2003•ieeexplore.ieee.org
We obtain lower bounds on the linear and nonlinear complexity profile of a general
nonlinear pseudorandom number generator, of the inversive generator, and of a new
nonlinear generator called quadratic exponential generator. The results are interesting for
applications to cryptography and Monte Carlo methods.
nonlinear pseudorandom number generator, of the inversive generator, and of a new
nonlinear generator called quadratic exponential generator. The results are interesting for
applications to cryptography and Monte Carlo methods.
We obtain lower bounds on the linear and nonlinear complexity profile of a general nonlinear pseudorandom number generator, of the inversive generator, and of a new nonlinear generator called quadratic exponential generator. The results are interesting for applications to cryptography and Monte Carlo methods.
ieeexplore.ieee.org
以上显示的是最相近的搜索结果。 查看全部搜索结果