Predicting masked linear pseudorandom number generators over finite fields
From MaRDI portal
Publication:1949235
DOI10.1007/s10623-012-9615-4zbMath1279.94082MaRDI QIDQ1949235
Álvar Ibeas, Domingo Gómez-Pérez, Igor E. Shparlinski, Jaime Gutierrez
Publication date: 6 May 2013
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10623-012-9615-4
11T71: Algebraic coding theory; cryptography (number-theoretic aspects)
94A55: Shift register sequences and sequences over finite alphabets in information and communication theory
94A60: Cryptography
11K45: Pseudo-random numbers; Monte Carlo methods
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On pseudorandom numbers from multivariate polynomial systems
- Multivariate permutation polynomial systems and nonlinear pseudorandom number generators
- Inferring sequences produced by a linear congruential generator on elliptic curves missing high-order bits
- Inferring sequences produced by a linear congruential generator missing low-order bits
- Lattice reduction: a toolbox for the cryptoanalyst
- Pseudorandom numbers and hash functions from iterations of multivariate polynomials
- Attacking the Pollard Generator
- Pseudorandom Vector Sequences Derived from Triangular Polynomial Systems with Constant Multipliers
- On the degree growth in some polynomial dynamical systems and nonlinear pseudorandom number generators
- Attacking Power Generators Using Unravelled Linearization: When Do We Output Too Much?
- Deciphering a linear congruential encryption
- A Simple Unpredictable Pseudo-Random Number Generator
- Reconstructing Truncated Integer Variables Satisfying Linear Congruences
- Inferring sequences produced by pseudo-random number generators
- How to predict congruential generators
- Predicting nonlinear pseudorandom number generators
- Cryptography and Coding
- On the Provable Security of an Efficient RSA-Based Pseudorandom Generator
- Information Security and Privacy
