Abstract
Let \(f:{\mathbb{F}_2^{n}}\to {\mathbb{F}_2^{n}}\) be an almost perfect nonlinear function (APN). The set \(D_f:=\{(a,b)\: :\: f(x+a)-f(x)=b\mbox{\ has two solutions}\}\) can be used to distinguish APN functions up to equivalence. We investigate the multiplier groups of theses sets D f . This extends earlier work done by the authors [1].
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Edel, Y., Pott, A.: A new almost perfect nonlinear function which is not quadratic. Adv. Math. Commun. 3, 59–81 (2009)
Carlet, C.: Boolean functions for cryptography and error correcting codes. In: Crama, Y., Hammer, P. (eds.) Boolean Methods and Models. Cambridge University Press, Cambridge (to appear), http://www-roc.inria.fr/secret/Claude.Carlet/chap-fcts-Bool.pdf
Carlet, C.: Vectorial boolean functions for cryptography. In: Crama, Y., Hammer, P. (eds.) Boolean Methods and Models. Cambridge University Press, Cambridge (to appear), http://www-roc.inria.fr/secret/Claude.Carlet/chap-vectorial-fcts.pdf
Edel, Y., Pott, A.: On the equivalence of nonlinear functions. In: Preneel, B., Dodunekov, S., Rijmen, V., Nikova, S. (eds.) Enhancing Cryptographic Primitives with Techniques from Coding Theory, NATO Advanced Research Workshop, pp. 87–103. IOS Press, Amsterdam (2009)
Göloğlu, F., Pott, A.: Almost perfect nonlinear functions: A possible geometric approach. In: Nikova, S., Preneel, B., Storme, L., Thas, J. (eds.) Coding Theory and Cryptography II, Koninklijke Vlaamse Academie van België voor Wetenschappen en Kunsten, pp. 75–100 (2007)
Edel, Y., Kyureghyan, G., Pott, A.: A new APN function which is not equivalent to a power mapping. IEEE Trans. Inform. Theory 52(2), 744–747 (2006)
Budaghyan, L., Carlet, C., Leander, G.: On inequivalence between known power APN functions. In: International Conference on Boolean Functions: Cryptography and Applications (2008) (to appear)
Dempwolff, U.: Automorphisms and equivalence of bent functions and of difference sets in elementary abelian 2-groups. Comm. Algebra 34(3), 1077–1131 (2006)
Beth, T., Jungnickel, D., Lenz, H.: Design Theory, 2nd edn. Cambridge University Press, Cambridge (1999)
Budaghyan, L., Carlet, C., Pott, A.: New classes of almost bent and almost perfect nonlinear polynomials. IEEE Trans. Inform. Theory 52(3), 1141–1152 (2006)
Carlet, C., Charpin, P., Zinoviev, V.: Codes, bent functions and permutations suitable for DES-like cryptosystems. Des. Codes Cryptogr. 15(2), 125–156 (1998)
Bosma, W., Cannon, J., Playoust, C.: The Magma algebra system. i. the user language. J. Symbolic Comput. 24(3–4), 235–265 (1997)
Chabaud, F., Vaudenay, S.: Links between differential and linear cryptanalysis. In: De Santis, A. (ed.) EUROCRYPT 1994. LNCS, vol. 950, pp. 356–365. Springer, Heidelberg (1995)
Preneel, B.: Analysis and Design of Cryptographic Hash Functions. PhD thesis, Katholieke Universiteit Leuven (1993)
Rothaus, O.S.: On “bent” functions. J. Combinatorial Theory Ser. A 20(3), 300–305 (1976)
McFarland, R.L.: Difference sets in abelian groups of order \(4p\sp 2\). Mitt. Math. Sem. Giessen (192), i–iv, 1–70 (1989)
MacWilliams, F.J., Sloane, N.J.A.: The theory of error-correcting codes. II, vol. 16. North-Holland Publishing Co., North-Holland Mathematical Library, Amsterdam (1977)
Browning, K., Dillon, J., Kibler, R., McQuistan, M.: APN polynomials and related codes (2008) (submitted)
Gold, R.: Maximal recursive sequences with 3-valued recursive cross-correlation function. IEEE Trans. Inf. Th. 14, 154–156 (1968)
Kasami, T.: The weight enumerators for several classes of subcodes of the 2nd order binary Reed-Muller codes. Information and Control 18, 369–394 (1971)
Dillon, J.F.: Multiplicative difference sets via additive characters. Des., Codes, Cryptogr. 17(1/2/3), 225–235 (1999)
Bending, T.D., Fon-Der-Flaass, D.: Crooked functions, bent functions, and distance regular graphs. Electron. J. Combin. 5, 14 (1998), Research Paper 34 (electronic)
Bierbrauer, J., Kyureghyan, G.M.: Crooked binomials. Des. Codes Cryptogr. 46(3), 269–301 (2008)
Kyureghyan, G.M.: Crooked maps in \(\Bbb F\sb {2\sp n}\). Finite Fields Appl. 13(3), 713–726 (2007)
Edel, Y.: On quadratic APN functions and dimensional dual hyperovals, http://www.mathi.uni-heidelberg.de/~yves/Papers/APNdho.html
Brinkmann, M., Leander, G.: On the classification of APN functions up to dimension five. Des., Codes, Cryptogr. 1, 273–288 (2008)
Dillon, J.F.: slides from invited talk ”APN Polynomials–An Update”. In: The 9th International Conference on Finite Fields and their Applications, University College Dublin (2009), http://mathsci.ucd.ie/~gmg/Fq9Talks/Dillon.pdf
Janwa, H., Wilson, R.M.: Hyperplane sections of Fermat varieties in \({\bf P}\sp 3\) in char. 2 and some applications to cyclic codes. In: Moreno, O., Cohen, G., Mora, T. (eds.) AAECC 1993. LNCS, vol. 673, pp. 180–194. Springer, Heidelberg (1993)
Jedlicka, D.: APN monomials over \({\rm GF}(2\sp n)\) for infinitely many n. Finite Fields Appl. 13(4), 1006–1028 (2007)
Hernando, F., McGuire, G.: Proof of a conjecture on the sequence of exceptional numbers. classifying cyclic codes and APN functions arXiv:0903.2016v3 (2009)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Edel, Y., Pott, A. (2009). On Designs and Multiplier Groups Constructed from Almost Perfect Nonlinear Functions. In: Parker, M.G. (eds) Cryptography and Coding. IMACC 2009. Lecture Notes in Computer Science, vol 5921. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-10868-6_23
Download citation
DOI: https://doi.org/10.1007/978-3-642-10868-6_23
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-10867-9
Online ISBN: 978-3-642-10868-6
eBook Packages: Computer ScienceComputer Science (R0)