Attacks on pseudo random number generators hiding a linear structure

DOI10.1007/978-3-030-95312-6_7zbMATH Open1501.94049OpenAlexW4226372749MaRDI QIDQ2152156FDOQ2152156

Authors: Florette Martinez 

Publication date: 6 July 2022

Full work available at URL: https://doi.org/10.1007/978-3-030-95312-6_7

Recommendations

• Cryptanalytic attacks on pseudorandom number generators
• Practical seed-recovery of fast cryptographic pseudo-random number generators
• Inferring sequences produced by pseudo-random number generators
• Predicting truncated multiple recursive generators with unknown parameters
• Inferring sequences produced by nonlinear pseudorandom number generators using Coppersmith's methods

zbMATH Keywords

knapsack problemcryptanalysispseudo-random number generatorsCoppersmith methods

Mathematics Subject Classification ID

Cryptography (94A60)

Cites Work

• Factoring polynomials with rational coefficients
• Mean, Median and Mode in Binomial Distributions
• A Strategy for Finding Roots of Multivariate Polynomials with New Applications in Attacking RSA Variants
• Reconstructing Truncated Integer Variables Satisfying Linear Congruences
• Lattice reduction: a toolbox for the cryptoanalyst
• Easing Coppersmith Methods Using Analytic Combinatorics: Applications to Public-Key Cryptography with Weak Pseudorandomness
• Cryptanalysis of the knapsack generator
• Subset sum pseudorandom numbers: fast generation and distribution

Cited In (4)

• Cryptanalysis of the knapsack generator
• Fault-injection based backdoors in Pseudo Random Number Generators
• Information Security and Privacy
• An improved method for predicting truncated multiple recursive generators with unknown parameters

Uses Software

• NumPy
• AS 183

This page was built for publication: Attacks on pseudo random number generators hiding a linear structure

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