Random self-reducibility of ideal-SVP via Arakelov random walks
From MaRDI portal
Publication:2096524
DOI10.1007/978-3-030-56880-1_9zbMath1504.94130OpenAlexW3013541847MaRDI QIDQ2096524
Alice Pellet-Mary, Benjamin Wesolowski, Léo Ducas, Koen de Boer
Publication date: 9 November 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-56880-1_9
Cryptography (94A60) Class numbers, class groups, discriminants (11R29) Relations with coding theory (11H71)
Related Items (6)
Application of automorphic forms to lattice problems ⋮ Some easy instances of ideal-SVP and implications on the partial Vandermonde knapsack problem ⋮ Log-\(\mathcal{S}\)-unit lattices using explicit Stickelberger generators to solve approx ideal-SVP ⋮ On module unique-SVP and NTRU ⋮ On the hardness of the NTRU problem ⋮ Random self-reducibility of ideal-SVP via Arakelov random walks
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Expander graphs based on GRH with an application to elliptic curve cryptography
- New bounds in some transference theorems in the geometry of numbers
- A new polynomial factorization algorithm and its implementation
- Random self-reducibility of ideal-SVP via Arakelov random walks
- An LLL algorithm for module lattices
- On the shortness of vectors to be found by the ideal-SVP quantum algorithm
- Approx-SVP in ideal lattices with pre-processing
- Generalized compact knapsacks, cyclic lattices, and efficient one-way functions
- Subexponential class group and unit group computation in large degree number fields
- On a question of Lehmer and the number of irreducible factors of a polynomial
- Trapdoors for hard lattices and new cryptographic constructions
- Toward Basing Fully Homomorphic Encryption on Worst-Case Hardness
- Generalized Compact Knapsacks Are Collision Resistant
- Computing Arakelov class groups
- Efficient Public Key Encryption Based on Ideal Lattices
- On the minimum of the unit lattice
- Class Field Theory
- Calculating the Power Residue Symbol and Ibeta
- Fully homomorphic encryption using ideal lattices
- A quantum algorithm for computing the unit group of an arbitrary degree number field
- Real cyclotomic fields of prime conductor and their class numbers
- On Ideal Lattices and Learning with Errors over Rings
- Worst‐Case to Average‐Case Reductions Based on Gaussian Measures
- Computing Generator in Cyclotomic Integer Rings
- Short Stickelberger Class Relations and Application to Ideal-SVP
- Recovering Short Generators of Principal Ideals in Cyclotomic Rings
- Theory of Cryptography
- On lattices, learning with errors, random linear codes, and cryptography
- Principles of harmonic analysis
- Explicit bounds for residues of Dedekind zeta functions, values of \(L\)-functions at \(s=1\), and relative class numbers
- Factoring polynomials over finite fields: A survey
This page was built for publication: Random self-reducibility of ideal-SVP via Arakelov random walks
