Chinese Journal of Network and Information Security ›› 2017, Vol. 3 ›› Issue (10): 72-76.doi: 10.11959/j.issn.2096-109x.2017.00203

• Papers • Previous Articles    

Permutations from APN power functions over F 2 2n

Shi-zhu TIAN1,2()   

  1. 1 The State Key Lab of Information Security,Institute of Information Engineering,Chinese Academy of Science,Beijing 100093,China
    2 University of Chinese Academy of Sciences,Beijing 100049,China
  • Revised:2017-09-10 Online:2017-10-01 Published:2017-11-13
  • Supported by:
    The National Natural Science Foundation of China(61379142)

Abstract:

APN functions have the lowest differential uniform over finite fields with characteristic 2 and the APN power functions are the most classical ones.APN power functions are all 3-1 functions over F 2 2n .By generalizing the idea of changing 2-1 functions to 1-1 functions over finite fields with odd characteristics,methods to change 3-1 functions over finite fields with even characteristics into permutations were obtained and permutations from APN power functions over F 2 2n were constructed.According to the construction,the differential properties of permutations obtained by this method were discussed.

Key words: finite fields, permutation polynomials, APN, power functions

CLC Number: 

No Suggested Reading articles found!