Skip to Main Content
 

Global Search Box

 
 
 
 

ETD Abstract Container

Abstract Header

The Elliptic Curve Group Over Finite Fields: Applications in Cryptography

Lester, Jeremy W.

Abstract Details

2012, Master of Science in Mathematics, Youngstown State University, Department of Mathematics and Statistics.
It is the intent of this thesis to study the mathematics, and applications behind the elliptic curve group over Fp. Beginning with the definition of the '+' operation,under which the points on the elliptic curves form an abelian group. Then moving to a brief introduction to both public, and private key cryptography. This will lead into an explanation of the discrete logarithm problem along with an implementation using the elliptic curve group over Fp. This thesis will conclude with an exploration Lenstra's factoring algorithm using the elliptic curve group.
Jacek Fabrykowski, Ph.D. (Advisor)
Neil Flowers, Ph.D. (Committee Member)
Thomas Smotzer, Ph.D. (Committee Member)
36 p.

Recommended Citations

Citations

  • Lester, J. W. (2012). The Elliptic Curve Group Over Finite Fields: Applications in Cryptography [Master's thesis, Youngstown State University]. OhioLINK Electronic Theses and Dissertations Center. http://rave.ohiolink.edu/etdc/view?acc_num=ysu1348847698

    APA Style (7th edition)

  • Lester, Jeremy. The Elliptic Curve Group Over Finite Fields: Applications in Cryptography. 2012. Youngstown State University, Master's thesis. OhioLINK Electronic Theses and Dissertations Center, http://rave.ohiolink.edu/etdc/view?acc_num=ysu1348847698.

    MLA Style (8th edition)

  • Lester, Jeremy. "The Elliptic Curve Group Over Finite Fields: Applications in Cryptography." Master's thesis, Youngstown State University, 2012. http://rave.ohiolink.edu/etdc/view?acc_num=ysu1348847698

    Chicago Manual of Style (17th edition)