Skip to main content
Log in

A novel key scheduling scheme for AES algorithm

  • Computer Science
  • Published:
Wuhan University Journal of Natural Sciences

Abstract

This paper examines the theory of AES key scheduling and its potential problems. We propose a novel key scheduling scheme. The scheme improves the speed of key expansion without increasing computational complexity, reduces the dependency of output key on input key during key expansion, and improves the avalanche effect of key expansion.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Daemen J, Rijmen V. AES proposal: Rijndael Version 2 [EB/OL]. [1999-10-05]. http://www.east.kuleuven.ac.be/rijmen/rijndael.

    Google Scholar 

  2. Dunkelman O, Keller N, Shamir A. Improved single-key attacks on 8-round AES-192 and AES-256 [C] // Proceedings of the 16th International Conference on the Theory and Application of Cryptology and Information Security. Berlin, Heidelberg: Springer-Verlag, 2010: 158–176.

    Google Scholar 

  3. Hu Z H. Differential algebraic attack of serpent [J]. Journal of Beijing University of Technology, 2010, 36(5): 651–654(Ch).

    Google Scholar 

  4. Hu Z H, Qin Z P. A new 8-round AES_128 impossible differential cryptanalysis [J]. Journal of Chinese Computer Systems, 2012, 38(12): 73–79(Ch).

    Google Scholar 

  5. Hu Z H, Qin Z P. Related-Key collision attack of AES_256 [C] // Intelligence Information Processing and Trusted Computing (IPTC), 2010 International Symposium on IEEE. Washington D C: IEEE Computer Society, 2010: 589–592.

    Chapter  Google Scholar 

  6. Hu Z H, Qin Z P. Related key impossible differential cryptanalysis of AES_256 [J]. International Journal of Advancements in Computing Technology, 2012, 4(3): 2233–9337.

    Google Scholar 

  7. Bogdanov A, Khovratovich D, Rechberger C. Biclique cryptanalysis of the full AES [C] // Proceedings of the 17th International Conference on the Theory and Application of Cryptology and Information Security. Berlin, Heidelberg: Springer-Verlag, 2011: 344–371.

    Google Scholar 

  8. Armknecht F, Lucks S. Linearity of the AES key schedule [C] // 4th International Conference (AES 2004). Berlin, Heidelberg: Springer-Verlag, 2005: 159–169.

    Google Scholar 

  9. Cui J S, Zhang H G. MARS algorithm—Candidate of advanced encryption standard [J]. China Information Security, 2000, 22(2): 59–66 (Ch).

    Google Scholar 

  10. Hu L, Yuan W, Yu M T, et al. One-way property strategy and improvement of key generation algorithm of Rijndae[J]. Journal of Jilin University (Engineering and Technology Edition), 2009, 39(1): 137–142(Ch).

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Zhihua Hu.

Additional information

Foundation item: Supported by the Natural Science Foundation of Hubei Province (2013CFB473,14Y064,20152906)

Biography: HU Zhihua, male, Ph.D., Associate professor, research direction: information security, encryption algorithm analysis.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Hu, Z., Xiong, K. A novel key scheduling scheme for AES algorithm. Wuhan Univ. J. Nat. Sci. 21, 110–114 (2016). https://doi.org/10.1007/s11859-016-1145-x

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11859-016-1145-x

Key words

CLC number

Navigation