Award Date

May 2018

Degree Type

Thesis

Degree Name

Master of Science in Computer Science

Department

Computer Science

First Committee Member

Evangelos Yfantis

Second Committee Member

Hal Berghel

Third Committee Member

Andreas Stefik

Fourth Committee Member

Sarah Harris

Number of Pages

52

Abstract

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.

Disciplines

Computer Sciences

Language

English


Share

COinS