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

Authors:
T. N. Shankar;G. Sahoo;S. Niranjan
Affiliations:
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
Venue:
International Journal of Communication Networks and Distributed Systems
Year:
2013

Citing 14
Cited 1

Use of elliptic curves in cryptography

Lecture notes in computer sciences; 218 on Advances in cryptology---CRYPTO 85
The State of Elliptic Curve Cryptography

Designs, Codes and Cryptography - Special issue on towards a quarter-century of public key cryptography
Optimal Left-to-Right Binary Signed-Digit Recoding

IEEE Transactions on Computers - Special issue on computer arithmetic
A method for obtaining digital signatures and public-key cryptosystems

Communications of the ACM
Software Implementation of Elliptic Curve Cryptography over Binary Fields

CHES '00 Proceedings of the Second International Workshop on Cryptographic Hardware and Embedded Systems
Fast Algorithms for Common-Multiplicand Multiplication and Exponentiation by Performing Complements

AINA '03 Proceedings of the 17th International Conference on Advanced Information Networking and Applications
Guide to Elliptic Curve Cryptography

Guide to Elliptic Curve Cryptography
Cryptography and Network Security (4th Edition)

Cryptography and Network Security (4th Edition)
Cryptanalysis of an elliptic curve cryptosystem for wireless sensor networks

International Journal of Security and Networks
Reconfigurable Computing Approach for Tate Pairing Cryptosystems over Binary Fields

IEEE Transactions on Computers
Customizable elliptic curve cryptosystems

IEEE Transactions on Very Large Scale Integration (VLSI) Systems
The advantages of elliptic curve cryptography for wireless security

IEEE Wireless Communications
New directions in cryptography

IEEE Transactions on Information Theory
A public key cryptosystem and a signature scheme based on discrete logarithms

IEEE Transactions on Information Theory

Steganographic manipulations with elliptic curve cryptography

International Journal of Electronic Security and Digital Forensics

Quantified Score

Hi-index	0.00

Visualization

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.