Abstract
In 2008 Budaghyan, Carlet and Leander generalized a known instance of an APN function over the finite field \(\mathbb {F}_{2^{12}}\) and constructed two new infinite families of APN binomials over the finite field \(\mathbb {F}_{2^n}\), one for n divisible by 3, and one for n divisible by 4. By relaxing conditions, the family of APN binomials for n divisible by 3 was generalized to a family of differentially \(2^t\)-uniform functions in 2012 by Bracken, Tan and Tan; in this sense, the binomials behave in the same way as the Gold functions. In this paper, we show that when relaxing conditions on the APN binomials for n divisible by 4, they also behave in the same way as the Gold function \(x^{2^s+1}\) (with s and n not necessarily coprime). As a counterexample, we also show that a family of APN quadrinomials obtained as a generalization of a known APN instance over \(\mathbb {F}_{2^{10}}\) cannot be generalized to functions with \(2^t\)-to-1 derivatives by relaxing conditions in a similar way.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Biham, E., Shamir, A.: Differential cryptanalysis of DES-like cryptosystems. J. Cryptol. 4(1), 3–72 (1991). https://doi.org/10.1007/BF00630563
Bracken, C., Byrne, C., Markin, N., Mcguire, G.: Fourier spectra of binomial APN functions. SIAM J. Discrete Math. 23(2), 596–608 (2009)
Bracken, C., Tan, C., Tan, Y.: Binomial differentially 4 uniform permutations with hight nonlinearity. Finite Fields Appl. 18, 537–546 (2012)
Budaghyan, L.: Construction and Analysis of Cryptographic Functions. Springer, Cham (2015). https://doi.org/10.1007/978-3-319-12991-4
Budaghyan, L., Carlet, C., Leander, G.: Two classes of quadratic APN binomials inequivalent to power functions. IEEE Trans. Inf. Theory 54(9), 4218–4229 (2008)
Budaghyan, L., Carlet, C., Pott, A.: New classes of almost bent and almost perfect nonlinear functions. IEEE Trans. Inf. Theory 52(3), 1141–1152 (2006)
Budaghyan, L., Helleseth, T., Kaleyski, N.: A new family of APN quadrinomials. IEEE Trans. Inf. Theory (2020, early access article)
Carlet, C.: Vectorial (multi-output) Boolean functions for cryptography, chapter of the monography boolean methods and models, In: Crama, Y., Hammer, P. (eds.) Cambridge University Press, to appear soon. Preliminary version available at http://www-rocq.inria.fr/codes/Claude.Carlet/pubs.html
Carlet, C., Charpin, P., Zinoviev, V.: Codes, bent functions and permutations suitable for DES-like cryptography. Des. Codes Crypt. 15(2), 125–156 (1998). https://doi.org/10.1023/A:1008344232130
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). https://doi.org/10.1007/BFb0053450
Edel, Y., Kyureghyan, G., Pott, A.: A new APN function which is not equivalent to a power mappings. IEEE Trans. Inf. Theory 52(2), 744–747 (2006)
Matsui, M.: Linear cryptanalysis method for DES cipher. In: Helleseth, T. (ed.) EUROCRYPT 1993. LNCS, vol. 765, pp. 386–397. Springer, Heidelberg (1994). https://doi.org/10.1007/3-540-48285-7_33
Nyberg, K.: Differentially uniform mappings for cryptography. In: Helleseth, T. (ed.) EUROCRYPT 1993. LNCS, vol. 765, pp. 55–64. Springer, Heidelberg (1994). https://doi.org/10.1007/3-540-48285-7_6
Trachtenberg, H.M.: On the Cross-Correlation Functions of Maximal Linear Sequences, Ph.D. dissertation, University of Southern California, Los Angeles (1970)
Acknowledgment
This research was supported by the Trond Mohn foundation (TMS).
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2021 Springer Nature Switzerland AG
About this paper
Cite this paper
Davidova, D., Kaleyski, N. (2021). Generalization of a Class of APN Binomials to Gold-Like Functions. In: Bajard, J.C., TopuzoÄŸlu, A. (eds) Arithmetic of Finite Fields. WAIFI 2020. Lecture Notes in Computer Science(), vol 12542. Springer, Cham. https://doi.org/10.1007/978-3-030-68869-1_11
Download citation
DOI: https://doi.org/10.1007/978-3-030-68869-1_11
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-68868-4
Online ISBN: 978-3-030-68869-1
eBook Packages: Computer ScienceComputer Science (R0)