| Fast composite field S-box architectures for advanced encryption standard |
| Full text |
Pdf
(284 KB)
|
Source
|
Great Lakes Symposium on VLSI
archive
Proceedings of the 18th ACM Great Lakes symposium on VLSI
table of contents
Orlando, Florida, USA
SESSION: Session 2A: Cryptography and Architecture
table of contents
Pages 65-70
Year of Publication: 2008
ISBN:978-1-59593-999-9
|
|
Authors
|
|
Renfei Liu
|
University of Minnesota, Twin Cities, Minneapolis, MN, USA
|
|
Keshab K. Parhi
|
University of Minnesota, Twin Cities, Minneapolis, MN, USA
|
|
| Sponsors |
|
| Publisher |
|
| Bibliometrics |
Downloads (6 Weeks): n/a, Downloads (12 Months): n/a, Citation Count: 0
|
|
|
ABSTRACT
Byte substitution (S-Box), which is essentially a combination of inversion and affine operations over a finite field GF(28), limits the throughput of the Advanced Encryption Standard (AES) algorithm. Among existing S-Box architectures, the composite field S-Box algorithm is very attractive for its extremely low area cost, which is only 12%-20% of other implementation approaches [1]. However, the composite field S-Box suffers from extremely low throughput rate. In this paper, we propose a novel fast composite field S-Box architecture. By applying pre-computation techniques, some computation on the critical data path can be eliminated so as to reduce the critical path delay. The complexity of the precomputation units is minimized via sharing common structures. The proposed design is implemented using a 0.18-um CMOS technology library. The results show that the throughput rate is increased by 28.22% at the expense of a fairly modest increase in area. Based on the proposed design, we then present an approach to further reduce critical path delay. The gate-level analysis shows that the second proposed approach can increase the throughput rate by 56.25%. In addition, the proposed designs can reduce the pipelining latency by 40%-60% compared with the conventional design while keeping the same throughput rate.
REFERENCES
Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.
| |
1
|
|
| |
2
|
Advanced Encryption Standard (AES) FIPS Pub 197, Nov, 2001.
|
| |
3
|
Data Encryption Standard (DES) FIPS Pub 46--3, Oct, 1999.
|
| |
4
|
|
| |
5
|
A. J. Elbirt, W. Yip, B. Chetwynd, and C. Paar, "An FPGA Implementation and Performance Evaluation of the AES Block Cipher Candidate Algorithm Finalist," Proc. 3rd AES Conf. (AES3), New York, Apr. 2000.
|
| |
6
|
|
| |
7
|
K. Gaj and P. Chodowiec, "Comparison of the Hardware Performance of the AES Candidates using Reconfigurable Hardware," in Proc. 3rd AES Conf. (AES3), New York, Apr. 2000.
|
| |
8
|
|
| |
9
|
M. McLoone and J. V. McCanny, "Rijndael FPGA implementation utilizing Look-up tables," in IEEE Workshop on Signal Processing Systems, pp. 349--360, Sept. 2001.
|
| |
10
|
V. Rijmen, "E±cient Implementation of the Rijndael S-Box," http://www.iaik.tugraz.ac.at/research/krypto/AES/old/rijmen/rijndael/SBox.pdf, 2006.
|
| |
11
|
Atri Rudra , Pradeep K. Dubey , Charanjit S. Jutla , Vijay Kumar , Josyula R. Rao , Pankaj Rohatgi, Efficient Rijndael Encryption Implementation with Composite Field Arithmetic, Proceedings of the Third International Workshop on Cryptographic Hardware and Embedded Systems, p.171-184, May 14-16, 2001
|
| |
12
|
|
| |
13
|
|
| |
14
|
|
|