Fast Hartley Transform based Elliptic Curve Cryptography for resource constrained devices
Sanket Nakhate, P. Arun Raj Kumar · 2020
The growing security and vulnerability threats in apps, software, etc., affect smart gadgets. But, it is computationally not feasible to run the advanced security algorithms in resource-constrained devices (smart gadgets). For example, the encryption and the decryption time of security algorithms in smart gadgets are higher than the workstation/servers. Therefore, there is a need to optimize the time complexity of efficient security algorithms without compromising its security. Elliptic Curve Cryptography (ECC) is computationally less complex among the existing security algorithms due to its less key size. In this paper, to reduce the complexity involved in the scalar multiplication operation of ECC, Fast Hartley transform (FHT) based Hybrid ECC is proposed. From the experimental results, it is evident that using FHT in ECC has an improvement (4% to 8%) over FFT based ECC in terms of encryption and decryption time.