Cryptography with fast point multiplication by using ASCII codes and its implementation. (1st January 2013)

• Record Type: Journal Article
• Authors: Shankar, T.N.; Sahoo, G.; Niranjan, S.
• Is Part Of: International journal of communication networks and distributed systems. Volume 10:Number 3(2013)
• Page Start: 258
• Page End: 279
• Publication Date: 2013-01-01
• Subjects: elliptic curves -- ECs -- public -- private -- non-adjacent form -- NAF -- American Standard Code for Information Interchange -- ASCII -- cryptography -- fast point multiplication; Computer networks -- Periodicals; Telecommunication systems -- Periodicals; Electronic data processing -- Distributed processing -- Periodicals; 004.6
• Languages: English
• ISSNs: 1754-3916

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.