论文信息 - A MATLAB implementation of elliptic curve cryptography

A MATLAB implementation of elliptic curve cryptography

The ultimate purpose of this project has been the implementation in MATLAB of an Elliptic Curve Cryptography (ECC) system, primarily the Elliptic Curve Diffie-Hellman (ECDH) key exchange. We first introduce the fundamentals of Elliptic Curves, over both the real numbers and the integers modulo p where p is prime. Then the theoretical underpinnings of the ECDH system are covered, including a brief look at how this system is broken. Next we develop the individual elements that will be needed in the implementation of ECDH, such as functions for calculating modular square roots and the addition of points on an EO. We then bring these elements together to create a working ECDH program, and discuss the limitations of the MATLAB environment in which it was created. Finally we look at the real world application of ECC and its future in the realm of cryptography.

Hamish Silverwood | H. Silverwood

[1] Piergiorgio Odifreddi. The Mathematical Century: The 30 Greatest Problems of the Last 100 Years , 2004 .

[2] Ezra Brown. Square Roots from 1; 24, 51, 10 to Dan Shanks , 1999 .

[3] Johannes A. Buchmann,et al. Introduction to Cryptography , 2001 .

[4] Alfred Menezes,et al. Guide to Elliptic Curve Cryptography , 2004, Springer Professional Computing.

[5] Alfred Menezes,et al. Elliptic Curves and Cryptography , 1999 .

[6] Douglas R. Stinson,et al. Cryptography: Theory and Practice , 1995 .

[7] Vivek Kapoor,et al. Elliptic curve cryptography , 2008, UBIQ.

[8] Alfred Menezes,et al. Handbook of Applied Cryptography , 2018 .

[9] Alfred Menezes,et al. Elliptic Curve Discrete Logarithm Problem , 2005, Encyclopedia of Cryptography and Security.

[10] Sebastian Wedeniwski. Primality Tests on Commutator Curves , 2001 .