Fast Algorithms for Finding the Characteristic Polynomial of a Rank-2 Drinfeld Module
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.
Collections
Cite this version of the work
Yossef Musleh
(2018).
Fast Algorithms for Finding the Characteristic Polynomial of a Rank-2 Drinfeld Module. UWSpace.
http://hdl.handle.net/10012/13889
Other formats