[图书][B] Cryptographic applications of analytic number theory: complexity lower bounds and pseudorandomness

I Shparlinski - 2013 - books.google.com
The book introduces new techniques that imply rigorous lower bounds on the com plexity of
some number-theoretic and cryptographic problems. It also establishes certain attractive …

Recent advances in the theory of nonlinear pseudorandom number generators

H Niederreiter, IE Shparlinski - Monte Carlo and Quasi-Monte Carlo …, 2002 - Springer
Recent Advances in the Theory of Nonlinear Pseudorandom Number Generators Page 1
Recent Advances in the Theory of Nonlinear Pseudorandom Number Generators Harald …

Pseudorandom sequences

A Topuzoğlu, A Winterhof - Topics in geometry, coding theory and …, 2007 - Springer
Chapter 4 PSEUDORANDOM SEQUENCES Page 1 Chapter 4 PSEUDORANDOM
SEQUENCES Alev Topuzoglu and Arne Winterhof 1. Introduction Sequences, which are …

On the linear and nonlinear complexity profile of nonlinear pseudorandom number generators

J Gutierrez, IE Shparlinski… - IEEE Transactions on …, 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 …

Dynamical systems generated by rational functions

H Niederreiter, IE Shparlinski - International Symposium on Applied …, 2003 - Springer
Dynamical Systems Generated by Rational Functions Page 1 Dynamical Systems Generated
by Rational Functions Harald Niederreiter1 and Igor E. Shparlinski2 1 Department of …

Lattice structure and linear complexity profile of nonlinear pseudorandom number generators

G Dorfer, A Winterhof - Applicable Algebra in Engineering, Communication …, 2003 - Springer
Lattice Structure and Linear Complexity Profile of Nonlinear Pseudorandom Number
Generators Page 1 AAECC 13, 499–508 (2003) 2003 Lattice Structure and Linear Complexity …

On the linear complexity profile of some new explicit inversive pseudorandom numbers

W Meidl, A Winterhof - Journal of Complexity, 2004 - Elsevier
Linear complexity and linear complexity profile are interesting characteristics of a sequence
for applications in cryptography and Monte-Carlo methods. We introduce some new explicit …

Lattice structure and linear complexity of nonlinear pseudorandom numbers

H Niederreiter, A Winterhof - Applicable Algebra in Engineering …, 2002 - Springer
It is shown that aq-periodic sequence over the finite field F q passes an extended version of
Marsaglia's lattice test for high dimensions if and only if its linear complexity is large. The …

Character sums, primitive elements, and powers in finite fields

A Winterhof - Journal of Number Theory, 2001 - Elsevier
Consider an extension field Fqm= Fq (α) of the finite field Fq. Davenport proved that the set
Fq+ α contains at least one primitive element of Fqm if q is sufficiently large with respect to …

On the linear complexity profile of explicit nonlinear pseudorandom numbers

W Meidl, A Winterhof - Information processing letters, 2003 - Elsevier
On the linear complexity profile of explicit nonlinear pseudorandom numbers Page 1
Information Processing Letters 85 (2003) 13–18 www.elsevier.com/locate/ipl On the linear …