Fast Mapping Method based on Matrix Approach For Elliptic Curve Cryptography

Abstract

In this paper, we propose a new mapping method based on the proprieties of matrices and the elliptic curve to generate an algorithm that will guarantee the confidentiality of messages. In fact, the alphanumeric characters are mapped onto the points of the elliptic curve in the proposed method by using non-singular matrix. The details of this algorithm with examples are in order. The mapping technique will increase the strength of the elliptic cryptosystem. The proposed method is efficient in its principale and has great potential to be applied to others situations where the exchange of messages is done confidentially.