Performance analysis of hardware design and implementation of elliptic curve Montgomery scalar multiplication algorithm using FPGA

Abstract

In this electronic world cryptography has been widely used as a means of information security Lot of issue arises in security environment and this can be overcome by cryptographic algorithms Many Cryptographic algorithms were introduced to improve the security level in different ways Among these algorithms Elliptic Curve Cryptography serves as the perfect cryptographic algorithm because of its shortest key size and security compared to other standard public key algorithms The applications of Elliptic Curve to the field of cryptography have been relatively recent However to match the ever increasing requirement for security in today s applications hardware acceleration of the cryptographic algorithms becomes necessary As a further challenge the hardware designs must set be robust against side channel attacks At the same time software implementation of the cryptographic algorithms is also necessary to optimize the execution time Elliptic Curve Cryptographic algorithm was proved to be the best newlinefor Montgomery Scalar Multiplication Elliptic Curve Montgomery Scalar Multiplication consist of two operations namely addition algorithm and doubling algorithm These algorithms s architecture and power consumption were compared with other design architectures Bit serial algorithm is one of the Montgomery Scalar Multiplication newlinealgorithms which accelerates the performance of Elliptic Curve Montgomery scalar multiplication Here Bit serial and modified Bit serial algorithms were designed and compared between each other newline newline