Fast practical lattice reduction through iterated compression
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 47363 (Why is no real title available?)
- scientific article; zbMATH DE number 1273650 (Why is no real title available?)
- scientific article; zbMATH DE number 1182510 (Why is no real title available?)
- scientific article; zbMATH DE number 2081057 (Why is no real title available?)
- scientific article; zbMATH DE number 2085214 (Why is no real title available?)
- scientific article; zbMATH DE number 1852134 (Why is no real title available?)
- scientific article; zbMATH DE number 1852136 (Why is no real title available?)
- scientific article; zbMATH DE number 1852137 (Why is no real title available?)
- Accuracy and Stability of Numerical Algorithms
- Algorithmic Number Theory
- Algorithms for the approximate common divisor problem
- An LLL algorithm with quadratic complexity
- An LLL-reduction algorithm with quasi-linear time complexity, extended abstract
- Approximate common divisors via lattices
- BKZ 2.0: Better lattice security estimates
- Batch fully homomorphic encryption over the integers
- Cryptanalysis of elliptic curve hidden number problem from PKC 2017
- Efficient quantum algorithms for computing class groups and solving the principal ideal problem in arbitrary degree number fields
- Factoring RSA keys from certified smart cards: Coppersmith in the wild
- Factoring polynomials with rational coefficients
- Fast reduction of algebraic lattices over cyclotomic fields
- Faster LLL-type Reduction of Lattice Bases
- Fully homomorphic encryption over the integers
- Fully homomorphic encryption over the integers with shorter public keys
- Fully homomorphic encryption using ideal lattices
- H-LLL: using Householder inside LLL
- Hermite’s Constant and Lattice Algorithms
- Implementing Gentry's fully-homomorphic encryption scheme
- LLL for ideal lattices: re-evaluation of the security of Gentry-Halevi's FHE scheme
- LLL reducing with the most significant bits
- Lattice attacks on NTRU and LWE: a history of refinements
- Lattice basis reduction: Improved practical algorithms and solving subset sum problems
- Lattice-based Cryptography
- NTRU Fatigue: How Stretched is Overstretched?
- On the equidistribution of Hecke points
- Perturbation analysis of the QR factor R in the context of LLL lattice basis reduction
- Practical multilinear maps over the integers
- Public Key Compression and Modulus Switching for Fully Homomorphic Encryption over the Integers
- Revisiting Lattice Attacks on Overstretched NTRU Parameters
- Rounding and chaining LLL: finding faster small roots of univariate polynomial congruences
- Scale-invariant fully homomorphic encryption over the integers
- Small solutions to polynomial equations, and low exponent RSA vulnerabilities
- Subexponential class group and unit group computation in large degree number fields
- Subexponential time relations in the class group of large degree number fields
- Towards faster polynomial-time lattice reduction
- Using LLL-reduction for solving RSA and factorization problems
Cited in
(12)- Enhanced bound for the commutative isogeny hidden number problem in CSURF
- Factoring sparse polynomials fast
- Cryptanalysis of an efficient signature based on isotropic quadratic forms
- The cool and the cruel: separating hard parts of LWE secrets
- New results on elliptic curve hidden number problem for ECDH key exchange
- Towards a modern LLL implementation
- Refined attack on LWE with hints: constructing lattice via Gaussian elimination
- New results on the -hiding assumption and factoring related RSA moduli
- A New Upper Bound on the Smallest Counterexample to the Mertens Conjecture
- Solving multivariate Coppersmith problems with known moduli
- About LLL reduction algorithms when solving the HNP problem and their comparative analysis
- Improved computation of polynomial roots over number fields when using complex embeddings
This page was built for publication: Fast practical lattice reduction through iterated compression
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6145939)
