Efficient modulo 2n+1 multiplication for the idea block cipher
Authors: 
Kiamal Pekmestzi, Constantinos Efstathiou, Nikos Moschopoulos, Kostas TsoumanisAuthors Info & Claims
Kiamal Pekmestzi, Constantinos Efstathiou, Nikos Moschopoulos, Kostas TsoumanisAuthors Info & ClaimsPages 263 - 268
Abstract
International Data Encryption Algorithm (IDEA) is a popular and secure cryptography algorithm, suitable for hardware implementation. IDEA comprises of modulo 216 additions, bitwise exclusive-OR operations and modulo 216+1 multiplications of 16-bit words. Among them, modulo 216+1 multiplication is the most time, space and power consuming operation. In this work, we propose an efficient modulo 2n+1 modified Booth multiplication algorithm which is adapted to operands used in the IDEA. The IDEA multiplier based on the proposed modulo 2n+1 multiplication algorithm yields area and power advantages of up to 12% and 14% respectively, compared to the already proposed modulo 2n+1 multiplier designs. The implementation of a single round of the IDEA block cipher based on the proposed multiplier verifies the area and power advantages over the implementations based on existing modulo 2n+1 multipliers.
References
[1]
X. Lai, "On the design and security of block ciphers", ETH Series in Information Processing, Hartung-Gorre Verlang Konstantz, 1992.
[2]
A. V. Curiger, H. Bonnenberg, and H. Kaeslin, "Regular VLSI architecture for multiplication modulo (2n+1)", IEEE Journal of Solid-State Circuits, vol. 26, no. 7, pp. 990--994, July 1991.
[3]
M. Bahrami and B. Sadeghiyan, "Efficient modulo 2n+1 multiplication schemes for IDEA", in Proc. of IEEE International Symposiums on Circuits and Systems (ISCAS), pp. 653--656, 2000.
[4]
C. Efstathiou, I. Voyiatzis, N. Sklavos, "On the modulo 2n+1 multiplication for diminished-1 operands", in Proc. of the 2nd IEEE Int. Conference on Signals Circuits and Systems (SCS), 2008.
[5]
J. W. Chen, R. H. Yao, "Efficient modulo 2n+1 multipliers for diminished-1 representation", IET Circuits, Devices, Systems, vol. 4, no. 4, pp. 291--300, July 2010.
[6]
S. Mukherjee, B. Sahoo, "A novel modulo (2n+1) multiplication approach for IDEA cipher", International Journal of Programmable Devices, Circuits and Systems, vol. 2, no. 11, Nov. 2010.
[7]
R. Zimmermann, "Efficient VLSI implementation of modulo (2n+1) addition and multiplication", Proc. of IEEE Symp. on Computer Arithmetic, pp. 158--167, April 1999.
[8]
Y.-J. Chen, D.-R. Duh, Y. S. Han, "Improved modulo (2n+1) Multiplier for IDEA", Journal of Information Science and Engineering, vol. 23, no. 3, pp. 907--919, 2007.
[9]
H. T. Vergos, C. Efstathiou, "Design of efficient modulo 2n+1 multipliers", IET Computers & Digital Techniques, vol. 1, no. 1, pp. 49--57, Jan. 2007.
[10]
{C. Efstathiou, N. Axelos, K. Pekmestzi, "On the design of modulo 2n+1 multipliers", in Proc. of 14th Euromicro Conference on Digital System Design (DSD), pp. 453--459, 2011.
[11]
J. Sklansky, "Conditional sum addition logic", IRE Trans. Electronic Computers, vol. 9, no. 6, pp. 226--231, June 1960.
[12]
W. Hong, R. Modugu, and M. Choi, "Efficient Online Self-Checking Modulo 2n+1 Multiplier Design", IEEE Trans. on Computers, vol. 60, no. 9, pp. 1354--1365.
[13]
H. T. Vergos, C. Efstathiou, "Efficient Modulo 2n+1 Adder Architectures", Integration, the VLSI Journal, vol. 42, no. 2, pp. 149--157, Feb. 2009.
Index Terms
- Efficient modulo 2n+1 multiplication for the idea block cipher
Recommendations
Efficient modulo 2n±1 squarers
Modulo 2^n+/-1 squarers are useful components for designing special purpose digital signal processors that internally use a residue number system and for implementing the modulo exponentiators and multiplicative inverses required in cryptographic ...
A Simplified Architecture for Modulo (2n + 1) Multiplication
The modulo (2n + 1) multiplication is widely used in the computation of convolutions and in RNS arithmetic and, thus, it is important to reduce the calculation delay. This paper presents a concept of a modulo (2n + 1) carry save adder (MCSA) and uses ...
On the Design of Modulo 2n±1 Subtractors and Adders/Subtractors
Novel architectures for designing modulo 2n+1 subtractors and combined adders/subtractors are proposed in this manuscript. Both the normal and the diminished-one representations of the operands are considered. Unit gate estimates and CMOS VLSI ...
Comments
Information & Contributors
Information
Published In
May 2013
368 pages
ISBN:9781450320320
DOI:10.1145/2483028
- General Chair:
- Jose L. Ayala,
- Program Chairs:
- Alex Jones,
- Patrick Madden,
- Publications Chair:
- Ayse K. Coskun
Copyright © 2013 ACM.
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]
Sponsors
- SIGDA: ACM Special Interest Group on Design Automation
- IEEE CEDA
- IEEE CASS
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 02 May 2013
Check for updates
Author Tags
Qualifiers
- Research-article
Conference
GLSVLSI'13
Sponsor:
Acceptance Rates
GLSVLSI '13 Paper Acceptance Rate 76 of 238 submissions, 32%;
Overall Acceptance Rate 312 of 1,156 submissions, 27%
Upcoming Conference
GLSVLSI '25
- Sponsor:
- sigda
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 170Total Downloads
- Downloads (Last 12 months)4
- Downloads (Last 6 weeks)0
Reflects downloads up to 05 Mar 2025
Other Metrics
Citations
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in