Nowadays, the Advanced Encryption System - AES is used in almost all network-based applications to ensure security. The core computation of AES, which is performed on data blocks of 128 bits, is iterated for several rounds, de- pending on the key size. The strength of AES is proportional to the number of rounds applied. So far, the number of rounds is fixed to 10, 12 and 14 for a key size of 128, 192 and 256 bits respectively. Most cryptographers feel that the margin between the number of rounds specified in the cipher and the best known attacks is too small. On the other hand, it is clear that the overall efficiency of a given AES implementation is inversely proportional to the number of rounds imposed. In this paper, we propose a very efficient pipelined hardware implementation of AES-128. Besides, we show that if the re- quired number of rounds must increase to defeat attackers, the proposed implementation stays efficient.
[1]
Bruce Schneier,et al.
Improved Cryptanalysis of Rijndael
,
2000,
FSE.
[2]
Jean-Didier Legat,et al.
A methodology to implement block ciphers in reconfigurable hardware and its application to fast and compact AES RIJNDAEL
,
2003,
FPGA '03.
[3]
Josef Pieprzyk,et al.
Cryptanalysis of Block Ciphers with Overdefined Systems of Equations
,
2002,
ASIACRYPT.
[4]
Vincent Rijmen,et al.
The Design of Rijndael: AES - The Advanced Encryption Standard
,
2002
.
[5]
Annie Pérez,et al.
AES Implementation on FPGA: Time - Flexibility Tradeoff
,
2002,
FPL.
[6]
Xuejia Lai,et al.
A Proposal for a New Block Encryption Standard
,
1991,
EUROCRYPT.