A Study Of Iterative-Compression Based Improved AES Key Expansion
Authors
Wei Wang, Haitao Zhang, Haiyan Tan, Bin Zheng
Corresponding Author
Wei Wang
Available Online June 2016.
- DOI
- 10.2991/icamcs-16.2016.93How to use a DOI?
- Keywords
- AES, Iterative-Compression, one-way property, FPGA
- Abstract
AES key expansion algorithm doesn’t have one-way property, and it can’t prevent the sub secret key reverse. So an improved algorithm of AES key expansion based on Iterative-Compression was proposed in this study. The algorithm confused initial key by cyclically shifting, and then the 128-bit key iteration obfuscated compressed into a 32-bit secret key. The first sub key was generated by the key word, and the follow sub keys were extended through recursive computation according to the first sub key. In the end, results of the one-way property analysis and FPGA simulation demonstrate that the one-way property strength of the improved key expansion algorithm is 296. And it meets high efficiency requirement.
- Copyright
- © 2016, the Authors. Published by Atlantis Press.
- Open Access
- This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).
Cite this article
TY - CONF AU - Wei Wang AU - Haitao Zhang AU - Haiyan Tan AU - Bin Zheng PY - 2016/06 DA - 2016/06 TI - A Study Of Iterative-Compression Based Improved AES Key Expansion BT - Proceedings of the 2016 5th International Conference on Advanced Materials and Computer Science PB - Atlantis Press SP - 443 EP - 446 SN - 2352-5401 UR - https://doi.org/10.2991/icamcs-16.2016.93 DO - 10.2991/icamcs-16.2016.93 ID - Wang2016/06 ER -