{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,6,4]],"date-time":"2024-06-04T00:12:05Z","timestamp":1717459925407},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2023,7,10]],"date-time":"2023-07-10T00:00:00Z","timestamp":1688947200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2023,7,10]],"date-time":"2023-07-10T00:00:00Z","timestamp":1688947200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"name":"University of Bergen"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Cryptogr. Commun."],"published-print":{"date-parts":[[2023,11]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>We consider an infinite family of exponents <jats:italic>e<\/jats:italic>(<jats:italic>l<\/jats:italic>,\u00a0<jats:italic>k<\/jats:italic>) with two parameters, <jats:italic>l<\/jats:italic> and <jats:italic>k<\/jats:italic>, and derive sufficient conditions for <jats:italic>e<\/jats:italic>(<jats:italic>l<\/jats:italic>,\u00a0<jats:italic>k<\/jats:italic>) to be 0-APN over <jats:inline-formula><jats:alternatives><jats:tex-math>$${\\mathbb F}_{2^n}$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:msub>\n                    <mml:mi>F<\/mml:mi>\n                    <mml:msup>\n                      <mml:mn>2<\/mml:mn>\n                      <mml:mi>n<\/mml:mi>\n                    <\/mml:msup>\n                  <\/mml:msub>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula>. These conditions allow us to generate, for each choice of <jats:italic>l<\/jats:italic> and <jats:italic>k<\/jats:italic>, an infinite list of dimensions <jats:italic>n<\/jats:italic> where <jats:inline-formula><jats:alternatives><jats:tex-math>$$x^{e(l,k)}$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:msup>\n                    <mml:mi>x<\/mml:mi>\n                    <mml:mrow>\n                      <mml:mi>e<\/mml:mi>\n                      <mml:mo>(<\/mml:mo>\n                      <mml:mi>l<\/mml:mi>\n                      <mml:mo>,<\/mml:mo>\n                      <mml:mi>k<\/mml:mi>\n                      <mml:mo>)<\/mml:mo>\n                    <\/mml:mrow>\n                  <\/mml:msup>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula> is 0-APN much more efficiently than in general. We observe that the Gold and Inverse exponents, as well as the inverses of the Gold exponents can be expressed in the form <jats:italic>e<\/jats:italic>(<jats:italic>l<\/jats:italic>,\u00a0<jats:italic>k<\/jats:italic>) for suitable <jats:italic>l<\/jats:italic> and <jats:italic>k<\/jats:italic>. We characterize all cases in which <jats:italic>e<\/jats:italic>(<jats:italic>l<\/jats:italic>,\u00a0<jats:italic>k<\/jats:italic>) can be cyclotomic equivalent to a representative from the Gold, Kasami, Welch, Niho, and Inverse families of exponents. We characterize when <jats:italic>e<\/jats:italic>(<jats:italic>l<\/jats:italic>,\u00a0<jats:italic>k<\/jats:italic>) can lie in the same cyclotomic coset as the Dobbertin exponent (without considering inverses) and provide computational data showing that the Dobbertin inverse is never equivalent to <jats:italic>e<\/jats:italic>(<jats:italic>l<\/jats:italic>,\u00a0<jats:italic>k<\/jats:italic>). We computationally test the APN-ness of <jats:italic>e<\/jats:italic>(<jats:italic>l<\/jats:italic>,\u00a0<jats:italic>k<\/jats:italic>) for small values of <jats:italic>l<\/jats:italic> and <jats:italic>k<\/jats:italic> over <jats:inline-formula><jats:alternatives><jats:tex-math>$${\\mathbb F}_{2^n}$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:msub>\n                    <mml:mi>F<\/mml:mi>\n                    <mml:msup>\n                      <mml:mn>2<\/mml:mn>\n                      <mml:mi>n<\/mml:mi>\n                    <\/mml:msup>\n                  <\/mml:msub>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula> for <jats:inline-formula><jats:alternatives><jats:tex-math>$$n \\le 100$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:mrow>\n                    <mml:mi>n<\/mml:mi>\n                    <mml:mo>\u2264<\/mml:mo>\n                    <mml:mn>100<\/mml:mn>\n                  <\/mml:mrow>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula>, and sketch the limits to which such tests can be performed using currently available technology. We conclude that there are no APN monomials among the tested functions, outside of the known classes.<\/jats:p>","DOI":"10.1007\/s12095-023-00651-5","type":"journal-article","created":{"date-parts":[[2023,7,10]],"date-time":"2023-07-10T12:05:21Z","timestamp":1688990721000},"page":"1139-1169","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["An infinite family of 0-APN monomials with two parameters"],"prefix":"10.1007","volume":"15","author":[{"given":"Nikolay","family":"Kaleyski","sequence":"first","affiliation":[]},{"given":"Kjetil","family":"Nesheim","sequence":"additional","affiliation":[]},{"given":"Pantelimon","family":"St\u0103nic\u0103","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,7,10]]},"reference":[{"issue":"2","key":"651_CR1","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1023\/A:1008344232130","volume":"15","author":"C Carlet","year":"1998","unstructured":"Carlet, C., Charpin, P., Zinoviev, V.A.: Codes, bent functions and permutations suitable for DES-like cryptosystems. Des. Codes Crypt. 15(2), 125\u2013156 (1998)","journal-title":"Des. Codes Crypt."},{"issue":"2","key":"651_CR2","doi-asserted-by":"publisher","first-page":"587","DOI":"10.1007\/s10623-014-9955-3","volume":"73","author":"Y Yu","year":"2014","unstructured":"Yu, Y., Wang, M., Li, Y.: A matrix approach for constructing quadratic APN functions. Des. Codes Crypt. 73(2), 587\u2013600 (2014)","journal-title":"Des. Codes Crypt."},{"issue":"1","key":"651_CR3","doi-asserted-by":"publisher","first-page":"670","DOI":"10.1109\/TIT.2021.3120698","volume":"68","author":"C Beierle","year":"2022","unstructured":"Beierle, C., Leander, G.: New instances of quadratic APN functions. IEEE Trans. Inf. Theory 68(1), 670\u2013678 (2022)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"651_CR4","doi-asserted-by":"crossref","unstructured":"Carlet, C.: Boolean functions for cryptography and coding theory. Cambridge University Press (2021)","DOI":"10.1017\/9781108606806"},{"key":"651_CR5","doi-asserted-by":"crossref","unstructured":"Cusick, T.W., St\u0103nic\u0103, P.: Cryptographic Boolean Functions and Applications (Ed. 2). Academic Press, San Diego, CA (2017)","DOI":"10.1016\/B978-0-12-811129-1.00005-5"},{"key":"651_CR6","doi-asserted-by":"publisher","first-page":"527","DOI":"10.1007\/s12095-019-00372-8","volume":"12","author":"L Budaghyan","year":"2020","unstructured":"Budaghyan, L., Kaleyski, N.S., Kwon, S., Riera, C., St\u0103nic\u0103, P.: Partially APN Boolean functions and classes of functions that are not APN infinitely often. Cryptogr. Commun. 12, 527\u2013545 (2020)","journal-title":"Cryptogr. Commun."},{"key":"651_CR7","doi-asserted-by":"crossref","unstructured":"Dobbertin, H.: Almost perfect nonlinear power functions on $$GF(2^n)$$: A new case for $$n$$ divisible by 5. International Conference on Finite Fields and Applications, pp. 113\u2013121. (2001)","DOI":"10.1007\/978-3-642-56755-1_11"},{"key":"651_CR8","doi-asserted-by":"publisher","first-page":"1159","DOI":"10.1007\/s10623-020-00739-6","volume":"88","author":"L Budaghyan","year":"2020","unstructured":"Budaghyan, L., Kaleyski, N., Riera, C., St\u0103nic\u0103, P.: Partially APN functions with APN-like polynomial representations. Des. Codes Crypt. 88, 1159\u20131177 (2020)","journal-title":"Des. Codes Crypt."},{"issue":"3\u20134","key":"651_CR9","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1006\/jsco.1996.0125","volume":"24","author":"W Bosma","year":"1997","unstructured":"Bosma, W., Cannon, J., Playoust, C.: The Magma algebra system I: The user language. J. Symb. Comput. 24(3\u20134), 235\u2013265 (1997)","journal-title":"J. Symb. Comput."},{"key":"651_CR10","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1007\/3-540-48285-7_6","volume-title":"Advances in Cryptology-EUROCRYPT \u201993 (Berlin, Heidelberg)","author":"K Nyberg","year":"1994","unstructured":"Nyberg, K.: Differentially uniform mappings for cryptography. In: Helleseth, T. (ed.) Advances in Cryptology-EUROCRYPT \u201993 (Berlin, Heidelberg), pp. 55\u201364. Springer, Berlin (1994)"},{"issue":"1","key":"651_CR11","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/BF00630563","volume":"4","author":"E Biham","year":"1991","unstructured":"Biham, E., Shamir, A.: Differential cryptanalysis of DES-like cryptosystems. J. Cryptol. 4(1), 3\u201372 (1991)","journal-title":"J. Cryptol."},{"issue":"3","key":"651_CR12","doi-asserted-by":"publisher","first-page":"665","DOI":"10.1007\/s10623-017-0350-8","volume":"86","author":"U Dempwolff","year":"2018","unstructured":"Dempwolff, U.: CCZ equivalence of power functions. Des. Codes Crypt. 86(3), 665\u2013692 (2018)","journal-title":"Des. Codes Crypt."},{"issue":"3","key":"651_CR13","doi-asserted-by":"publisher","first-page":"461","DOI":"10.1007\/s10801-011-0309-1","volume":"35","author":"S Yoshiara","year":"2012","unstructured":"Yoshiara, S.: Equivalences of quadratic APN functions. J. Algebraic Combin. 35(3), 461\u2013475 (2012)","journal-title":"J. Algebraic Combin."},{"issue":"1","key":"651_CR14","doi-asserted-by":"publisher","first-page":"154","DOI":"10.1109\/TIT.1968.1054106","volume":"14","author":"R Gold","year":"1968","unstructured":"Gold, R.: Maximal recursive sequences with 3-valued recursive cross-correlation functions. IEEE Trans. Inf. Theory 14(1), 154\u2013156 (1968)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"651_CR15","doi-asserted-by":"crossref","unstructured":"Janwa, H., Wilson, R.M.: Hyperplane sections of Fermat varieties in $$P^3$$ in char. 2 and some applications to cyclic codes. In: International Symposium on Applied Algebra, Algebraic Algorithms, and Error-Correcting Codes, pp. 180\u2013194. Springer (1993)","DOI":"10.1007\/3-540-56686-4_43"},{"issue":"4","key":"651_CR16","first-page":"369","volume":"18","author":"T Kasami","year":"1971","unstructured":"Kasami, T.: The weight enumerators for several classes of subcodes of the 2nd order binary Reed-Muller codes. Inf. Comput. 18(4), 369\u2013394 (1971)","journal-title":"Inf. Comput."},{"issue":"4","key":"651_CR17","doi-asserted-by":"publisher","first-page":"1271","DOI":"10.1109\/18.761283","volume":"45","author":"H Dobbertin","year":"1999","unstructured":"Dobbertin, H.: Almost perfect nonlinear power functions on $$GF(2^n)$$: the Welch case. IEEE Trans. Inf. Theory 45(4), 1271\u20131275 (1999)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"1","key":"651_CR18","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1006\/inco.1998.2764","volume":"151","author":"H Dobbertin","year":"1999","unstructured":"Dobbertin, H.: Almost perfect nonlinear power functions on $$GF(2^n)$$: the Niho case. Inf. Comput. 151(1), 57\u201372 (1999)","journal-title":"Inf. Comput."},{"key":"651_CR19","doi-asserted-by":"crossref","unstructured":"Beth, T.H., Ding, C.: On almost perfect nonlinear permutations. In: Workshop on the Theory and Application of Cryptographic Techniques, pp. 65\u201376. Springer (1993)","DOI":"10.1007\/3-540-48285-7_7"},{"issue":"2\u20133","key":"651_CR20","first-page":"170","volume":"4","author":"P Charpin","year":"2017","unstructured":"Charpin, P., Kyureghyan, G.M.: On sets determining the differential spectrum of mappings. Internat. J. Inf. Coding Theory 4(2\u20133), 170\u2013184 (2017)","journal-title":"Internat. J. Inf. Coding Theory"},{"key":"651_CR21","unstructured":"Budaghyan, L., Kaleyski, N.S., Kwon, S., Riera, C., St\u0103nic\u0103, P.: Partially APN Boolean functions. Proceedings of Sequences and Their Applications (SETA 2018), Hong Kong (2018)"},{"key":"#cr-split#-651_CR22.1","doi-asserted-by":"crossref","unstructured":"Cusick, T.W., Li, Y., St\u0103nic\u0103, P.: On a combinatorial conjecture. Integers 11, 185-203 (2011)","DOI":"10.1515\/integ.2011.017"},{"key":"#cr-split#-651_CR22.2","unstructured":"see also, Electronic Journal of Combinatorial Number Theory 11, Art. #17 (2011)"},{"key":"651_CR23","doi-asserted-by":"publisher","first-page":"234","DOI":"10.1016\/j.ffa.2013.10.002","volume":"25","author":"GM Kyureghyan","year":"2014","unstructured":"Kyureghyan, G.M., Suder, V.: On inversion in $$\\mathbb{Z} _{2^n-1}$$. Finite Fields Appl. 25, 234\u2013254 (2014)","journal-title":"Finite Fields Appl."},{"key":"651_CR24","doi-asserted-by":"publisher","first-page":"2597","DOI":"10.1007\/s10623-020-00804-0","volume":"88","author":"L K\u00f6lsch","year":"2020","unstructured":"K\u00f6lsch, L.: On the inverses of Kasami and Bracken-Leander exponents. Des. Codes Crypt. 88, 2597\u20132621 (2020)","journal-title":"Des. Codes Crypt."},{"key":"651_CR25","unstructured":"Kaleyski, N., Nesheim, K., St\u0103nic\u0103, P.: A doubly-infinite family of 0-APN monomials. Preprint at http:\/\/arxiv.org\/abs\/2211.13485. Accessed 24 Nov 2022"},{"issue":"5","key":"651_CR26","doi-asserted-by":"publisher","first-page":"3389","DOI":"10.1109\/TIT.2022.3147060","volume":"68","author":"L Budaghyan","year":"2022","unstructured":"Budaghyan, L., Calderini, M., Carlet, C., Davidova, D., Kaleyski, N.S.: On two fundamental problems on APN power functions. IEEE Trans. Inf. Theory 68(5), 3389\u20133403 (2022)","journal-title":"IEEE Trans. Inf. Theory"}],"container-title":["Cryptography and Communications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12095-023-00651-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s12095-023-00651-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12095-023-00651-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,3]],"date-time":"2024-06-03T16:23:51Z","timestamp":1717431831000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s12095-023-00651-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,7,10]]},"references-count":27,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2023,11]]}},"alternative-id":["651"],"URL":"https:\/\/doi.org\/10.1007\/s12095-023-00651-5","relation":{},"ISSN":["1936-2447","1936-2455"],"issn-type":[{"value":"1936-2447","type":"print"},{"value":"1936-2455","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,7,10]]},"assertion":[{"value":"19 October 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 May 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 July 2023","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}