Predicting masked linear pseudorandom number generators over finite fields

DOI10.1007/S10623-012-9615-4MaRDI QIDQ1949235zbMATH OpenOpenAlexFDO

Authors Á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

zbMATH Keywords

cryptographyfinite fieldspseudorandom numbers

Mathematics Subject Classification ID

Pseudo-random numbers; Monte Carlo methods (11K45) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Cryptography (94A60)

Recommendations

• Inferring sequences produced by pseudo-random number generators
• Publication:5751837
• Predicting nonlinear pseudorandom number generators
• Predicting truncated multiple recursive generators with unknown parameters
• How to predict congruential generators

Cites work

• A Simple Unpredictable Pseudo-Random Number Generator
• Attacking power generators using unravelled linearization: when do we output too much?
• Attacking the Pollard Generator
• Cryptography and Coding
• Deciphering a linear congruential encryption
• How to predict congruential generators
• scientific article; zbMATH DE number 2081136 (Why is no real title available?)
• scientific article; zbMATH DE number 1504654 (Why is no real title available?)
• scientific article; zbMATH DE number 967590 (Why is no real title available?)
• Inferring sequences produced by a linear congruential generator missing low-order bits
• Inferring sequences produced by a linear congruential generator on elliptic curves missing high-order bits
• Inferring sequences produced by pseudo-random number generators
• Information Security and Privacy
• Lattice reduction: a toolbox for the cryptoanalyst
• Multivariate permutation polynomial systems and nonlinear pseudorandom number generators
• On pseudorandom numbers from multivariate polynomial systems
• On the degree growth in some polynomial dynamical systems and nonlinear pseudorandom number generators
• On the Provable Security of an Efficient RSA-Based Pseudorandom Generator
• Predicting nonlinear pseudorandom number generators
• Pseudorandom numbers and hash functions from iterations of multivariate polynomials
• Pseudorandom Vector Sequences Derived from Triangular Polynomial Systems with Constant Multipliers
• Reconstructing Truncated Integer Variables Satisfying Linear Congruences

Cited in

(2)

• Predicting truncated multiple recursive generators with unknown parameters
• Computing conditional probabilities for F₂-linear pseudorandom bit generators by splitting MacWilliams identity

This page was built for publication: Predicting masked linear pseudorandom number generators over finite fields

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1949235)