Enhanced Key Expansion for AES-256 by using Even-Odd method
- 1 November 2011
- conference paper
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 23248149,p. 1-5
- https://doi.org/10.1109/icriis.2011.6125708
Abstract
This study is conducted to determine an alternative, creative method for designing Key Expansion in AES-256 that is called Even-Odd (E-O) method. The proposed algorithm consists of two parts. The first part is Key Expansion and the second part is E-O Select Round Key. The cipher key is 256 bits as an input and the output is fifteen round keys that are 128 bits and include 14 round keys and one pre round key. The element of confusion is highly being concerned in this algorithm and efficiency is improved compared to the classic existing algorithms. The avalanche effect of E-O method is highly improved than classic method. In addition, the concept of weak key is eliminated from the mentioned algorithm. The results also show that the performance of the sub-keys generation is equivalent to the classic AES algorithm.Keywords
This publication has 6 references indexed in Scilit:
- The effects of the omission of last round's MixColumns on AESInformation Processing Letters, 2010
- Improved Related-Key Boomerang Cryptanalysis of AES-256Published by Institute of Electrical and Electronics Engineers (IEEE) ,2010
- Advanced Encryption Standard (AES)Network Security, 2009
- Single- and Multi-core Configurable AES Architectures for Flexible SecurityIEEE Transactions on Very Large Scale Integration (VLSI) Systems, 2009
- Advanced Encryption StandardPublished by Elsevier BV ,2007
- A configurable AES processor for enhanced securityPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2005