Masters Thesis Defense “Software Implementations and Applications of Elliptic Curve Cryptography” By Kirill Kultinov
Wednesday, May 1, 2019, 11 am to 1 pm
Campus:
Dayton
499 Joshi Research Center
Audience:
Current Students
Faculty
Staff
Committee: Drs. Meilin Liu, Advisor, Junjie Zhang, and Keke Chen
ABSTRACT:
Elliptic Curve Cryptography (ECC) is a public-key cryptography system. Elliptic Curve Cryptography (ECC) can achieve the same level of security as the public-key cryptography system, RSA, with a much smaller key size. It is a promising public key cryptography system with regard to time efficiency and resource utilization.
This thesis focuses on the software implementations of ECC over finite field GF(p) with two distinct implementations of the Big Integer classes using character arrays, and bit sets in C++ programming language. Our implementation works on the ECC curves of the form y2 = x3 + ax + b (mod p). The point addition operation and the scalar multiplication are implemented on a real SEC (Standards for Efficient Cryptography) ECC curve over a prime field with two different implementations. The Elliptic Curve Diffie-Hellman key exchange and the ElGamal encryption/decryption system on a real SEC ECC curve with two different implementations of the big integer classes are tested, and validated. The performances of the two different implementations are compared and analyzed.
Log in to submit a correction for this event (subject to moderation).