An algorithm for solving the principal ideal problem with subfields

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

Cites Work

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

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)