On complexity of normal basis multiplier using modified Booth's algorithm

摘要

This paper purposed a Booth's multiplier for normal basis multiplier. The architecture is simple and highly regular architecture for finite fields using a new modified Booth's algorithm. The proposed multiplier for finite fields requires a significantly lower number of bit level operations and, hence, can reduce the space complexity of cryptographic systems. It is shown that proposed multiplier for type-2 normal basis of GF(2~m) saves approximately 10% space complexity as compared to related parallel multipliers. Moreover, the proposed architecture is regularity and modularity; they are well suited to VLSI implementations.