An Efficient Elliptic Curve Cryptography protocol Based on Matrices
Fatima Amounas, El Hassan El Kinani · 2012
In the last decade the Elliptic Curve Cryptography (ECC) was gained a lot of attention in the literature due to their performance. In fact, the principal attraction of ECC compared to RSA (Rivest-Shamir-Adleman) is that it offers equal security for a smaller bit size, thereby reducing processing overhead. In this paper, we present a novel mapping of text message into multiple points on Elliptic Curve by using addition table. Then, we describe a new method for encryption and decryption based on matrices. Further, this paper also attemps to utilize the properties of invertible matrices in encryption and decryption process with more flexible and efficient. The proposed method enhances the security of ECC with multi fold encryption.