Back to search

University of South Florida

Improvements in Computational Techniques For Determining Ideal Class Groups and Class Numbers

Abstract

dc:description

The ideal class group is a fundamental concept in algebraic number theory, providing insights into the structure and factorization properties of the ring of integers of a number field. It measures the extent to which unique factorization fails in the ring of integers. Efficiently computing the ideal class group is crucial for exploring unproved heuristics in number theory and solving Diophantine equations. Additionally, the computation of the ideal class group has several cryptographic applications, such as schemes based on the Discrete Logarithm Problem (DLP), the computation of isogenies, and groups of unknown order. Despite its importance, much about the ideal class group and its order, known as the class number, remains enigmatic due to the computational challenges involved. In the first part of this thesis, we present a modified version of the Hafner and McCurley class group algorithm~\cite{Hafner1989ARS} for the Ideal Class Group computation of imaginary quadratic fields. Our modified version improves the asymptotic run time and achieves the conjectured run time of the Hafner and McCurley class group algorithm~\cite[Sec. 5]{Hafner1989ARS}. This improvement relies on recent results regarding the properties of the Cayley graph of the ideal class group~\cite{jmv}. In the second part of this thesis, we introduce a new approach for unconditional class number computation of the maximal real subfield of cyclotomic fields. Our method for computing class numbers in the maximal real subfield of cyclotomic fields closely adheres to the methodology outlined by John C. Miller~\cite{MillerThesis,MillerComposite,MillerPrime}. The cornerstone of our novel approach for unconditional class number computation of the maximal real subfield of cyclotomic fields lies in the \textit{norm relations} techniques introduced by Biasse, Fieker, Hofmann, and Page~\cite{Biasse2020NormRA}. In particular, we employ norm relation-based Principal Ideal Problem (PIP) technique as outlined in~\cite{BiasseWilliam}.

Degree

thesis:*
Name thesis:degree_name
Doctor of Philosophy (Ph.D.)
Level thesis:degree_level
Dissertation
Discipline thesis:degree_discipline
Mathematics and Statistics
Grantor
University of South Florida
Year dc:date
2024

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Erukulangara, Muhammed Rashad
Contributors dc:contributor
  • Jean-Francois Biasse, Ph.D.
  • Dmytro Savchuk, Ph.D.
  • Natasha Jonoska, Ph.D.
  • Giacomo Micheli, Ph.D.
  • Ruthmae Sears, Ph.D.

Subjects

dc:subject × 6

Identifiers

dc:identifier.*
Repository record dc:identifier
https://digitalcommons.usf.edu/etd/10505

Chain of custody

source
Harvested from
University of South Florida
Base URL
digitalcommons.usf.edu/do/oai/
Last updated
2026-11-19
Source record
OAI-PMH GetRecord
citation

Erukulangara, Muhammed Rashad. Improvements in Computational Techniques For Determining Ideal Class Groups and Class Numbers. Dissertation thesis, University of South Florida, 2024. https://digitalcommons.usf.edu/etd/10505