Fast reduction of algebraic lattices over cyclotomic fields
From MaRDI portal
Publication:2096520
Recommendations
- scientific article; zbMATH DE number 1254273
- Lattice Reduction Over Imaginary Quadratic Fields
- On the Reducibility of Cyclotomic Polynomials over Finite Fields
- Towards faster polynomial-time lattice reduction
- Fast arithmetic for the algebraic closure of finite fields
- scientific article; zbMATH DE number 1186973
- Faster LLL-type Reduction of Lattice Bases
- Faster polynomial multiplication over finite fields using cyclotomic coefficient rings
- Fast construction of irreducible polynomials over finite fields
- Fast construction of irreducible polynomials over finite fields
Cites work
- A generalization of the LLL-algorithm over Euclidean rings or orders
- A Subfield Lattice Attack on Overstretched NTRU Assumptions
- Accuracy and Stability of Numerical Algorithms
- Algorithms and Data Structures
- An algorithm for NTRU problems and cryptanalysis of the GGH multilinear map without a low-level encoding of zero
- An LLL algorithm for module lattices
- An LLL-reduction algorithm with quasi-linear time complexity, extended abstract
- Analyzing blockwise lattice algorithms using dynamical systems
- Candidate Multilinear Maps from Ideal Lattices
- Complexity Analysis of a Parallel Lattice Basis Reduction Algorithm
- Computing generator in cyclotomic integer rings. A subfield algorithm for the principal ideal problem in \(L_{|\varDelta_\mathbb {K}|}\left(\frac{1}{2}\right)\) and application to the cryptanalysis of a FHE scheme
- Computing the Iwasawa decomposition of the classical Lie groups of noncompact type using the \(QR\) decomposition
- Cryptanalysis of GGH map
- Factoring polynomials with rational coefficients
- Faster LLL-type Reduction of Lattice Bases
- Finding short lattice vectors within Mordell's inequality
- Floating-Point LLL Revisited
- scientific article; zbMATH DE number 4061354 (Why is no real title available?)
- scientific article; zbMATH DE number 1256724 (Why is no real title available?)
- scientific article; zbMATH DE number 1263369 (Why is no real title available?)
- scientific article; zbMATH DE number 1273650 (Why is no real title available?)
- scientific article; zbMATH DE number 2086714 (Why is no real title available?)
- scientific article; zbMATH DE number 961607 (Why is no real title available?)
- Implementing candidate graded encoding schemes from ideal lattices
- Lattice basis reduction: Improved practical algorithms and solving subset sum problems
- Lattice reductions over Euclidean rings with applications to cryptanalysis
- More efficient algorithms for the NTRU key generation using the field norm
- On ideal lattices and learning with errors over rings
- On lattices, learning with errors, random linear codes, and cryptography
- Practical, Predictable Lattice Basis Reduction
- Recovering short generators of principal ideals in cyclotomic rings
- Revisiting Lattice Attacks on Overstretched NTRU Parameters
- Simultaneous reduction of a lattice basis and its reciprocal basis
- Small solutions to polynomial equations, and low exponent RSA vulnerabilities
- Symplectic Lattice Reduction and NTRU
- Testing isomorphism of lattices over CM-orders
- Worst-case to average-case reductions for module lattices
Cited in
(10)- Lattice reduction for modules, or how to reduce ModuleSVP to ModuleSVP
- Towards faster polynomial-time lattice reduction
- Faster LLL-type Reduction of Lattice Bases
- scientific article; zbMATH DE number 1256681 (Why is no real title available?)
- Shorter hash-and-sign lattice-based signatures
- Fast practical lattice reduction through iterated compression
- Reductions from module lattices to free module lattices, and application to dequantizing module-LLL
- Cryptanalysis of rank-2 module-LIP in totally real number fields
- Finding dense submodules with algebraic lattice reduction
- DAWN: smaller and faster NTRU encryption via double encoding
This page was built for publication: Fast reduction of algebraic lattices over cyclotomic fields
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2096520)
