Efficient Mapping Scheme for Elliptic Curve Cryptosystem in a Multiprocessing Environment

Abstract

The security of Elliptic Curve Cryptosystem (ECC) hinges on on the hardness of Elliptic Curve Discrete Logic Problem. However, existing mapping schemes are inefficient, make ECC vulnerable to security attacks and cannot be efficiently implemented in a multiprocessing environment. In this paper, an efficient mapping scheme which employ the use of Columnar Transposition technique for bit manipulation before message mapping to point on the elliptic curve was developed. Comparative security, efficiency and performance analysis of the developed mapping scheme with the existing ones were investigated. The outcomes show that the developed mapping scheme is resilient to different attacks that the existing scheme are vulnerable to. ECC schemes that use the developed mapping scheme efficiently use resources in multiprocessing environment, requires lower bandwidth for transmission of encrypted point, without negatively affecting the encryption/decryption time, throughputs and energy consumption, than the ECC schemes with existing mapping schemes.