2023
DOI: 10.3934/amc.2021055
|View full text |Cite
|
Sign up to set email alerts
|

A proof of the conjectured run time of the Hafner-McCurley class group algorithm

Abstract: <p style='text-indent:20px;'>We present a proof under a generalization of the Riemann Hypothesis that the class group algorithm of Hafner and McCurley runs in expected time <inline-formula><tex-math id="M1">\begin{document}$ e^{\left(3/\sqrt{8}+o(1)\right)\sqrt{\log d\log\log d}} $\end{document}</tex-math></inline-formula> where <inline-formula><tex-math id="M2">\begin{document}$ -d $\end{document}</tex-math></inline-formula> is the discriminant of the inpu… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

0
0
0

Year Published

2024
2024
2024
2024

Publication Types

Select...
1

Relationship

1
0

Authors

Journals

citations
Cited by 1 publication
(2 citation statements)
references
References 32 publications
(86 reference statements)
0
0
0
Order By: Relevance
“…where ∆ K is the discriminant of the field assuming the Generalized Riemann hypothesis (GRH) [7]. Buchmann [17] generalized this result to the case of infinite classes of number fields with fixed degree.…”
mentioning
confidence: 99%
See 1 more Smart Citation
“…where ∆ K is the discriminant of the field assuming the Generalized Riemann hypothesis (GRH) [7]. Buchmann [17] generalized this result to the case of infinite classes of number fields with fixed degree.…”
mentioning
confidence: 99%
“…A second layer of parallelization was employed by computing individual roots on independent cores. After picking a principal ideal a = (α) of O K , the main steps of our computations are the following: (1) Finding the initial norm relation to determine the subfields K i , (2) Finding the norm relation in each of the subfields K i , (3) computing the subfields K i,j , (4) Computing the unit groups of the K i,j , (5) Computing the relative norms N K/Ki,j (a), (6) Computing generators of the ideals N K/Ki,j (a), (7) Identifying d-powers (without root computation), (8) Compact representation, and (9) Root computation. We also implemented the reduction from the SPIP to the PIP of [20,21] and we were able to retrieve a short generator of our challenge ideals in K (1) and K (2) (which is a solution to γ-SVP for a γ ∈ e Õ( √ n) in the input principal ideals).…”
mentioning
confidence: 99%