Gray S-box for Advanced Encryption Standard

被引:108
作者
Tran, Minh-Triet [1 ]
Bui, Doan-Khanh [2 ]
Duong, Anh-Duc [1 ]
机构
[1] Univ Sci, 227 Nguyen Van Cu,Dist 5, Ho Chi Minh City, Vietnam
[2] Univ Paris 04, Dept Math, Paris, France
来源
2008 INTERNATIONAL CONFERENCE ON COMPUTATIONAL INTELLIGENCE AND SECURITY, VOLS 1 AND 2, PROCEEDINGS | 2008年
关键词
algebraic complexity; algebraic expression; binary Gray code; Gray Augmentation; S-box; AES;
D O I
10.1109/CIS.2008.205
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
We present Gray S-box for Advanced Encryption Standard. Gray S-box is constructed by adding binary Gray code tran. formation as a preprocessing step to original AES S-box. Gray S-box corresponds to a polynomial with all 255 non-zero terms in comparison with 9-term polynomial of original AES S-box. This increases the security for S-box against algebraic attacks and interpolation attacks. Besides, as Gray S-box reuses AES S-box as a whole, Gray S-box inherits all advantages and efficiency of any existing optimized implementation of AES S-box. Gray S-box also achieves important cryptographic properties of AES S-box, including strict avalanche criterion, nonlinearity, and differential uniformity.
引用
收藏
页码:253 / +
页数:2
相关论文
共 30 条
  • [1] [Anonymous], 2001, 197 FIPS NAT I STAND
  • [2] [Anonymous], 1994, LNCS
  • [3] BIHAM E, 1990, LNCS, V537, P2
  • [4] Canright D, 2005, LECT NOTES COMPUT SC, V3659, P441
  • [5] Courtois NT, 2002, LECT NOTES COMPUT SC, V2501, P267
  • [6] CUI L, 2007, INT J INNOVATIVE COM, V3
  • [7] Daemen J., 1999, AES PROPOSAL
  • [8] Feng D, 2000, DESIGN ANAL BLOCK CI
  • [9] Ferguson N., 2001, P INT WORKSH SEL AR, P103
  • [10] GARDNER M, 1986, BINARY GRAY CODE