상세 보기
High-throughput low-area design of AES using constant binary matrix-vector multiplication
- Lee, Hokyoon;
- Paik, Yoonah;
- Jun, Jaeyung;
- Han, Youngsun;
- Kim, Seon Wook
WEB OF SCIENCE
12SCOPUS
15초록
In spite of many outstanding studies, the hardware implementation of Advanced Encryption Standard (AES) algorithm is still challenging because of recurrent computations in Galois Field GF(2(8)). In this paper, in order to revolution up the hardware implementation, we propose a new design of SubBytes and Mix-Columns in AES using constant binary matrix-vector multiplications. By employing constant binary matrices reduced to AND and XOR operations, we could promote a synthesis compiler to optimize the design more efficiently. In addition, in order to achieve higher throughput, we propose a four-stage pipelined AES architecture. Evaluations show that the proposed method improves both in term of throughput and area complexity. Our proposed design of AES achieved 3.8 Gbps throughput with about 9.8k gates and 1k flip-flops which was the highest throughput and the lowest gate count at the same time, on 180 nm CMOS technology. By applying our proposed method to SubBytes, the area complexity decreased by 8.3% while the latency was reduced by 5.5%. (C) 2016 Elsevier B.V. All rights reserved.
키워드
- 제목
- High-throughput low-area design of AES using constant binary matrix-vector multiplication
- 저자
- Lee, Hokyoon; Paik, Yoonah; Jun, Jaeyung; Han, Youngsun; Kim, Seon Wook
- 발행일
- 2016-11
- 유형
- Article
- 권
- 47
- 페이지
- 360 ~ 368