Title: Cryptography with fast point multiplication by using ASCII codes and its implementation

Authors: T.N. Shankar; G. Sahoo; S. Niranjan

Addresses: Department of Computer Science and Engineering, GMR Institute of Technology, Rajam-532127, Srikakulam, AP, India ' Department of Information Technology, Birla Institute of Technology, Mesra-835215, Ranchi, Jharkhand, India ' Department of Computer Science and Engineering, Prabhu Dayal Memorial College of Engineering, Bahadurgarh-124507, Jhajjar, Haryana, India

Abstract: This paper describes the point multiplication through addition-subtraction method and its implementation through MATLAB to speed up the operations in elliptic curve cryptography (ECC) with ASCII codes under limited hardware resources. To further decrease the computation time, we employed the non-adjacent form of a binary sequence to decrease the total number of additions in ECC encryption/decryption. This paper implements ASCII code table for convenient manipulation of characters, and addition-subtraction method for point multiplication with less time and space complexity with its implementation in MATLAB. We can fully use the idle time of hardware resources by relaxing the data dependency on those arithmetic operations performed to accomplish the point multiplication. As a result, hardware utilisation increases. ECC is the most applicable and suitable algorithm for mobile devices due to its compact shape and size.

Keywords: elliptic curves; non-adjacent form; ASCII codes; elliptic curve cryptography; fast point multiplication; encryption; decryption; mobile devices; security.

DOI: 10.1504/IJCNDS.2013.053061

International Journal of Communication Networks and Distributed Systems, 2013 Vol.10 No.3, pp.258 - 279

Received: 03 Sep 2011
Accepted: 16 Jan 2012
Published online: 30 Jul 2013 *

Full-text access for editors Full-text access for subscribers Purchase this article Comment on this article