Back to search

University of Waterloo

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

Abstract

dc:description.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.

Degree

thesis:*
Grantor dc:publisher
University of Waterloo
Year dc:date.issued
2018

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Musleh, Yossef
Advisor dc:contributor.advisor
  • Schost, Eric

Subjects

dc:subject × 7

Rights

Language dc:language.iso
en

Identifiers

dc:identifier.*
Handle dc:identifier.uri
http://hdl.handle.net/10012/13889

Chain of custody

source
Harvested from
University of Waterloo
Base URL
dspacemainprd01.lib.uwaterloo.ca/server/oai/request
Last updated
2026-11-19
Source record
OAI-PMH GetRecord
citation

Musleh, Yossef. Fast Algorithms for Finding the Characteristic Polynomial of a Rank-2 Drinfeld Module. University of Waterloo, 2018. http://hdl.handle.net/10012/13889