An Innovative Way to Increase the Speed and Efficiency of Reverse Mapping of Elliptic Curve Points

Document Type

Conference Article

Publication Title

2024 International Conference on Emerging Smart Computing and Informatics Esci 2024

Abstract

Elliptic curve cryptography is a widely recognized method of using a public key cryptosystem for encrypting and decrypting data. The message must be transformed to points on an Elliptic Curve using a mapping algorithm in order to send the message. This process of mapping the message to the point on the elliptic curve is done by applying a well-known mapping algorithm. Elliptic curve cryptography is widely acknowledged to have simpler mathematical operations compared to other cryptographic methods. However, researchers in the field of cryptography have faced challenges in mapping plain messages onto points on an elliptic curve and reversing the process at the receiver's end for decryption. Recent advancements have led to the development of mapping techniques that are resistant to frequency analysis. In this paper, we have discussed a well-known mapping scheme that has been used to map plain text messages to points on elliptic curves. However, the time taken to map a message and encrypt the points takes a substantial amount of time. This latency can be reduced if we parallelize the mapping process. In this paper, we have parallelized the reverse mapping phase of the scheme at the receiver's end to reduce the total communication time. Performance results after parallelization have been recorded and provided in the later section of the paper in tabular and graphical form.

DOI

10.1109/ESCI59607.2024.10497330

Publication Date

1-1-2024

Link to Full Text

Share

COinS