Fast reduction of algebraic lattices over cyclotomic fields
From MaRDI portal
Publication:2096520
DOI10.1007/978-3-030-56880-1_6zbMath1504.94161OpenAlexW3048502882MaRDI QIDQ2096520
Thomas Espitau, Paul Kirchner, Pierre-Alain Fouque
Publication date: 9 November 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-56880-1_6
Related Items (3)
Towards faster polynomial-time lattice reduction ⋮ Shorter hash-and-sign lattice-based signatures ⋮ Fast practical lattice reduction through iterated compression
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A generalization of the LLL-algorithm over Euclidean rings or orders
- Computing the Iwasawa decomposition of the classical Lie groups of noncompact type using the \(QR\) decomposition
- Factoring polynomials with rational coefficients
- Simultaneous reduction of a lattice basis and its reciprocal basis
- Lattice basis reduction: Improved practical algorithms and solving subset sum problems
- Small solutions to polynomial equations, and low exponent RSA vulnerabilities
- Lattice reductions over Euclidean rings with applications to cryptanalysis
- An LLL algorithm for module lattices
- More efficient algorithms for the NTRU key generation using the field norm
- Worst-case to average-case reductions for module lattices
- Implementing Candidate Graded Encoding Schemes from Ideal Lattices
- Cryptanalysis of GGH Map
- Practical, Predictable Lattice Basis Reduction
- A Subfield Lattice Attack on Overstretched NTRU Assumptions
- An algorithm for NTRU problems and cryptanalysis of the GGH multilinear map without a low-level encoding of zero
- Faster LLL-type Reduction of Lattice Bases
- On Ideal Lattices and Learning with Errors over Rings
- Symplectic Lattice Reduction and NTRU
- Complexity Analysis of a Parallel Lattice Basis Reduction Algorithm
- Accuracy and Stability of Numerical Algorithms
- Candidate Multilinear Maps from Ideal Lattices
- Analyzing Blockwise Lattice Algorithms Using Dynamical Systems
- Testing Isomorphism of Lattices over CM-Orders
- Floating-Point LLL Revisited
- An LLL-reduction algorithm with quasi-linear time complexity
- Revisiting Lattice Attacks on Overstretched NTRU Parameters
- Computing Generator in Cyclotomic Integer Rings
- Recovering Short Generators of Principal Ideals in Cyclotomic Rings
- Algorithms and Data Structures
- On lattices, learning with errors, random linear codes, and cryptography
This page was built for publication: Fast reduction of algebraic lattices over cyclotomic fields
