Reduced precomputed scalar multiplication cost for ECC

Abstract

Elliptic curve cryptography (ECC) is one of the most fascinating areas in cryptography that provides a higher level of security on smaller key sizes. The paper proposes the optimal scalar multiplication cost without pre-computed operations on Radix-16. It is one of the most optimized methods that best suits to low memory devices on the reduced complexity. Further, in relation to the previous proposed work, it is computing 6.25 percent faster on the software performance perspective and 8.33 percent faster on the hardware performance perspective.