Attacks on pseudo random number generators hiding a linear structure
From MaRDI portal
Publication:2152156
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
Cites work
- A Strategy for Finding Roots of Multivariate Polynomials with New Applications in Attacking RSA Variants
- Cryptanalysis of the knapsack generator
- Easing Coppersmith methods using analytic combinatorics: applications to public-key cryptography with weak pseudorandomness
- Factoring polynomials with rational coefficients
- Lattice reduction: a toolbox for the cryptoanalyst
- Mean, Median and Mode in Binomial Distributions
- Reconstructing Truncated Integer Variables Satisfying Linear Congruences
- Subset sum pseudorandom numbers: fast generation and distribution
Cited in
(8)- A pseudorandom number generator based on worst-case lattice problems
- Practical seed-recovery of fast cryptographic pseudo-random number generators
- An improved method for predicting truncated multiple recursive generators with unknown parameters
- Recovering private keys generated with weak PRNGs
- Fault-injection based backdoors in Pseudo Random Number Generators
- Cryptanalysis of the knapsack generator
- Cryptanalytic attacks on pseudorandom number generators
- Information Security and Privacy
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)
