Computing generator in cyclotomic integer rings. A subfield algorithm for the principal ideal problem in L_|_ K|(12) and application to the cryptanalysis of a FHE scheme
From MaRDI portal
Publication:5738871
Recommendations
- Recovering short generators of principal fractional ideals in cyclotomic fields of conductor p^ q^
- Recovering short generators of principal ideals in cyclotomic rings
- On the quantum attacks against schemes relying on the hardness of finding a short generator of an ideal in \(\mathbb{Q}(\zeta_{2^s})\)
- Short Stickelberger class relations and application to Ideal-SVP
- Short principal ideal problem in multicubic fields
Cites work
- A linear space algorithm for computing the hermite normal form
- A Probabilistic Factorization Algorithm with Quadratic Forms of Negative Discriminant
- A Rigorous Subexponential Algorithm For Computation of Class Groups
- A toolkit for ring-LWE cryptography
- An 𝐿(1/3) algorithm for ideal class group and regulator computation in certain number fields
- Bounds for resultants of univariate and bivariate polynomials
- Candidate Multilinear Maps from Ideal Lattices
- Class numbers of totally real fields and applications to the Weber class number problem
- Efficient public key encryption based on ideal lattices (extended abstract)
- Efficient quantum algorithms for computing class groups and solving the principal ideal problem in arbitrary degree number fields
- Exact solution of linear equations using p-adic expansions
- Explicit Bounds for Primality Testing and Related Problems
- Fully homomorphic encryption using ideal lattices
- Fully homomorphic encryption with relatively small key and ciphertext sizes
- GGHLite: more efficient multilinear maps from ideal lattices
- scientific article; zbMATH DE number 435565 (Why is no real title available?)
- scientific article; zbMATH DE number 1186948 (Why is no real title available?)
- scientific article; zbMATH DE number 1024052 (Why is no real title available?)
- scientific article; zbMATH DE number 2086714 (Why is no real title available?)
- scientific article; zbMATH DE number 967875 (Why is no real title available?)
- Improved techniques for computing the ideal class group and a system of fundamental units in number fields
- New directions in nearest neighbor searching with applications to lattice sieving
- On a problem of Oppenheim concerning Factorisatio Numerorum
- On ideal lattices and learning with errors over rings
- On ideals free of large prime factors
- Practical, Predictable Lattice Basis Reduction
- Recovering short generators of principal ideals in cyclotomic rings
- Revisiting the Gentry-Szydlo Algorithm
- Subexponential class group and unit group computation in large degree number fields
- Subexponential time relations in the class group of large degree number fields
- SWIFFT: A Modest Proposal for FFT Hashing
- The Number Field Sieve in the Medium Prime Case
Cited in
(22)- Recovering short generators of principal fractional ideals in cyclotomic fields of conductor p^ q^
- 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
- On the quantum attacks against schemes relying on the hardness of finding a short generator of an ideal in \(\mathbb{Q}(\zeta_{2^s})\)
- On the ideal shortest vector problem over random rational primes
- Fast reduction of algebraic lattices over cyclotomic fields
- Random self-reducibility of ideal-SVP via Arakelov random walks
- Twisted-PHS: using the product formula to solve approx-SVP in ideal lattices
- Computing normal integral bases of abelian number fields
- Algorithmic Number Theory
- Short Stickelberger class relations and application to Ideal-SVP
- Recovering short generators of principal ideals in cyclotomic rings
- 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
- An algorithm for solving the principal ideal problem with subfields
- Efficient computations in central simple algebras using Amitsur cohomology
- Fully homomorphic encryption with chosen-ciphertext security from LWE
- A reduction from Hawk to the principal ideal problem in a quaternion algebra
- Finding dense submodules with algebraic lattice reduction
This page was built for publication: 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
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5738871)
