Show simple item record

dc.contributor.advisorZhang, Qiao
dc.contributor.authorThompson, Dave
dc.date2016-05-19
dc.date.accessioned2016-09-14T15:32:25Z
dc.date.available2016-09-14T15:32:25Z
dc.date.issued2016
dc.identifier.urihttps://repository.tcu.edu/handle/116099117/11345
dc.description.abstractWhile it is relatively well known that larger field orders in elliptic curves allow for increased security in a cryptographic setting, it was the goal of our research to discover if patterns would emerge when observing average point orders within the first five fields. Using SageMath, we computed the average point orders across every elliptic curve with constraints subject to a given finite field that passed through each point. From this, we also calculated an average of averages that we used to represent the average point order for the entire field. Our findings point towards the fact that if patterns do exist, they are complex and ultimately require more data sets than those which have been analyzed in this report. While our data suggests an almost linear relationship between the increase in field size with the increase in average point order, in truth this relationship may deviate significantly from one that is linear after larger data sets are taken into account.
dc.subjectCryptography
dc.subjectFinite Field
dc.subjectGroup
dc.subjectElliptic Curve
dc.subjectQuantum
dc.titleElliptic Curve Cryptography
etd.degree.departmentMathematics
local.collegeCollege of Science and Engineering
local.collegeJohn V. Roach Honors College
local.departmentMathematics


Files in this item

Thumbnail
This item appears in the following Collection(s)

Show simple item record