Lattice reduction: a toolbox for the cryptoanalyst
From MaRDI portal
Publication:1272333
DOI10.1007/s001459900042zbMath0919.94011OpenAlexW1981326822MaRDI QIDQ1272333
Publication date: 26 August 1999
Published in: Journal of Cryptology (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s001459900042
Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Number-theoretic algorithms; complexity (11Y16)
Related Items
Towards faster polynomial-time lattice reduction ⋮ Improvements to the general number field sieve for discrete logarithms in prime fields. A comparison with the gaussian integer method ⋮ Quantum period reconstruction of approximate sequences ⋮ Pseudorandom numbers and hash functions from iterations of multivariate polynomials ⋮ Attacks on pseudo random number generators hiding a linear structure ⋮ Recovering zeros of polynomials modulo a prime ⋮ A note on the concrete hardness of the shortest independent vector in lattices ⋮ Predicting truncated multiple recursive generators with unknown parameters ⋮ Attacking the linear congruential generator on elliptic curves via lattice techniques ⋮ Scalable zero knowledge via cycles of elliptic curves ⋮ Reconstructing points of superelliptic curves over a prime finite field ⋮ The optimal LLL algorithm is still polynomial in fixed dimension. ⋮ Inferring sequences produced by the quadratic generator ⋮ Predicting masked linear pseudorandom number generators over finite fields ⋮ An improved method for predicting truncated multiple recursive generators with unknown parameters ⋮ Towards factoring in \(\mathrm{SL}(2,\mathbb F_{2^n})\) ⋮ On lattice profile of the elliptic curve linear congruential generators ⋮ Lattice Algorithms for Compression Color Space Estimation in JPEG Images ⋮ Non-standard approaches to integer programming ⋮ On the degree growth in some polynomial dynamical systems and nonlinear pseudorandom number generators ⋮ Predicting nonlinear pseudorandom number generators ⋮ On pseudorandom numbers from multivariate polynomial systems ⋮ Cryptographic Functions from Worst-Case Complexity Assumptions ⋮ Rigorous and Efficient Short Lattice Vectors Enumeration ⋮ Parallel Cholesky-based reduction for the weighted integer least squares problem ⋮ Inferring sequences produced by a linear congruential generator on elliptic curves missing high-order bits ⋮ Deterministic Construction of an Approximate M-Ellipsoid and its Application to Derandomizing Lattice Algorithms ⋮ Noisy Chinese remaindering in the Lee norm ⋮ On the linear complexity and multidimensional distribution of congruential generators over elliptic curves ⋮ Slide reduction, revisited -- filling the gaps in SVP approximation ⋮ Random lattices, threshold phenomena and efficient reduction algorithms. ⋮ A physical study of the LLL algorithm ⋮ A sieve algorithm based on overlattices
