Pages that link to "Item:Q1272333"
From MaRDI portal
The following pages link to Lattice reduction: a toolbox for the cryptoanalyst (Q1272333):
Displayed 16 items.
- Non-standard approaches to integer programming (Q697562) (← links)
- On pseudorandom numbers from multivariate polynomial systems (Q708433) (← 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)
- 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)
- Quantum period reconstruction of approximate sequences (Q2379974) (← links)
- Pseudorandom numbers and hash functions from iterations of multivariate polynomials (Q2380848) (← links)
- On the linear complexity and multidimensional distribution of congruential generators over elliptic curves (Q2572963) (← 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)
- 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)