Improved Modulo (2(superscript n) + 1) Multiplier for IDEA

陳依蓉(Yi-Jung Chen) ； 杜迪榕(Dyi-Rong Duh) ； 韓永祥(Yunghsiang Sam Han)

《Journal of Information Science and Engineering》 23卷3期 (2007/05) Pp. 907-919

https://doi.org/10.6688/JISE.2007.23.3.15

並列摘要

International Data Encryption Algorithm (IDEA) is one of the most popular cryptography algorithms in date since the characteristic of IDEA is suitable for hardware implementation. This study presents an efficient hardware structure for the modulo (2(superscript n) + 1) multiplier, which is the most time and space consuming operation in IDEA. The proposed modulo multiplier saves more time and area cost than previous designs. With 16-bit input length, the proposed structure is 9.1% faster than that proposed by Zimmermann in 1999, and reduces the area about 35.22%. The proposed design enables IDEA to be implemented on hardware with high performance and low cost. Simulation results obtained from CPLD system developed by Altera indicate that the new design has 66Mb/sec encryption/decryption rate under 8.25MHz system clock rate with four pipeline stages for each round.

並列關鍵字

modulo 2(superscript n) + 1 multiplier ； logic design ； IDEA ； security ； cryptography