Fast Algorithms for Finding the Characteristic Polynomial of a Rank-2 Drinfeld Module
| dc.contributor.advisor | Schost, Eric | |
| dc.contributor.author | Musleh, Yossef | |
| dc.date.accessioned | 2018-09-21T16:33:53Z | |
| dc.date.available | 2018-09-21T16:33:53Z | |
| dc.date.issued | 2018-09-21 | |
| dc.date.submitted | 2018-09-19 | |
| 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. | en |
| dc.identifier.uri | http://hdl.handle.net/10012/13889 | |
| dc.language.iso | en | en |
| dc.pending | false | |
| dc.publisher | University of Waterloo | en |
| dc.subject | Drinfeld | en |
| dc.subject | Module | en |
| dc.subject | Elliptic | en |
| dc.subject | Curve | en |
| dc.subject | Cryptography | en |
| dc.subject | Algorithm | en |
| dc.subject | Randomized | en |
| dc.title | Fast Algorithms for Finding the Characteristic Polynomial of a Rank-2 Drinfeld Module | en |
| dc.type | Master Thesis | en |
| uws-etd.degree | Master of Mathematics | en |
| uws-etd.degree.department | David R. Cheriton School of Computer Science | en |
| uws-etd.degree.discipline | Computer Science | en |
| uws-etd.degree.grantor | University of Waterloo | en |
| uws.contributor.advisor | Schost, Eric | |
| uws.contributor.affiliation1 | Faculty of Mathematics | en |
| uws.peerReviewStatus | Unreviewed | en |
| uws.published.city | Waterloo | en |
| uws.published.country | Canada | en |
| uws.published.province | Ontario | en |
| uws.scholarLevel | Graduate | en |
| uws.typeOfResource | Text | en |