Subfield algorithms for ideal- and module-SVP based on the decomposition group
From MaRDI portal
Publication:6196952
DOI10.4064/bc126-10arXiv2105.03219MaRDI QIDQ6196952
Cong Ling, Andrew Mendelsohn, Christian Porter
Publication date: 15 March 2024
Published in: Banach Center Publications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2105.03219
Cryptography (94A60) Number-theoretic algorithms; complexity (11Y16) Quadratic forms (reduction theory, extreme forms, etc.) (11H55)
Cites Work
- Explicit factorizations of cyclotomic polynomials over finite fields
- On explicit factors of cyclotomic polynomials over finite fields
- A generalization of the LLL-algorithm over Euclidean rings or orders
- Factoring polynomials with rational coefficients
- Lattice basis reduction: Improved practical algorithms and solving subset sum problems
- Factorization of the cyclotomic polynomial \(x^{2^n}+1\) over finite fields
- Lattice reductions over Euclidean rings with applications to cryptanalysis
- A Subfield Lattice Attack on Overstretched NTRU Assumptions
- Making NTRU as Secure as Worst-Case Problems over Ideal Lattices
- On Ideal Lattices and Learning with Errors over Rings
- Efficient quantum algorithms for computing class groups and solving the principal ideal problem in arbitrary degree number fields
- Short Bases of Lattices over Number Fields
- Elementary Methods in Number Theory
- Pseudorandomness of ring-LWE for any ring and modulus
- Lattice Reduction Over Imaginary Quadratic Fields
- Computing Generator in Cyclotomic Integer Rings
- Short Stickelberger Class Relations and Application to Ideal-SVP
- Recovering Short Generators of Principal Ideals in Cyclotomic Rings
- On lattices, learning with errors, random linear codes, and cryptography
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Subfield algorithms for ideal- and module-SVP based on the decomposition group
