Computing Generator in Cyclotomic Integer Rings
From MaRDI portal
Publication:5738871
DOI10.1007/978-3-319-56620-7_3zbMath1410.94047OpenAlexW2618360062MaRDI QIDQ5738871
Alexandre Gélin, Pierre-Alain Fouque, Thomas Espitau, Paul Kirchner, Jean-François Biasse
Publication date: 13 June 2017
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-56620-7_3
Related Items
NTRU Fatigue: How Stretched is Overstretched?, A proof of the conjectured run time of the Hafner-McCurley class group algorithm, Log-\(\mathcal{S}\)-unit lattices using explicit Stickelberger generators to solve approx ideal-SVP, Fast multiquadratic S-unit computation and application to the calculation of class groups, 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, 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, Short Stickelberger Class Relations and Application to Ideal-SVP, On the ideal shortest vector problem over random rational primes, COMPUTING NORMAL INTEGRAL BASES OF ABELIAN NUMBER FIELDS, Fast reduction of algebraic lattices over cyclotomic fields, Random self-reducibility of ideal-SVP via Arakelov random walks
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Bounds for resultants of univariate and bivariate polynomials
- On a problem of Oppenheim concerning Factorisatio Numerorum
- Exact solution of linear equations using p-adic expansions
- On ideals free of large prime factors
- Subexponential time relations in the class group of large degree number fields
- Practical, Predictable Lattice Basis Reduction
- Revisiting the Gentry-Szydlo Algorithm
- Class numbers of totally real fields and applications to the Weber class number problem
- Subexponential class group and unit group computation in large degree number fields
- New techniques for computing the ideal class group and a system of fundamental units in number fields
- A linear space algorithm for computing the hermite normal form
- Explicit Bounds for Primality Testing and Related Problems
- A Rigorous Subexponential Algorithm For Computation of Class Groups
- SWIFFT: A Modest Proposal for FFT Hashing
- Fully Homomorphic Encryption with Relatively Small Key and Ciphertext Sizes
- Efficient Public Key Encryption Based on Ideal Lattices
- A Probabilistic Factorization Algorithm with Quadratic Forms of Negative Discriminant
- New directions in nearest neighbor searching with applications to lattice sieving
- Efficient quantum algorithms for computing class groups and solving the principal ideal problem in arbitrary degree number fields
- Candidate Multilinear Maps from Ideal Lattices
- A Toolkit for Ring-LWE Cryptography
- Fully homomorphic encryption using ideal lattices
- On Ideal Lattices and Learning with Errors over Rings
- An 𝐿(1/3) algorithm for ideal class group and regulator computation in certain number fields
- GGHLite: More Efficient Multilinear Maps from Ideal Lattices
- Recovering Short Generators of Principal Ideals in Cyclotomic Rings
- The Number Field Sieve in the Medium Prime Case
