An algorithm for solving the principal ideal problem with subfields

DOI10.3934/AMC.2023021MaRDI QIDQ6605891zbMATH OpenFDO

Authors Jean-François Biasse, Claus Fieker, Tommy Hofmann, William Youmans

Publication date 16 September 2024

Published in Advances in Mathematics of Communications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.3934/AMC.2023021

zbMATH Keywords

approximate short vectorsBrauer relationsideal class groupsprincipal ideal problem

Mathematics Subject Classification ID

Algebraic numbers; rings of algebraic integers (11R04) Cyclotomic extensions (11R18) Units and factorization (11R27) Class numbers, class groups, discriminants (11R29) Galois theory (11R32) Number-theoretic algorithms; complexity (11Y16) Algebraic number theory computations (11Y40) Group rings of finite groups and their modules (group-theoretic aspects) (20C05)

Cites work

• A proof of the conjectured run time of the Hafner-McCurley class group algorithm
• A Rigorous Subexponential Algorithm For Computation of Class Groups
• Approximate short vectors in ideal lattices of \(\mathbb{Q}(\zeta_{p^e})\) with precomputation of \({\mathrm {Cl}}(\mathcal{O}_K)\)
• Candidate Multilinear Maps from Ideal Lattices
• Carmichael's lambda function
• Class field theory
• Cohomology of number fields
• 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 quantum algorithms for computing class groups and solving the principal ideal problem in arbitrary degree number fields
• Factoring polynomials with rational coefficients
• Fast multiquadratic S-unit computation and application to the calculation of class groups
• Fully homomorphic encryption with relatively small key and ciphertext sizes
• scientific article; zbMATH DE number 1643932 (Why is no real title available?)
• scientific article; zbMATH DE number 3174540 (Why is no real title available?)
• scientific article; zbMATH DE number 4200333 (Why is no real title available?)
• scientific article; zbMATH DE number 3613293 (Why is no real title available?)
• scientific article; zbMATH DE number 1313469 (Why is no real title available?)
• scientific article; zbMATH DE number 194764 (Why is no real title available?)
• scientific article; zbMATH DE number 2086714 (Why is no real title available?)
• Improved techniques for computing the ideal class group and a system of fundamental units in number fields
• Julia: a fresh approach to numerical computing
• Lattice basis reduction: Improved practical algorithms and solving subset sum problems
• Nemo/Hecke. Computer algebra and number theory packages for the Julia programming language
• Norm relations and computational problems in number fields
• On the computation of the HNF of a module over the ring of integers of a number field
• On the construction of class fields
• Recovering short generators of principal ideals in cyclotomic rings
• Short generators without quantum computers: the case of multiquadratics
• Short principal ideal problem in multicubic fields
• Short Stickelberger class relations and application to Ideal-SVP
• Subexponential algorithms for class group and unit computations
• Subexponential class group and unit group computation in large degree number fields
• Subexponential time relations in the class group of large degree number fields

This page was built for publication: An algorithm for solving the principal ideal problem with subfields

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