To search, Click
below search items.


All
Published Papers Search Service

Title

Elliptic Curve Cryptography Over Gaussian Integers

Author

Elsayed Mohamed, Hassan Elkamchouchi

Citation 
Vol. 9 No. 1 pp. 413416

Abstract

A new approach is used to implement elliptic curve cryptography (ECC) over prime finite fields. The new approach uses Gaussian integers instead of rational integers. It generates a much larger number of points under the same curve equation and the same prime p. The elliptic curve arithmetic is basically the same but works on complex numbers. The security of the proposed method is far higher. When compared to the original prime field, the new method requires double the space to store cryptographic keys represented by points but the security level, in terms of the group order, is roughly squared.

Keywords

Elliptic Curve Cryptography, Gaussian Integers

URL

http://paper.ijcsns.org/07_book/200901/20090158.pdf

