Inferring sequences produced by the quadratic generator
From MaRDI portal
Publication:6134038
DOI10.1007/978-3-031-26553-2_26zbMATH Open1519.94120OpenAlexW4321354143MaRDI QIDQ6134038FDOQ6134038
Authors: Jing Gao, Jun Xu, Lei Hu 
Publication date: 21 August 2023
Published in: Information Security and Cryptology (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-031-26553-2_26
Recommendations
Cites Work
- Title not available (Why is that?)
- Toward a Rigorous Variation of Coppersmith’s Algorithm on Three Variables
- Reconstructing noisy polynomial evaluation in residue rings
- Predicting nonlinear pseudorandom number generators
- Cryptography and Coding
- A Strategy for Finding Roots of Multivariate Polynomials with New Applications in Attacking RSA Variants
- Lattice reduction: a toolbox for the cryptoanalyst
- Attacking the Pollard Generator
- Inferring sequences produced by pseudo-random number generators
- Inferring sequences produced by a linear congruential generator missing low-order bits
- Finding a Small Root of a Bivariate Integer Equation; Factoring with High Bits Known
- Cryptanalysis of the Quadratic Generator
- Inferring sequences produced by nonlinear pseudorandom number generators using Coppersmith's methods
- Finding a Small Root of a Univariate Modular Equation
- Partial Key Exposure Attacks on Takagi’s Variant of RSA
- A Tool Kit for Finding Small Roots of Bivariate Polynomials over the Integers
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)
