The following pages link to Floating-Point LLL Revisited (Q5385731):
Displaying 9 items.
- An efficient lattice reduction using reuse technique blockwisely on NTRU (Q317407) (← links)
- PotLLL: a polynomial time version of LLL with deep insertions (Q398939) (← links)
- A public key cryptosystem based on three new provable problems (Q418738) (← links)
- LLL for ideal lattices: re-evaluation of the security of Gentry-Halevi's FHE scheme (Q498985) (← links)
- Modular Las Vegas algorithms for polynomial absolute factorization (Q607052) (← links)
- An experimental comparison of some LLL-type lattice basis reduction algorithms (Q722627) (← links)
- Probability method for cryptanalysis of general multivariate modular linear equation (Q848370) (← links)
- Flat Tori with Large Laplacian Eigenvalues in Dimensions up to Eight (Q6043377) (← links)
- Practical attacks on small private exponent RSA: new records and new insights (Q6070359) (← links)
