Pages that link to "Item:Q1272333"
From MaRDI portal
The following pages link to Lattice reduction: a toolbox for the cryptoanalyst (Q1272333):
Displaying 39 items.
- Non-standard approaches to integer programming (Q697562) (← links)
- On pseudorandom numbers from multivariate polynomial systems (Q708433) (← links)
- Parallel Cholesky-based reduction for the weighted integer least squares problem (Q727439) (← links)
- Inferring sequences produced by a linear congruential generator on elliptic curves missing high-order bits (Q1009176) (← links)
- The optimal LLL algorithm is still polynomial in fixed dimension. (Q1401288) (← links)
- Scalable zero knowledge via cycles of elliptic curves (Q1688401) (← links)
- Lattice reductions over Euclidean rings with applications to cryptanalysis (Q1744870) (← links)
- Noisy Chinese remaindering in the Lee norm (Q1827579) (← links)
- Random lattices, threshold phenomena and efficient reduction algorithms. (Q1853481) (← links)
- Predicting masked linear pseudorandom number generators over finite fields (Q1949235) (← links)
- Slide reduction, revisited -- filling the gaps in SVP approximation (Q2096526) (← links)
- A physical study of the LLL algorithm (Q2112788) (← links)
- Towards faster polynomial-time lattice reduction (Q2128584) (← links)
- Attacks on pseudo random number generators hiding a linear structure (Q2152156) (← links)
- Predicting truncated multiple recursive generators with unknown parameters (Q2182075) (← links)
- Quantum period reconstruction of approximate sequences (Q2379974) (← links)
- Pseudorandom numbers and hash functions from iterations of multivariate polynomials (Q2380848) (← links)
- Towards factoring in \(\mathrm{SL}(2,\mathbb F_{2^n})\) (Q2448084) (← links)
- On lattice profile of the elliptic curve linear congruential generators (Q2453814) (← links)
- On the linear complexity and multidimensional distribution of congruential generators over elliptic curves (Q2572963) (← links)
- A note on the concrete hardness of the shortest independent vector in lattices (Q2656338) (← links)
- Attacking the linear congruential generator on elliptic curves via lattice techniques (Q2673768) (← links)
- An improved method for predicting truncated multiple recursive generators with unknown parameters (Q2701486) (← links)
- Lattice reduction in cryptology: An update (Q2739436) (← links)
- Analysis of Lattice Reduction Attack against the Somewhat Homomorphic Encryption Based on Ideal Lattices (Q2875699) (← links)
- A sieve algorithm based on overlattices (Q2878827) (← links)
- Recovering zeros of polynomials modulo a prime (Q3189458) (← links)
- On the degree growth in some polynomial dynamical systems and nonlinear pseudorandom number generators (Q3584787) (← links)
- Rigorous and Efficient Short Lattice Vectors Enumeration (Q3600387) (← links)
- (Q4364546) (← links)
- Predicting nonlinear pseudorandom number generators (Q4671848) (← links)
- Improvements to the general number field sieve for discrete logarithms in prime fields. A comparison with the gaussian integer method (Q4794653) (← links)
- Lattice Algorithms for Compression Color Space Estimation in JPEG Images (Q4917104) (← links)
- Cryptographic Functions from Worst-Case Complexity Assumptions (Q5188549) (← links)
- Deterministic Construction of an Approximate M-Ellipsoid and its Application to Derandomizing Lattice Algorithms (Q5743489) (← links)
- Reconstructing points of superelliptic curves over a prime finite field (Q6089463) (← links)
- Inferring sequences produced by the quadratic generator (Q6134038) (← links)
- Economical convex coverings and applications (Q6583674) (← links)
- Too many hints -- when LLL breaks LWE (Q6604869) (← links)
