A Fault Attack for Scalar Multiplication in Elliptic Curve Digital Signature Algorithm

Abstract

The dominant operation in cryptographic scheme of elliptic curve is the multiplication using point on an elliptic curve by an integer. This paper specifically discusses the competent algorithms for scalar multiplication a very tedious process in Elliptic Curve Cryptography that are relevant for systems using constrained resources like smart cards. The taxonomy of the work in the open literature for these devices is not only from security perspectives, but likewise some implementation attack, such as fault attacks, must be considered. We survey different implementation approaches and algorithms with the purpose of providing a valuable reference of implementing scalar multiplication in order to retrieve information with a way to determine secret signing key. In addition, this paper provides a review of injecting different fault attacks in a system constrained environment with Elliptic Curve Cryptography. Finally, some arguments about future scope that should be undertaken are provided.