Short Stickelberger Class Relations and Application to Ideal-SVP
From MaRDI portal
Publication:5738882
DOI10.1007/978-3-319-56620-7_12zbMath1411.94057OpenAlexW2578134341MaRDI QIDQ5738882
Ronald Cramer, Léo Ducas, Benjamin Wesolowski
Publication date: 13 June 2017
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://ir.cwi.nl/pub/25744
Related Items (26)
Universal product learning with errors: a new variant of \textsf{LWE} for lattice-based cryptography ⋮ On the ring-LWE and polynomial-LWE problems ⋮ Application of automorphic forms to lattice problems ⋮ Non-commutative ring learning with errors from cyclic algebras ⋮ Vandermonde meets Regev: public key encryption schemes based on partial Vandermonde problems ⋮ A Ring-LWE-based digital signature inspired by Lindner-Peikert scheme ⋮ Quantum algorithms for variants of average-case lattice problems via filtering ⋮ Log-\(\mathcal{S}\)-unit lattices using explicit Stickelberger generators to solve approx ideal-SVP ⋮ Generating subgroups of ray class groups with small prime ideals ⋮ Post-quantum key exchange for the Internet and the open quantum safe project ⋮ Lattice-based cryptography: a survey ⋮ Reductions from module lattices to free module lattices, and application to dequantizing module-LLL ⋮ Subfield algorithms for ideal- and module-SVP based on the decomposition group ⋮ Twisted-PHS: using the product formula to solve approx-SVP in ideal lattices ⋮ Small Fields with Large Class Groups ⋮ Approximate short vectors in ideal lattices of \(\mathbb{Q}(\zeta_{p^e})\) with precomputation of \({\mathrm {Cl}}(\mathcal{O}_K)\) ⋮ Security analysis of cryptosystems using short generators over ideal lattices ⋮ Provably Secure NTRU Instances over Prime Cyclotomic Rings ⋮ Constraint-Hiding Constrained PRFs for NC $$^1$$ from LWE ⋮ TFHE: fast fully homomorphic encryption over the torus ⋮ On the ideal shortest vector problem over random rational primes ⋮ LWE from non-commutative group rings ⋮ Practical \(\mathsf{MP} \text{- }\mathsf{LWE}\)-based encryption balancing security-risk versus efficiency ⋮ Lattice reduction for modules, or how to reduce ModuleSVP to ModuleSVP ⋮ Random self-reducibility of ideal-SVP via Arakelov random walks ⋮ On the quantum complexity of the continuous hidden subgroup problem
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A generalization of the LLL-algorithm over Euclidean rings or orders
- Expander graphs based on GRH with an application to elliptic curve cryptography
- 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
- NTRU prime: reducing attack surface at low cost
- Worst-case to average-case reductions for module lattices
- Generalized compact knapsacks, cyclic lattices, and efficient one-way functions
- Catalan's conjecture
- Subexponential class group and unit group computation in large degree number fields
- FHEW: Bootstrapping Homomorphic Encryption in Less Than a Second
- Making NTRU as Secure as Worst-Case Problems over Ideal Lattices
- Explicit Bounds for Primality Testing and Related Problems
- Fully Homomorphic Encryption with Relatively Small Key and Ciphertext Sizes
- Generalized Compact Knapsacks Are Collision Resistant
- Efficient Public Key Encryption Based on Ideal Lattices
- Euclid's Algorithm in Cyclotomic Fields
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- Minus class groups of the fields of the 𝑙-th roots of unity
- 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
- Candidate Multilinear Maps from Ideal Lattices
- Fully Homomorphic Encryption from Ring-LWE and Security for Key Dependent Messages
- 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
- GGHLite: More Efficient Multilinear Maps from Ideal Lattices
- Computing Generator in Cyclotomic Integer Rings
- Recovering Short Generators of Principal Ideals in Cyclotomic Rings
- Theory of Cryptography
- On lattices, learning with errors, random linear codes, and cryptography
This page was built for publication: Short Stickelberger Class Relations and Application to Ideal-SVP
