Fast practical lattice reduction through iterated compression
From MaRDI portal
Publication:6145939
DOI10.1007/978-3-031-38548-3_1OpenAlexW4385654471MaRDI QIDQ6145939
Publication date: 2 February 2024
Published in: Advances in Cryptology – CRYPTO 2023 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-031-38548-3_1
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- LLL for ideal lattices: re-evaluation of the security of Gentry-Halevi's FHE scheme
- Factoring polynomials with rational coefficients
- Lattice basis reduction: Improved practical algorithms and solving subset sum problems
- Small solutions to polynomial equations, and low exponent RSA vulnerabilities
- Fast reduction of algebraic lattices over cyclotomic fields
- Towards faster polynomial-time lattice reduction
- Cryptanalysis of elliptic curve hidden number problem from PKC 2017
- Subexponential time relations in the class group of large degree number fields
- Practical Multilinear Maps over the Integers
- Factoring RSA Keys from Certified Smart Cards: Coppersmith in the Wild
- Subexponential class group and unit group computation in large degree number fields
- H-LLL
- Public Key Compression and Modulus Switching for Fully Homomorphic Encryption over the Integers
- Perturbation Analysis of the QR factor R in the context of LLL lattice basis reduction
- Approximate common divisors via lattices
- Algorithms for the approximate common divisor problem
- Faster LLL-type Reduction of Lattice Bases
- Implementing Gentry’s Fully-Homomorphic Encryption Scheme
- BKZ 2.0: Better Lattice Security Estimates
- LLL reducing with the most significant bits
- Fully Homomorphic Encryption over the Integers
- An LLL Algorithm with Quadratic Complexity
- Lattice-based Cryptography
- Efficient quantum algorithms for computing class groups and solving the principal ideal problem in arbitrary degree number fields
- Accuracy and Stability of Numerical Algorithms
- On the equidistribution of Hecke points
- Batch Fully Homomorphic Encryption over the Integers
- Lattice Attacks on NTRU and LWE: A History of Refinements
- Fully homomorphic encryption using ideal lattices
- Hermite’s Constant and Lattice Algorithms
- Using LLL-Reduction for Solving RSA and Factorization Problems
- Fully Homomorphic Encryption over the Integers with Shorter Public Keys
- Rounding and Chaining LLL: Finding Faster Small Roots of Univariate Polynomial Congruences
- Scale-Invariant Fully Homomorphic Encryption over the Integers
- An LLL-reduction algorithm with quasi-linear time complexity
- Revisiting Lattice Attacks on Overstretched NTRU Parameters
- Algorithmic Number Theory
- NTRU Fatigue: How Stretched is Overstretched?
This page was built for publication: Fast practical lattice reduction through iterated compression
