Journal on Communications ›› 2017, Vol. 38 ›› Issue (11): 84-92.doi: 10.11959/j.issn.1000-436x.2017206

• Papers • Previous Articles     Next Articles

Research on affine equivalence enumeration of the three families vectorial function

Feng YUAN1(),Ji-jun JIANG1,Yang YANG2,Sheng-wei XU1   

  1. 1 Information Security Institute,Beijing Electronic Science and Technology Institute,Beijing 100070,China
    2 College of Mathematics and Computer Science,Fuzhou University,Fuzhou 350108,China
  • Revised:2017-07-05 Online:2017-11-01 Published:2017-12-13
  • Supported by:
    The National Natural Science Foundation of China(61402112);The Fundamental Research Funds for the Central Universities(2014XSYJ09);The Fundamental Research Funds for the Central Universities(328201509);The Fund of Beijing Electronic Science and Technology Institute(2014TD2-OHW)

Abstract:

In recent years,Qu-Tan-Tan-Li function,Zha-Hu-Sun function and Tang-Carlet-Tang function have been proposed with differential uniformity 4 and many good cryptographic properties.the counting problem of affine equivalent to the three families cryptographic functions was investigated.By using some properties of finite fields,the upper and lower bound of the number of affine equivalent to the Zha-Hu-Sun function,and the upper bound of the number of affine equivalent to the Qu-Tan-Tan-Li function and Tang-Carlet-Tang function were computed,respectively.Moreover,a conjecture was given about the exact number of affine equivalent to the Zha-Hu-Sun function.Results show that there are at least 2 53 [ i=1 8 ( 2 i 1) ] 2 cryptographic functions of affine equivalent to the Zha-Hu-Sun function over finite field GF(28),which can be chosen as S-boxes of block ciphers.

Key words: cryptography, cryptographic functions, S-box, affine equivalence, enumeration

CLC Number: 

No Suggested Reading articles found!