论文信息 - On inversion in ℤ2n-1

On inversion in ℤ2n-1

In this paper we determined explicitly the multiplicative inverses of the Dobbertin and Welch APN exponents in Z"2"^"n"-"1, and we described the binary weights of the inverses of the Gold and Kasami exponents. We studied the function Inv"d(n), which for a fixed positive integer d maps integers n>=1 to the least positive residue of the inverse of d modulo 2^n-1, if it exists. In particular, we showed that the function Inv"d is completely determined by its values for 1=

Gohar M. M. Kyureghyan | Valentin Suder | Valentin Suder

[1] Anne Canteaut,et al. Differential Properties of ${x\mapsto x^{2^{t}-1}}$ , 2011, IEEE Transactions on Information Theory.

[2] Da-Zheng Feng,et al. Almost perfect nonlinear permutations , 1994 .

[3] Anne Canteaut,et al. Weight Divisibility of Cyclic Codes, Highly Nonlinear Functions on F2m, and Crosscorrelation of Maximum-Length Sequences , 2000, SIAM J. Discret. Math..

[4] Kaisa Nyberg,et al. Differentially Uniform Mappings for Cryptography , 1994, EUROCRYPT.

[5] Xiang-dong Hou,et al. Reversed Dickson polynomials over finite fields , 2009, Finite Fields Their Appl..

[6] Gary McGuire,et al. Proof of a Conjecture on the Sequence of Exceptional Numbers, Classifying Cyclic Codes and APN Functions , 2009, ArXiv.

[7] Gohar M. M. Kyureghyan,et al. On inverses of APN exponents , 2012, 2012 IEEE International Symposium on Information Theory Proceedings.

[8] R. McEliece. Finite field for scientists and engineers , 1987 .

[9] K. T. Arasu,et al. Geometry, codes and difference sets: exceptional connections , 2002 .

[10] Claude Carlet,et al. Codes, Bent Functions and Permutations Suitable For DES-like Cryptosystems , 1998, Des. Codes Cryptogr..

[11] Mark Goresky,et al. Algebraic Shift Register Sequences: List of figures , 2011 .

[12] R. McEliece. Finite Fields for Computer Scientists and Engineers , 1986 .