Low Complexity Digit Serial Multiplier for Finite Field using Redundant Basis
Jyothi Leonore Dake, Sudheer Kumar Terlapu · Indian Journal of Science and Technology · 2016
Cryptography has been increasingly used due to its rapid trends. In recent days, it has been used mostly in communication and in financial transactions through automated machines or internet. The applications of cryptography and coding theory require finite field operations and are realized based on the finite field computations. In this paper efficient digit-serial multiplier over finite field is implemented and is obtained by using Redundant Basis (RB), intend to present highthroughput multiplier. Area and power are the two factors which obtain less when compared to the previous multipliers. The digit-serial multiplier for 32-bit is implemented using Verilog HDL and synthesized to know its better performance in terms of area and power compared to previous multipliers.Keywords: Cryptography, Digit-Serial, Finite FIELD, Redundant Basis