The following pages link to Fast LLL-type lattice reduction (Q2490117):
Displaying 14 items.
- 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)
- Parallel Cholesky-based reduction for the weighted integer least squares problem (Q727439) (← links)
- Probability method for cryptanalysis of general multivariate modular linear equation (Q848370) (← links)
- Segment LLL reduction of lattice bases using modular arithmetic (Q1662551) (← links)
- Perturbation Analysis of the QR factor R in the context of LLL lattice basis reduction (Q2894516) (← links)
- Lattice Reduction for Modular Knapsack (Q3455505) (← links)
- Efficient Modular Arithmetic in Adapted Modular Number System Using Lagrange Representation (Q3511182) (← links)
- Cryptanalysis of General Lu-Lee Type Systems (Q3600350) (← links)
- Efficient UC-Secure Authenticated Key-Exchange for Algebraic Languages (Q4916015) (← links)
- Efficient Nyberg-Rueppel type of NTRU digital signature algorithm (Q5101024) (← links)
- Cryptographic Functions from Worst-Case Complexity Assumptions (Q5188549) (← links)
- A Digital Signature Scheme Based on CVP ∞ (Q5445459) (← links)
