Random self-reducibility of ideal-SVP via Arakelov random walks
From MaRDI portal
Publication:2096524
Recommendations
Cites work
- A new polynomial factorization algorithm and its implementation
- A quantum algorithm for computing the unit group of an arbitrary degree number field
- An LLL algorithm for module lattices
- Approx-SVP in ideal lattices with pre-processing
- Calculating the power residue symbol and ibeta. Applications of computing the group structure of the principal units of a \(\mathfrak{p}\)-adic number field completion
- Class Field Theory
- Computing Arakelov class groups
- 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
- Efficient public key encryption based on ideal lattices (extended abstract)
- Expander graphs based on GRH with an application to elliptic curve cryptography
- 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
- Fully homomorphic encryption using ideal lattices
- Generalized Compact Knapsacks Are Collision Resistant
- Generalized compact knapsacks, cyclic lattices, and efficient one-way functions
- scientific article; zbMATH DE number 2154278 (Why is no real title available?)
- scientific article; zbMATH DE number 195101 (Why is no real title available?)
- scientific article; zbMATH DE number 2121181 (Why is no real title available?)
- scientific article; zbMATH DE number 918133 (Why is no real title available?)
- scientific article; zbMATH DE number 1445397 (Why is no real title available?)
- New bounds in some transference theorems in the geometry of numbers
- On a question of Lehmer and the number of irreducible factors of a polynomial
- On ideal lattices and learning with errors over rings
- On lattices, learning with errors, random linear codes, and cryptography
- On the minimum of the unit lattice
- On the shortness of vectors to be found by the ideal-SVP quantum algorithm
- Principles of harmonic analysis
- Random self-reducibility of ideal-SVP via Arakelov random walks
- Real cyclotomic fields of prime conductor and their class numbers
- Recovering short generators of principal ideals in cyclotomic rings
- Short Stickelberger class relations and application to Ideal-SVP
- Subexponential class group and unit group computation in large degree number fields
- Theory of Cryptography
- Toward basing fully homomorphic encryption on worst-case hardness
- Trapdoors for hard lattices and new cryptographic constructions
- Worst‐Case to Average‐Case Reductions Based on Gaussian Measures
Cited in
(10)- On the ideal shortest vector problem over random rational primes
- Random self-reducibility of ideal-SVP via Arakelov random walks
- 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
- Ideal-SVP is hard for small-norm uniform prime ideals
- Finding dense submodules with algebraic lattice reduction
- Group actions and harmonic analysis in number theory. Abstracts from the workshop held May 24--29, 2026
This page was built for publication: Random self-reducibility of ideal-SVP via Arakelov random walks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2096524)
