Pages that link to "Item:Q5188541"
From MaRDI portal
The following pages link to Floating-Point LLL: Theoretical and Practical Aspects (Q5188541):
Displaying 18 items.
- Shortest vector from lattice sieving: a few dimensions for free (Q1648783) (← links)
- Segment LLL reduction of lattice bases using modular arithmetic (Q1662551) (← links)
- Towards faster polynomial-time lattice reduction (Q2128584) (← links)
- Cryptanalysis of a quadratic compact knapsack public-key cryptosystem (Q2429000) (← links)
- Gradual sub-lattice reduction and a new complexity for factoring polynomials (Q2429362) (← links)
- Remarks on the cryptanalysis of common prime RSA for IoT constrained low power devices (Q2666752) (← links)
- H-LLL: using Householder inside LLL (Q2883828) (← links)
- LNS with Co-Transformation Competes with Floating-Point (Q2985681) (← links)
- Rigorous and Efficient Short Lattice Vectors Enumeration (Q3600387) (← links)
- Handbook of Floating-Point Arithmetic (Q3629031) (← links)
- Effect of the interval-symbol method with correct zero rewriting on the δ-LLL algorithm (Q4630307) (← links)
- (Q4787201) (← links)
- FloatX (Q4960963) (← links)
- Forty years of attacks on the RSA cryptosystem: A brief survey (Q5030492) (← links)
- Floating-Point LLL Revisited (Q5385731) (← links)
- A Vectorized, Cache Efficient LLL Implementation (Q5862555) (← links)
- An Efficient Algorithm for Integer Lattice Reduction (Q6154950) (← links)
- Improved computation of polynomial roots over number fields when using complex embeddings (Q6671812) (← links)
