Analysis and design of stream ciphers
Analysis and design of stream ciphers
Random number generation and quasi-Monte Carlo methods
Random number generation and quasi-Monte Carlo methods
A generalization of a congruential property of Lucas
American Mathematical Monthly
Handbook of Applied Cryptography
Handbook of Applied Cryptography
On the linear complexity profile of explicit nonlinear pseudorandom numbers
Information Processing Letters
On the linear complexity of bounded integer sequences over different moduli
Information Processing Letters
On the joint linear complexity profile of explicit inversive multisequences
Journal of Complexity
On the linear complexity of bounded integer sequences over different moduli
Information Processing Letters
On the joint linear complexity profile of explicit inversive multisequences
Journal of Complexity
On the structure of inversive pseudorandom number generators
AAECC'07 Proceedings of the 17th international conference on Applied algebra, algebraic algorithms and error-correcting codes
Pseudorandomness and Dynamics of Fermat Quotients
SIAM Journal on Discrete Mathematics
On the distribution of some new explicit nonlinear congruential pseudorandom numbers
SETA'04 Proceedings of the Third international conference on Sequences and Their Applications
Finite binary sequences constructed by explicit inversive methods
Finite Fields and Their Applications
| Hi-index | 0.00 |
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 inversive pseudorandom number generators and prove lower bounds on their linear complexity profile which are close to the best possible.