Master of Science in Computer Science
First Committee Member
Second Committee Member
Third Committee Member
Fourth Committee Member
Number of Pages
The elliptic cryptographic algorithm first presented in a paper by E. F. Dettrey and E. A. Yfantis is examined and explained in this thesis. The algorithm is based on the group operations of a set of points generated from an ellipse of arbitrary radii, and arbitrary center in the case of the generalized version, modulo a large prime. The security of the algorithm depends on the difficulty of solving a discrete logarithm in the groups used by this algorithm. While the elliptic cryptographic algorithm is not the most secure among the discrete logarithm based paradigm of cryptosystems for a given prime, the algorithm can reach relatively high levels of security using a very large prime. It has similar security to RSA, which is still widely used, when the prime in elliptic cryptography is of a similar size to the modulus in RSA. It should be noted that the elliptic cryptographic algorithm is not quantum safe.
University of Nevada, Las Vegas
Dettrey, Elizabeth, "Elliptic Cryptosystem" (2018). UNLV Theses, Dissertations, Professional Papers, and Capstones. 3242.
IN COPYRIGHT. For more information about this rights statement, please visit http://rightsstatements.org/vocab/InC/1.0/