Towards faster polynomial-time lattice reduction
From MaRDI portal
Publication:2128584
DOI10.1007/978-3-030-84245-1_26zbMath1486.94116OpenAlexW3190010441MaRDI QIDQ2128584
Paul Kirchner, Thomas Espitau, Pierre-Alain Fouque
Publication date: 22 April 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-84245-1_26
Cryptography (94A60) Number-theoretic algorithms; complexity (11Y16) Lattices and convex bodies (number-theoretic aspects) (11H06)
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Factoring polynomials and the knapsack problem
- Some inequalities related to the Seysen measure of a lattice
- Korkin-Zolotarev bases and successive minima of a lattice and its reciprocal lattice
- Factoring polynomials over global fields
- A hierarchy of polynomial time lattice basis reduction algorithms
- Factoring polynomials with rational coefficients
- Lattice reduction: a toolbox for the cryptoanalyst
- Simultaneous reduction of a lattice basis and its reciprocal basis
- Small solutions to polynomial equations, and low exponent RSA vulnerabilities
- Measuring, simulating and exploiting the head concavity phenomenon in BKZ
- Advanced lattice sieving on GPUs, with tensor cores
- Fast reduction of algebraic lattices over cyclotomic fields
- Faster enumeration-based lattice reduction: root Hermite factor \(k^{1/(2k)}\) time \(k^{k/8+o(k)}\)
- Slide reduction, revisited -- filling the gaps in SVP approximation
- Homomorphic encryption for finite automata
- Approx-SVP in ideal lattices with pre-processing
- The general sieve kernel and new records in lattice reduction
- Gradual sub-lattice reduction and a new complexity for factoring polynomials
- A relative van Hoeij algorithm over number fields
- Parallel integer relation detection: Techniques and applications
- Practical, Predictable Lattice Basis Reduction
- A Subfield Lattice Attack on Overstretched NTRU Assumptions
- Practical Multilinear Maps over the Integers
- Improved Security for a Ring-Based Fully Homomorphic Encryption Scheme
- Public Key Compression and Modulus Switching for Fully Homomorphic Encryption over the Integers
- Fully Homomophic Encryption over the Integers Revisited
- Faster LLL-type Reduction of Lattice Bases
- Polynomial Time Algorithms for Finding Integer Relations among Real Numbers
- BKZ 2.0: Better Lattice Security Estimates
- LLL reducing with the most significant bits
- New Multilinear Maps Over the Integers
- MPFR
- Fully Homomorphic Encryption over the Integers
- Lattice Enumeration Using Extreme Pruning
- An LLL Algorithm with Quadratic Complexity
- Complexity Analysis of a Parallel Lattice Basis Reduction Algorithm
- Block Reduced Lattice Bases and Successive Minima
- New directions in nearest neighbor searching with applications to lattice sieving
- A more efficient algorithm for lattice basis reduction
- Accuracy and Stability of Numerical Algorithms
- Batch Fully Homomorphic Encryption over the Integers
- Knapsack Public Key Cryptosystems and Diophantine Approximation
- Fully homomorphic encryption using ideal lattices
- Floating-Point LLL: Theoretical and Practical Aspects
- Analyzing Blockwise Lattice Algorithms Using Dynamical Systems
- 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
- On Schönhage's algorithm and subquadratic integer gcd computation
- Revisiting Lattice Attacks on Overstretched NTRU Parameters
- Algorithmic Number Theory
- Algorithms and Data Structures
This page was built for publication: Towards faster polynomial-time lattice reduction
