Masters Thesis
Algorithm for computing units in multicyclic number fields.
For finite field extensions of Q, we study a special class of subrings called the orders of the field. Dirichlet’s Unit Theorem tells us the unit group of these orders is finitely generated. Certain lattice based cryptosystems rely heavily on the high difficulty of computing a generating set of the unit group. We will present a new algorithm for computing the unit group of multicyclic extensions of Q.
| Thumbnail | Title | Date Uploaded | Visibility | Actions |
|---|---|---|---|---|
|
|
SavageAnthony_Summer2019.pdf | 2019-11-14 | Public | Download |
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.