Indian Journal of Science and Technology

Abstract

Additional cost is not required to squaring operation; the finite field algebraic calculation using normal basis field arithmetic has advantages. Using this property, more simplified schematic of multiplier which needs a half of latency than the other existing multipliers is proposed and designed. The performance of the proposed multipliers is presented. The various types of multipliers are suggested to be selected according to the parameters such as the circuit size and the waiting time. The result shows the proposed structure has better performance with simpler complexity and shorter waiting time compared with the existing multipliers.
Keywords: Cryptography, Fast Multiplier, Finite Field, Non-Binary Field Arithmetic, Normal Basis