The following pages link to Floating-Point LLL Revisited (Q5385731):
Displayed 13 items.
- Higher-dimensional 3-adic CM construction (Q2475072) (← links)
- Fast LLL-type lattice reduction (Q2490117) (← links)
- Explicit Hard Instances of the Shortest Vector Problem (Q3535352) (← links)
- Symplectic Lattice Reduction and NTRU (Q3593099) (← links)
- Cryptanalysis of General Lu-Lee Type Systems (Q3600350) (← links)
- Rigorous and Efficient Short Lattice Vectors Enumeration (Q3600387) (← links)
- Solving Linear Equations Modulo Divisors: On Factoring Given Any Bits (Q3600388) (← links)
- Identification and signatures based on NP-hard problems of indefinite quadratic forms (Q3612243) (← links)
- Worst Cases for the Exponential Function in the IEEE 754r decimal64 Format (Q5302769) (← links)
- Solving Systems of Modular Equations in One Variable: How Many RSA-Encrypted Messages Does Eve Need to Know? (Q5445445) (← links)
- A Digital Signature Scheme Based on CVP ∞ (Q5445459) (← links)
- Speeding-Up Lattice Reduction with Random Projections (Extended Abstract) (Q5458537) (← links)
- Predicting Lattice Reduction (Q5458584) (← links)