An Efficient Multimode Multiplier Supporting AES and Fundamental Operations of Public-Key Cryptosystems

Abstract

<para xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <?Pub Dtl=""?>This paper presents a highly efficient multimode multiplier supporting prime field, namely, polynomial field, and matrix–vector multiplications based on an asymmetric word-based Montgomery multiplication (MM) algorithm. The proposed multimode 128 <formula formulatype="inline"> <tex Notation="TeX">$\times$</tex></formula> 32 b multiplier provides throughput rates of 441 and 511 Mb/s for 256-b operands over <formula formulatype="inline"> <tex Notation="TeX">$GF(P)$</tex></formula> and <formula formulatype="inline"> <tex Notation="TeX">$GF(2^n)$</tex></formula> at a clock rate of 100 MHz, respectively. With 21 930 additional gates for Advanced Encryption Standard (AES), the multiplier is extended to provide 1.28-, 1.06-, and 0.91-Gb/s throughput rates for 128-, 192-, and 256-b keys, respectively. The comparison result shows that the proposed integration architecture outperforms others in terms of performance and efficiency for both AES and MM that is essential in most public-key cryptosystems. </para>