The Libraries will be performing routine maintenance on UWSpace on July 15th-16th, 2025. UWSpace will be available, though users may experience service lags during this time. We recommend all users avoid submitting new items to UWSpace until maintenance is completed.
 

Fast Algorithms for Finding the Characteristic Polynomial of a Rank-2 Drinfeld Module

Loading...
Thumbnail Image

Date

2018-09-21

Authors

Musleh, Yossef

Advisor

Schost, Eric

Journal Title

Journal ISSN

Volume Title

Publisher

University of Waterloo

Abstract

This thesis introduces a new Monte Carlo randomized algorithm for computing the characteristic polynomial of a rank-2 Drinfeld module. We also introduce a deterministic algorithm that uses some ideas seen in Schoof's algorithm for counting points on elliptic curves over finite fields. Both approaches are a significant improvement over the current literature.

Description

Keywords

Drinfeld, Module, Elliptic, Curve, Cryptography, Algorithm, Randomized

LC Subject Headings

Citation