dc.contributor.author |
Lester, Jeremy |
en_US |
dc.date.accessioned |
2013-10-29T14:59:51Z |
|
dc.date.accessioned |
2019-09-08T02:45:48Z |
|
dc.date.available |
2013-10-29T14:59:51Z |
|
dc.date.available |
2019-09-08T02:45:48Z |
|
dc.date.issued |
2012 |
|
dc.identifier |
820353045 |
en_US |
dc.identifier.other |
b21271422 |
en_US |
dc.identifier.uri |
http://hdl.handle.net/1989/10506 |
|
dc.description |
vi, 30 leaves : ill. ; 29 cm. |
en_US |
dc.description.abstract |
It is the intent of this thesis to study the mathematics, and applications behind the elliptic curve group over F[subscript p]. 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 F[subscript p]. This thesis will conclude with an exploration Lenstra's factoring algorithm using the elliptic curve group. |
en_US |
dc.description.statementofresponsibility |
by Jeremy W. Lester. |
en_US |
dc.language.iso |
en_US |
en_US |
dc.relation.ispartofseries |
Master's Theses no. 1350 |
en_US |
dc.subject.lcsh |
Curves, Elliptic. |
en_US |
dc.subject.lcsh |
Finite fields (Algebra)--Cryptography. |
en_US |
dc.title |
Elliptic Curve Group Over Finite Fields: Applications in Cryptography |
en_US |
dc.type |
Thesis |
en_US |