Title page for ETD etd-04252006-161727

Type of Document Master's Thesis
Author McGee, John J.
URN etd-04252006-161727
Title René Schoof's Algorithm for Determining the Order of the Group of Points on an Elliptic Curve over a Finite Field
Degree Master of Science
Department Mathematics
Advisory Committee
Advisor Name Title
Brown, Ezra A. Committee Chair
Parry, Charles J. Committee Member
Williams, Michael Committee Member
  • Elliptic Curve
  • Schoof
  • Cryptography
Date of Defense 2006-04-25
Availability unrestricted
Elliptic curves have a rich mathematical history dating back to Diophantus (c. 250 C.E.), who used a form of these cubic equations to find right triangles of integer area with rational sides. In more recent times the deep mathematics of elliptic curves was used by Andrew Wiles et. al., to construct a proof of Fermat's last theorem, a problem which challenged mathematicians for more than 300 years. In addition, elliptic curves over finite fields find practical application in the areas of cryptography and coding theory. For such problems, knowing the order of the group of points satisfying the elliptic curve equation is important to the security of these applications. In 1985 René Schoof published a paper [5] describing a polynomial time algorithm for solving this problem. In this thesis we explain some of the key mathematical principles that provide the basis for Schoof's method. We also present an implementation of Schoof's algorithm as a collection of Mathematica functions. The operation of each algorithm is illustrated by way of numerical examples.
  Filename       Size       Approximate Download Time (Hours:Minutes:Seconds) 
 28.8 Modem   56K Modem   ISDN (64 Kb)   ISDN (128 Kb)   Higher-speed Access 
  SchoofsAlgorithmThesisMcGee.pdf 1.04 Mb 00:04:47 00:02:28 00:02:09 00:01:04 00:00:05
  ThesisMcGee06June2006.nb 711.70 Kb 00:03:17 00:01:41 00:01:28 00:00:44 00:00:03

Browse All Available ETDs by ( Author | Department )

dla home
etds imagebase journals news ereserve special collections
virgnia tech home contact dla university libraries

If you have questions or technical problems, please Contact DLA.