[1] |
LIDL R , NIEDERREITER H . Finite fields[M]. Massachusetts: Addison-Wesley Publishing CompanyPress, 1983.
|
[2] |
HOU X D . Determination of a type of permutation trinomials over finite fields[J]. Finite Fields and Their Applications, 2015(35): 16-35.
|
[3] |
NYBERG K , . Differentially uniform mappings for cryptography[C]// The Workshop on the Theory and Application of of Cryptographic Techniques. 1993: 55-64.
|
[4] |
CARLET C . Vectorial boolean functions for cryptography[M]. Cambridge: Cambridge University PressPress, 2010.
|
[5] |
GOLD R . Maximal recursive sequences with 3-value recursive crosscorrelation functions[J]. IEEE Trans Inform Theory, 1968(14): 154-156.
|
[6] |
KASAMI T . The weight enumerators for several classes of subcodes of the second order binary Reed-Muller codes[J]. Information and Control, 1971(18): 369-394.
|
[7] |
DOBBERTIN H . Almost perfect nonlinear power functions on GF(2n):a new case for n divisible by 5[J]. Proceedings of Finite Fields and Applications Fq5, 2000: 113-121.
|
[8] |
BROWNING K , DILLON J , MCQUISTAN M ,et al. An APN permutation in dimension six[J]. Contemporary Mathematics, 2010(58):: 33-42.
|
[9] |
QU L J , TAN Y , TAN C ,et al. Constructing differentially 4-uniform permutations over F 2 2n via theswitching method[J]. IEEE Trans Inf Theory, 2013,59(7): 4675-4686.
|
[10] |
LI Y Q , WANG M S . Constructing differentially 4-uniform permutations over GF(2 n) from quadraticAPN permutations over GF(22 n+1)[J]. Designs Codes & Cryptography, 2014,61(6): 249-264.
|
[11] |
TANG D , CARLET C , TANG X H . Differentially 4-uniform bijections by permuting the inverse function[J]. Designs Codes & Cryptography, 2015,77(1): 117-141.
|
[12] |
PERRIN L , UDOVENKO A , BIRYUKOV A . Cryptanalysis of a theorem:Decomposing the only known solution to the big APN problem[C]// The 36th Annual International Cryptology Conference. 2016: 93-122.
|
[13] |
CANTEAUT A , DUVAL S , PERRIN L . A generalisation of Dillon’s APN permutation with the best known differential and nonlinear propertiesfor all fields of size 24k+2[J]. IEEE Transactions on Information Theory, 2016,(99): 1-1.
|
[14] |
FU S H , FENG X T . Further results of the cryptographic properties onthe butterfly structure[J]. Computer Science—Information Theory, 2016,(7):
|
[15] |
JIA W J , ZENG X Y , LI C L ,et al. Permutation polynomials with low differential uniformity over finite fields of odd charateristic[J]. Science China Mathematics, 2013(56): 1429-1440.
|
[16] |
BLUHER A B . On xq+1+ax+b[J]. Finite Fields and their Applications, 2004(10): 285-305.
|