APN-functions
Prikladnaâ diskretnaâ matematika, no. 10 (2009), pp. 13-14.

Voir la notice de l'article provenant de la source Math-Net.Ru

This survey contains basic results about properties, equivalence and methods for construction of APN-functions.
@article{PDM_2009_10_a5,
     author = {M. \`E. Tuzhilin},
     title = {APN-functions},
     journal = {Prikladna\^a diskretna\^a matematika},
     pages = {13--14},
     publisher = {mathdoc},
     number = {10},
     year = {2009},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/PDM_2009_10_a5/}
}
TY  - JOUR
AU  - M. È. Tuzhilin
TI  - APN-functions
JO  - Prikladnaâ diskretnaâ matematika
PY  - 2009
SP  - 13
EP  - 14
IS  - 10
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/PDM_2009_10_a5/
LA  - ru
ID  - PDM_2009_10_a5
ER  - 
%0 Journal Article
%A M. È. Tuzhilin
%T APN-functions
%J Prikladnaâ diskretnaâ matematika
%D 2009
%P 13-14
%N 10
%I mathdoc
%U http://geodesic.mathdoc.fr/item/PDM_2009_10_a5/
%G ru
%F PDM_2009_10_a5
M. È. Tuzhilin. APN-functions. Prikladnaâ diskretnaâ matematika, no. 10 (2009), pp. 13-14. http://geodesic.mathdoc.fr/item/PDM_2009_10_a5/

[1] Nyberg K., Knudsen L. R., “Provable Security Against Differential Cryptography”, LNCS, 740, 1993, 566–574 | MR | Zbl

[2] Berger T., Canteaut A., Charpin P., Laigle-Chapuy Y., “On Almost Perfect Nonlinear Functions Over $\mathbb F_{2^n}$”, IEEE Transactions on Information Theory, 52:9 (2006), 4160–4170 | DOI | MR

[3] Zeng X., Hu L., Yang Y., Jiang W., On the inequivalence of Ness-Helleseth APN functions, Cryptology ePrint Archive 2007/379

[4] Carlet C., Charpin P., Zinoviev V., “Codes, bent functions and permutations suitable for DES-like cryptosystems”, Designs, Codes and Cryptography, 15:2 (1998), 125–156 | DOI | MR | Zbl

[5] Budaghyan L., Carlet C., Pott A., New Classes of Almost Bent and Almost Perfect Nonlinear Polynomials, Proceedings of the Workshop on Coding and Cryptography., 2005, 306–315 | MR

[6] Budaghyan L., Carlet C., Leander G., Constructing new APN functions from known ones, Cryptology ePrint Archive 2007/063