On the computation of quadratic 2-class groups
The authors present a detailed description of an algorithm evolved from work of Gauss, D. Shanks, and \textit{J. C. Lagarias} [J. Algorithms 1, 142-186 (1980; Zbl 0473.68030)]. The idea is that the 2-class group for a discriminant \(D\) can be computed in cases where the full class group is not feasible, e.g., in random polynomial time, as long as the factors of \(D\) are known. The illustrations involve a \(D\) as a product of 5 primes close to \(10^{100}\). The prime factors immediately give ambiguous binary forms. Forms are successively examined by residue character for identification as a square. Then such a form is represented as (say) \(k^2\) (using ternary techniques), and the desired ``square-root-form is deduced from \((k^2,l,m)= 2(k,l,km)\). This is the detailed and time consuming part.
- A Rigorous Subexponential Algorithm For Computation of Class Groups
- Corrigenda
- Density computations for real quadratic units
- scientific article; zbMATH DE number 435565 (Why is no real title available?)
- scientific article; zbMATH DE number 45834 (Why is no real title available?)
- scientific article; zbMATH DE number 701257 (Why is no real title available?)
- scientific article; zbMATH DE number 784879 (Why is no real title available?)
- On the Computational Complexity of Determining the Solvability or Unsolvability of the Equation X 2 - DY 2 = -1
- The Magma algebra system. I: The user language
- The Number of Real Quadratic Fields Having Units of Negative Norm
- Worst-case complexity bounds for algorithms in the theory of integral quadratic forms
- Computation of Galois groups associated to the 2-class towers of some quadratic fields.
- Congruences relating class numbers of quadratic orders and Zagier's sums
- Transparent SNARKs from DARK compilers
- Breaking the decisional Diffie-Hellman problem for class group actions using genus theory
- On the decisional Diffie-Hellman problem for class group actions on oriented elliptic curves
- Rational isogenies from irrational endomorphisms
- Orientations and the supersingular endomorphism ring problem
- On the parametrization of solutions of quadratic equations
- On efficient computation of the 2-parts of ideal class groups of quadratic fields
- Breaking the decisional Diffie-Hellman problem for class group actions using genus theory: extended version
- Congruences for odd class numbers of quadratic fields with odd discriminant
- scientific article; zbMATH DE number 4130460 (Why is no real title available?)
- scientific article; zbMATH DE number 1004535 (Why is no real title available?)
- scientific article; zbMATH DE number 3863443 (Why is no real title available?)
- A Rigorous Subexponential Algorithm For Computation of Class Groups
- Dirichlet’s proof of the three-square theorem: An algorithmic perspective
- scientific article; zbMATH DE number 799758 (Why is no real title available?)
- Genus character L‐functions of quadratic orders and class numbers
- Selected applications of LLL in number theory
- scientific article; zbMATH DE number 5192057 (Why is no real title available?)
- Structure of 2-class groups in the \(\mathbb{Z}_2\)-extensions of certain real quadratic fields
- \textsf{Dew}: a transparent constant-sized polynomial commitment scheme
- Hensel lifting algorithms for quadratic forms
- Inner product functional commitments with constant-size public parameters and openings
- Fast multiquadratic S-unit computation and application to the calculation of class groups
- Efficient transparent polynomial commitments for zk-SNARKs
This page was built for publication: On the computation of quadratic 2-class groups
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q679092)
