Log-\(\mathcal{S}\)-unit lattices using explicit Stickelberger generators to solve approx ideal-SVP
From MaRDI portal
Publication:6135454
DOI10.1007/978-3-031-22969-5_23zbMath1519.94050OpenAlexW4317928203MaRDI QIDQ6135454
Olivier Bernard, Andrea Lesavourey, Tuong-Huy Nguyen, Adeline Roux-Langlois
Publication date: 25 August 2023
Published in: Advances in Cryptology – ASIACRYPT 2022 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-031-22969-5_23
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On Lovász' lattice reduction and the nearest lattice point problem
- A hierarchy of polynomial time lattice basis reduction algorithms
- On the Stickelberger ideal and the circular units of an abelian field
- Factoring polynomials with rational coefficients
- On bases of the Stickelberger ideal and of the group of circular units of a cyclotomic field
- On the Stickelberger ideal and the circular units of a cyclotomic field
- Lattice basis reduction: Improved practical algorithms and solving subset sum problems
- The Magma algebra system. I: The user language
- Sieving for closest lattice vectors (with preprocessing)
- Random self-reducibility of ideal-SVP via Arakelov random walks
- On the shortness of vectors to be found by the ideal-SVP quantum algorithm
- Approx-SVP in ideal lattices with pre-processing
- Catalan's conjecture
- Twisted-PHS: using the product formula to solve approx-SVP in ideal lattices
- Subexponential class group and unit group computation in large degree number fields
- Class numbers of real cyclotomic fields of composite conductor
- BKZ 2.0: Better Lattice Security Estimates
- Explicit Bounds for Primality Testing and Related Problems
- On Ideal Lattices and Learning with Errors over Rings
- Efficient Public Key Encryption Based on Ideal Lattices
- Efficient quantum algorithms for computing class groups and solving the principal ideal problem in arbitrary degree number fields
- Class numbers of real cyclotomic fields of prime conductor
- Mildly Short Vectors in Cyclotomic Ideal Lattices in Quantum Polynomial Time
- A quantum algorithm for computing the unit group of an arbitrary degree number field
- Small generators of the ideal class group
- Predicting Lattice Reduction
- Computing Generator in Cyclotomic Integer Rings
- Short Stickelberger Class Relations and Application to Ideal-SVP
- Recovering Short Generators of Principal Ideals in Cyclotomic Rings
- Log-\(\mathcal{S}\)-unit lattices using explicit Stickelberger generators to solve approx ideal-SVP
- Generating subgroups of ray class groups with small prime ideals
- Norm relations and computational problems in number fields
This page was built for publication: Log-\(\mathcal{S}\)-unit lattices using explicit Stickelberger generators to solve approx ideal-SVP
