Inferring sequences produced by the quadratic generator
From MaRDI portal
Publication:6134038
Recommendations
Cites work
- scientific article; zbMATH DE number 1182510 (Why is no real title available?)
- A Strategy for Finding Roots of Multivariate Polynomials with New Applications in Attacking RSA Variants
- A Tool Kit for Finding Small Roots of Bivariate Polynomials over the Integers
- Attacking the Pollard Generator
- Cryptanalysis of the Quadratic Generator
- Cryptography and Coding
- Finding a small root of a bivariate integer equation; factoring with high bits known
- Finding a small root of a univariate modular equation
- Inferring sequences produced by a linear congruential generator missing low-order bits
- Inferring sequences produced by nonlinear pseudorandom number generators using Coppersmith's methods
- Inferring sequences produced by pseudo-random number generators
- Lattice reduction: a toolbox for the cryptoanalyst
- Partial key exposure attacks on Takagi's variant of RSA
- Predicting nonlinear pseudorandom number generators
- Reconstructing noisy polynomial evaluation in residue rings
- Toward a Rigorous Variation of Coppersmith’s Algorithm on Three Variables
Cited in
(1)
This page was built for publication: Inferring sequences produced by the quadratic generator
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6134038)