A novel Elliptic Curve Cryptography scheme using random sequence

Abstract

This paper proposes a new Elliptic Curve Cryptography (ECC) scheme and a data mapping technique on elliptic curve over a finite field using maximum length random sequence generation. While its implementation, this paper also proposes a new algorithm of scalar multiplication for ECC. The proposed scheme is tested on various bits length of prime field and the experimental results show very high strength against cryptanalytic attack like random walk and better performance in terms of computation time comparing with standard approaches.