UWSpace is currently experiencing technical difficulties resulting from its recent migration to a new version of its software. These technical issues are not affecting the submission and browse features of the site. UWaterloo community members may continue submitting items to UWSpace. We apologize for the inconvenience, and are actively working to resolve these technical issues.
 

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

Thumbnail Image

Files

Musleh_Yossef.pdf (375.78 KB)

Date

2018-09-21

Authors

Musleh, Yossef

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 Keywords

Citation

URI

http://hdl.handle.net/10012/13889

Collections

Theses
Computer Science