Secure and Efficient ECC
Gautam Kumar, Hemraj Saini · 2016
The use of Elliptic curve cryptography (ECC) is widely playing a crucial role and is reporting with a great hope of advancing security and performance related benefits for the high end applications. The scalar multiplication algorithms used in ECC are having the scope for gaining the computational efficiency. A smaller key length is the most appropriate to receive the same level of security strength using this technique. Finding the more efficient technique for accelerating the scalar multiplication through the research gap is one of our objectives. The manuscript presentation claims the proposed Radix-16 scalar multiplication without pre-computed operations, which is theoretically computing 6.25 percent faster than the recently proposed Radix-8 scalar conversion technique on software performance basis and 8.33 on hardware basis. This is showing the more appropriateness for reduced instruction set computing with resistance to the simple side channel attacks and safe-error fault attacks. The further extension of proposed work is to find the future applied scope for low memory devices.