Approximate short vectors in ideal lattices of Q(_p^e) with precomputation of Cl(O_K)

DOI10.1007/978-3-319-72565-9_19MaRDI QIDQ1746982zbMATH OpenOpenAlexFDO

Authors Jean-François Biasse

Publication date 26 April 2018

Full work available at URL https://doi.org/10.1007/978-3-319-72565-9_19

zbMATH Keywords

ideal class groupquantum algorithmsideal latticeslattice reductionpost quantum cryptographyideal-SVPprincipal ideal problem

Mathematics Subject Classification ID

Cryptography (94A60) Quantum computation (81P68) Quantum cryptography (quantum-theoretic aspects) (81P94)

Recommendations

• Approx-SVP in ideal lattices with pre-processing
• On the shortness of vectors to be found by the ideal-SVP quantum algorithm
• Mildly Short Vectors in Cyclotomic Ideal Lattices in Quantum Polynomial Time
• Efficient quantum algorithms for computing class groups and solving the principal ideal problem in arbitrary degree number fields
• Recovering short generators of principal ideals in cyclotomic rings

Cites work

• scientific article; zbMATH DE number 435565 (Why is no real title available?)
• scientific article; zbMATH DE number 4200333 (Why is no real title available?)
• scientific article; zbMATH DE number 3959521 (Why is no real title available?)
• scientific article; zbMATH DE number 3760283 (Why is no real title available?)
• scientific article; zbMATH DE number 2154278 (Why is no real title available?)
• scientific article; zbMATH DE number 2086714 (Why is no real title available?)
• scientific article; zbMATH DE number 819075 (Why is no real title available?)
• A Rigorous Subexponential Algorithm For Computation of Class Groups
• A hierarchy of polynomial time lattice basis reduction algorithms
• A low-resource quantum factoring algorithm
• A quantum algorithm for computing the unit group of an arbitrary degree number field
• A sieve algorithm for the shortest lattice vector problem
• An 𝐿(1/3) algorithm for ideal class group and regulator computation in certain number fields
• Candidate Multilinear Maps from Ideal Lattices
• 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
• Cryptanalysis of GGH map
• Dependency of units in number fields
• Efficient quantum algorithms for computing class groups and solving the principal ideal problem in arbitrary degree number fields
• Explicit Bounds for Primality Testing and Related Problems
• Factoring polynomials with rational coefficients
• On ideals free of large prime factors
• On the quantum attacks against schemes relying on the hardness of finding a short generator of an ideal in \(\mathbb{Q}(\zeta_{2^s})\)
• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
• 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

Cited in

(3)

• An algorithm for solving the principal ideal problem with subfields
• On the shortness of vectors to be found by the ideal-SVP quantum algorithm
• Mildly Short Vectors in Cyclotomic Ideal Lattices in Quantum Polynomial Time

This page was built for publication: Approximate short vectors in ideal lattices of \(\mathbb{Q}(\zeta_{p^e})\) with precomputation of \({\mathrm {Cl}}(\mathcal{O}_K)\)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1746982)