Journal of Systems Engineering and Electronics ›› 2007, Vol. 18 ›› Issue (2): 427-433.

• SOFTWARE ALGORITHM AND SIMULATION • Previous Articles     Next Articles

One AES S-box to increase complexity and its cryptanalysis

Liu Jingmei1, Wei Baodian2 & Wang Xinmei1   

  1. 1. National Key Lab. of Integrated Service Networks, Xidian Univ., Xi’an 710071, P.R. China;
    2. Information Science and Technology School of Sun Yat-sen Univ., Guangzhou 510275, P.R. China
  • Online:2007-06-25 Published:2010-01-03

Abstract:

It is well known that the algebraic expression of AES S-box is very simple and only 9 terms are involved. Hence, AES security is suspected although there is no vulnerability on it so far. To eliminate the weakness of extremely small terms in the algebraic expression of AES S-box, one improved AES S-box is proposed, which preserves the algebraic degree invariable but significantly increases the number of its algebraic expression terms from 9 to 255. At the same time, Boolean function has good characters in balance and strict avalanche criterion (SAC), etc. Finally, it is proved that the improved AES S-box scheme is secure against the powerful known differential and linear cryptanalysis.