Predicting masked linear pseudorandom number generators over finite fields

Authors:
Jaime Gutierrez;Álvar Ibeas;Domingo Gómez-Pérez;Igor E. Shparlinski
Affiliations:
Department of Applied Mathematics and Computer Science, University of Cantabria, Santander, Spain 39071;Department of Applied Mathematics and Computer Science, University of Cantabria, Santander, Spain 39071;Department of Applied Mathematics and Computer Science, University of Cantabria, Santander, Spain 39071;Department of Computing, Macquarie University, Sydney, Australia 2109
Venue:
Designs, Codes and Cryptography
Year:
2013

Citing 16
Cited 0

A simple unpredictable pseudo random number generator

SIAM Journal on Computing
Reconstructing truncated integer variables satisfying linear congruences

SIAM Journal on Computing - Special issue on cryptography
Inferring sequences produced by pseudo-random number generators

Journal of the ACM (JACM)
Inferring sequences produced by a linear congruential generator missing low-order bits

Journal of Cryptology
Finite fields

Finite fields
On the Distribution of Nonlinear Recursive Congruential Pseudorandom Numbers of Higher Orders

AAECC-13 Proceedings of the 13th International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
Iterations of Multivariate Polynomials and Discrepancy of Pseudorandom Numbers

AAECC-14 Proceedings of the 14th International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
Inferring sequences produced by a linear congruential generator on elliptic curves missing high-order bits

Designs, Codes and Cryptography
Attacking Power Generators Using Unravelled Linearization: When Do We Output Too Much?

ASIACRYPT '09 Proceedings of the 15th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
Pseudorandom vector sequences derived from triangular polynomial systems with constant multipliers

WAIFI'10 Proceedings of the Third international conference on Arithmetic of finite fields
On the provable security of an efficient RSA-Based pseudorandom generator

ASIACRYPT'06 Proceedings of the 12th international conference on Theory and Application of Cryptology and Information Security
On stern's attack against secret truncated linear congruential generators

ACISP'05 Proceedings of the 10th Australasian conference on Information Security and Privacy
Deciphering a linear congruential encryption

IEEE Transactions on Information Theory
Attacking the Pollard Generator

IEEE Transactions on Information Theory
Multivariate permutation polynomial systems and nonlinear pseudorandom number generators

Finite Fields and Their Applications
On pseudorandom numbers from multivariate polynomial systems

Finite Fields and Their Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

We study the security of the linear generator over a finite field. It is shown that the seed of a linear generator can be deduced from partial information of a short sequence of consecutive outputs of such generators.