{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,20]],"date-time":"2026-03-20T15:36:12Z","timestamp":1774020972251,"version":"3.50.1"},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2023,4,26]],"date-time":"2023-04-26T00:00:00Z","timestamp":1682467200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2023,4,26]],"date-time":"2023-04-26T00:00:00Z","timestamp":1682467200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"name":"Technology Innovation Institute"},{"DOI":"10.13039\/501100000781","name":"European Research Council","doi-asserted-by":"publisher","award":["ERC-2017-ADG Nr. 788980 ESCADA"],"award-info":[{"award-number":["ERC-2017-ADG Nr. 788980 ESCADA"]}],"id":[{"id":"10.13039\/501100000781","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100000781","name":"European Research Council","doi-asserted-by":"publisher","award":["ERC-2017-ADG Nr. 788980 ESCADA"],"award-info":[{"award-number":["ERC-2017-ADG Nr. 788980 ESCADA"]}],"id":[{"id":"10.13039\/501100000781","id-type":"DOI","asserted-by":"publisher"}]}],"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>To evaluate the security of a cryptographic primitive, investigating its resistance against differential and linear cryptanalysis is required. Many modern cryptographic primitives repeatedly apply similar round functions alternated with the addition of round keys or constants. A round function usually consists of a non-linear mapping and a number of linear mappings. The non-linear mapping <jats:inline-formula><jats:alternatives><jats:tex-math>$$\\chi$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:mi>\u03c7<\/mml:mi>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula> is used in different cryptographic primitives such as <jats:sc>Keccak<\/jats:sc> and <jats:sc>Subterranean<\/jats:sc>. An alternative version of <jats:inline-formula><jats:alternatives><jats:tex-math>$$\\chi$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:mi>\u03c7<\/mml:mi>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula> is used in <jats:sc>Ascon<\/jats:sc> and the non-linear layer of <jats:sc>Simon<\/jats:sc> has the same differential and linear properties of <jats:inline-formula><jats:alternatives><jats:tex-math>$$\\chi$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:mi>\u03c7<\/mml:mi>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula>. The mapping <jats:inline-formula><jats:alternatives><jats:tex-math>$$\\chi$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:mi>\u03c7<\/mml:mi>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula> can be applied to strings with different lengths. For instance, it can be parallelly applied to small-length strings as in <jats:sc>Keccak<\/jats:sc>, where it works on 5-bit strings, or it can be applied to big-length strings as in <jats:sc>Subterranean<\/jats:sc>, where it works on a string of length 257. Investigating the differential and linear properties of <jats:inline-formula><jats:alternatives><jats:tex-math>$$\\chi$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:mi>\u03c7<\/mml:mi>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula> working on alternative lengths of strings, provides useful information to designers to make a better choice for the non-linear layer. Some differential properties of <jats:inline-formula><jats:alternatives><jats:tex-math>$$\\chi$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:mi>\u03c7<\/mml:mi>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula> have been analyzed in\u00a0[8] and in this work we provide a revised presentation of them. We then extend this study and we analyze linear propagation properties of <jats:inline-formula><jats:alternatives><jats:tex-math>$$\\chi$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:mi>\u03c7<\/mml:mi>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula>. Thanks to these additional results, we extend the comparison between the application of parallel instances of <jats:inline-formula><jats:alternatives><jats:tex-math>$$\\chi$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:mi>\u03c7<\/mml:mi>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula> on small-length strings and the application of a single instance of <jats:inline-formula><jats:alternatives><jats:tex-math>$$\\chi$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:mi>\u03c7<\/mml:mi>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula> on a big-length string. We show how we can apply the results of this study also to the non-linear layers of <jats:sc>Ascon<\/jats:sc> and <jats:sc>Simon<\/jats:sc> thanks to their affine-equivalence with <jats:inline-formula><jats:alternatives><jats:tex-math>$$\\chi$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:mi>\u03c7<\/mml:mi>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula>.<\/jats:p>","DOI":"10.1007\/s12095-023-00639-1","type":"journal-article","created":{"date-parts":[[2023,4,26]],"date-time":"2023-04-26T12:05:09Z","timestamp":1682510709000},"page":"1087-1116","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Differential and Linear properties of vectorial boolean functions based on chi"],"prefix":"10.1007","volume":"15","author":[{"given":"Silvia","family":"Mella","sequence":"first","affiliation":[]},{"given":"Alireza","family":"Mehrdad","sequence":"additional","affiliation":[]},{"given":"Joan","family":"Daemen","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,4,26]]},"reference":[{"key":"639_CR1","unstructured":"Beaulieu, R., Shors, D., Smith, J., Treatman-Clark, S., Weeks, B., Wingers, L.: The SIMON and SPECK families of lightweight block ciphers. IACR Cryptol. ePrint Arch. p. 404 (2013)"},{"key":"639_CR2","unstructured":"Bertoni, G., Daemen, J., Peeters, M., Assche, G.V.: The keccak reference (2011)"},{"issue":"2","key":"639_CR3","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 Cryptogr. 15(2), 125\u2013156 (1998)","journal-title":"Des. Codes Cryptogr."},{"key":"639_CR4","doi-asserted-by":"crossref","unstructured":"Carlet, C., Crama, Y., Hammer, P.L.: Vectorial boolean functions for cryptography. In: Y.\u00a0Crama, P.L. Hammer (eds.) Boolean Models and Methods in Mathematics, Computer Science, and Engineering, pp. 398\u2013470. Cambridge University Press (2010)","DOI":"10.1017\/CBO9780511780448.012"},{"key":"639_CR5","unstructured":"Daemen, J.: Cipher and hash function design, strategies based on linear and differential cryptanalysis, PhD Thesis. K.U.Leuven (1995). http:\/\/jda.noekeon.org\/"},{"issue":"4","key":"639_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.46586\/tosc.v2018.i4.1-38","volume":"2018","author":"J Daemen","year":"2018","unstructured":"Daemen, J., Hoffert, S., Assche, G.V., Keer, R.V.: The design of Xoodoo and Xoofff. IACR Trans. Symmetric Cryptol. 2018(4), 1\u201338 (2018)","journal-title":"IACR Trans. Symmetric Cryptol."},{"issue":"S1","key":"639_CR7","doi-asserted-by":"publisher","first-page":"262","DOI":"10.46586\/tosc.v2020.iS1.262-294","volume":"2020","author":"J Daemen","year":"2020","unstructured":"Daemen, J., Massolino, P.M.C., Mehrdad, A., Rotella, Y.: The Subterranean 2.0 Cipher Suite. IACR Trans. Symmetric Cryptol. 2020(S1), 262\u2013294 (2020)","journal-title":"IACR Trans. Symmetric Cryptol."},{"key":"639_CR8","doi-asserted-by":"crossref","unstructured":"Daemen, J., Mehrdad, A., Mella, S.: Computing the distribution of differentials over the non-linear mapping $$\\chi$$. In: Security, Privacy, and Applied Cryptography Engineering - 11th International Conference, SPACE 2021, Kolkata, India, December 10-13, 2021, Proceedings, Lecture Notes in Computer Science, vol. 13162, pp. 3\u201321. Springer (2021)","DOI":"10.1007\/978-3-030-95085-9_1"},{"key":"639_CR9","unstructured":"Daemen, J., Mella, S., Assche, G.V.: Tighter trail bounds for xoodoo. Cryptology ePrint Archive, Paper 2022\/1088 (2022). https:\/\/eprint.iacr.org\/2022\/1088"},{"key":"639_CR10","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-04722-4","volume-title":"The Design of Rijndael: AES - The Advanced Encryption Standard","author":"J Daemen","year":"2002","unstructured":"Daemen, J., Rijmen, V.: The Design of Rijndael: AES - The Advanced Encryption Standard. Springer, Information Security and Cryptography (2002)"},{"key":"639_CR11","unstructured":"Dobraunig, C., Eichlseder, M., Mendel, F., Schl\u00e4ffer, M.: Ascon v1.2 (2014). https:\/\/ascon.iaik.tugraz.at\/"},{"issue":"3","key":"639_CR12","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/s00145-021-09398-9","volume":"34","author":"C Dobraunig","year":"2021","unstructured":"Dobraunig, C., Eichlseder, M., Mendel, F., Schl\u00e4ffer, M.: Ascon v1.2: Lightweight authenticated encryption and hashing. J. Cryptol. 34(3), 33 (2021)","journal-title":"J. Cryptol."},{"issue":"1","key":"639_CR13","doi-asserted-by":"publisher","first-page":"59","DOI":"10.3934\/amc.2009.3.59","volume":"3","author":"Y Edel","year":"2009","unstructured":"Edel, Y., Pott, A.: A new almost perfect nonlinear function which is not quadratic. Adv. Math. Commun. 3(1), 59\u201381 (2009)","journal-title":"Adv. Math. Commun."},{"issue":"4","key":"639_CR14","doi-asserted-by":"publisher","first-page":"145","DOI":"10.46586\/tosc.v2022.i4.145-178","volume":"2022","author":"SE Hirch","year":"2022","unstructured":"Hirch, S.E., Mella, S., Mehrdad, A., Daemen, J.: Improved differential and linear trail bounds for ASCON. IACR Trans. Symmetric Cryptol. 2022(4), 145\u2013178 (2022). https:\/\/doi.org\/10.46586\/tosc.v2022.i4.145-178","journal-title":"IACR Trans. Symmetric Cryptol."},{"issue":"2","key":"639_CR15","doi-asserted-by":"publisher","first-page":"253","DOI":"10.46586\/tosc.v2022.i2.253-288","volume":"2022","author":"A Mehrdad","year":"2022","unstructured":"Mehrdad, A., Mella, S., Grassi, L., Daemen, J.: Differential trail search in cryptographic primitives with big-circle chi: Application to subterranean. IACR Trans. Symmetric Cryptol. 2022(2), 253\u2013288 (2022)","journal-title":"IACR Trans. Symmetric Cryptol."},{"issue":"1","key":"639_CR16","doi-asserted-by":"publisher","first-page":"329","DOI":"10.46586\/tosc.v2017.i1.329-357","volume":"2017","author":"S Mella","year":"2017","unstructured":"Mella, S., Daemen, J., Van Assche, G.: New techniques for trail bounds and application to differential trails in Keccak. IACR Trans. Symmetric Cryptol. 2017(1), 329\u2013357 (2017)","journal-title":"IACR Trans. Symmetric Cryptol."},{"key":"639_CR17","unstructured":"Nyberg, K.: Differentially uniform mappings for cryptography. In: T.\u00a0Helleseth (ed.) Advances in Cryptology - EUROCRYPT \u201993, Workshop on the Theory and Application of Cryptographic Techniques, Lofthus, Norway, May 23-27, 1993, Proceedings, Lecture Notes in Computer Science, vol. 765, pp. 55\u201364. Springer (1993)"}],"container-title":["Cryptography and Communications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12095-023-00639-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s12095-023-00639-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12095-023-00639-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,3]],"date-time":"2024-06-03T16:24:42Z","timestamp":1717431882000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s12095-023-00639-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,4,26]]},"references-count":17,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2023,11]]}},"alternative-id":["639"],"URL":"https:\/\/doi.org\/10.1007\/s12095-023-00639-1","relation":{},"ISSN":["1936-2447","1936-2455"],"issn-type":[{"value":"1936-2447","type":"print"},{"value":"1936-2455","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,4,26]]},"assertion":[{"value":"20 October 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 March 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 April 2023","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}