{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,16]],"date-time":"2025-10-16T00:58:04Z","timestamp":1760576284782,"version":"build-2065373602"},"reference-count":75,"publisher":"Springer Science and Business Media LLC","issue":"10","license":[{"start":{"date-parts":[[2025,7,25]],"date-time":"2025-07-25T00:00:00Z","timestamp":1753401600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,7,25]],"date-time":"2025-07-25T00:00:00Z","timestamp":1753401600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001659","name":"Deutsche Forschungsgemeinschaft","doi-asserted-by":"publisher","award":["509754807"],"award-info":[{"award-number":["509754807"]}],"id":[{"id":"10.13039\/501100001659","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2025,10]]},"DOI":"10.1007\/s10623-025-01698-6","type":"journal-article","created":{"date-parts":[[2025,7,25]],"date-time":"2025-07-25T11:21:26Z","timestamp":1753442486000},"page":"4627-4658","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Forking sums of permutations for highly secure and efficient PRFs"],"prefix":"10.1007","volume":"93","author":[{"given":"Avijit","family":"Dutta","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Eik","family":"List","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,7,25]]},"reference":[{"key":"1698_CR1","doi-asserted-by":"crossref","unstructured":"Aaraj N., Bellini E., Jejurikar R., Manzano M., Rohit R., Salazar E.: Farasha: a provable permutation-based parallelizable PRF. In: SAC. LNCS, vol. 13742, pp. 437\u2013458. Springer (2022).","DOI":"10.1007\/978-3-031-58411-4_20"},{"key":"1698_CR2","unstructured":"Andreeva E., Cogliati B., Lallemand V., Minier M., Purnal A., Roy A.: Masked Iterate-Fork-Iterate: a new design paradigm for tweakable expanding pseudorandom function. Cryptology ePrint Archive, Paper 2022\/1534 (2022)."},{"key":"1698_CR3","doi-asserted-by":"crossref","unstructured":"Andreeva E., Cogliati B., Lallemand V., Minier M., Purnal A., Roy A.: Masked iterate-fork-iterate: a new design paradigm for tweakable expanding pseudorandom function. In: P\u00f6pper C., Batina L. (eds.) ACNS II. LNCS, vol. 14584, pp. 433\u2013459. Springer (2024).","DOI":"10.1007\/978-3-031-54773-7_17"},{"key":"1698_CR4","unstructured":"Andreeva E., Lallemand V., Purnal A., Reyhanitabar R., Roy A., Viz\u00e1r D.: ForkAE v1 (2019). https:\/\/www.esat.kuleuven.be\/cosic\/forkae\/. Submission to the NIST Lightweight Cryptography Standardization."},{"key":"1698_CR5","doi-asserted-by":"crossref","unstructured":"Andreeva E., Lallemand V., Purnal A., Reyhanitabar R., Roy A., Viz\u00e1r D.: Forkcipher: a new primitive for authenticated encryption of very short messages. In: Galbraith S.D., Moriai S. (eds.) ASIACRYPT II. LNCS, vol. 11922, pp. 153\u2013182. Springer (2019).","DOI":"10.1007\/978-3-030-34621-8_6"},{"issue":"3","key":"1698_CR6","first-page":"1","volume":"2021","author":"E Andreeva","year":"2021","unstructured":"Andreeva E., Bhati A.S., Preneel B., Viz\u00e1r D.: 1, 2, 3, Fork: counter mode variants based on a generalized forkcipher. IACR Trans. Symmetric Cryptol. 2021(3), 1\u201335 (2021).","journal-title":"IACR Trans. Symmetric Cryptol."},{"key":"1698_CR7","doi-asserted-by":"crossref","unstructured":"Bariant A., Leurent G.: Truncated boomerang attacks and application to AES-based viphers. In: Hazay C., Stam M. (eds.) EUROCRYPT IV. LNCS, vol. 14007, pp. 3\u201335. Springer (2023).","DOI":"10.1007\/978-3-031-30634-1_1"},{"key":"1698_CR8","doi-asserted-by":"crossref","unstructured":"Bar-On A., Dunkelman O., Keller N., Ronen E., Shamir A.: Improved key recovery attacks on reduced-round AES with practical data and memory complexities. In: Shacham H., Boldyreva A. (eds.) CRYPTO II. LNCS, vol. 10992, pp. 185\u2013212. Springer (2018).","DOI":"10.1007\/978-3-319-96881-0_7"},{"key":"1698_CR9","doi-asserted-by":"crossref","unstructured":"Beierle C., Jean J., K\u00f6lbl S., Leander G., Moradi A., Peyrin T., Sasaki Y., Sasdrich P., Sim S.M.: The SKINNY family of block ciphers and its low-latency variant MANTIS. In: Robshaw M., Katz J. (eds.) CRYPTO II. LNCS, vol. 9815, pp. 123\u2013153. Springer (2016).","DOI":"10.1007\/978-3-662-53008-5_5"},{"key":"1698_CR10","unstructured":"Bellare M., Impagliazzo R.: A tool for obtaining tighter security analyses of pseudorandom function based constructions, with applications to PRP to PRF conversion. Cryptology ePrint Archive, Report 1999\/024 (1999). http:\/\/eprint.iacr.org\/1999\/024."},{"key":"1698_CR11","doi-asserted-by":"crossref","unstructured":"Bellare M., Krovetz T., Rogaway P.: Luby\u2013Rackoff backwards: increasing security by making block ciphers non-invertible. In: Nyberg K. (ed.) EUROCRYPT. LNCS, vol. 1403, pp. 266\u2013280. Springer, Heidelberg (1998).","DOI":"10.1007\/BFb0054132"},{"key":"1698_CR12","doi-asserted-by":"crossref","unstructured":"Bertoni G., Daemen J., Peeters M., Van\u00a0Assche G., Van\u00a0Keer R., Viguier B.: KangarooTwelve: fast hashing based on keccak-$$p$$. In: ACNS. LNCS, vol. 10892, pp. 400\u2013418. Springer (2018).","DOI":"10.1007\/978-3-319-93387-0_21"},{"issue":"4","key":"1698_CR13","first-page":"1","volume":"2017","author":"G Bertoni","year":"2017","unstructured":"Bertoni G., Daemen J., Hoffert S., Peeters M., Van Assche G., Van Keer R.: Farfalle: parallel permutation-based cryptography. IACR Trans. Symmetric Cryptol. 2017(4), 1\u201338 (2017).","journal-title":"IACR Trans. Symmetric Cryptol."},{"key":"1698_CR14","series-title":"LNCS","first-page":"667","volume-title":"ASIACRYPT II","author":"R Bhaumik","year":"2017","unstructured":"Bhaumik R., Datta N., Dutta A., Mouha N., Nandi M.: The iterated random function problem. In: Takagi T., Peyrin T. (eds.) ASIACRYPT II, vol. 10625, pp. 667\u2013697. LNCS. Springer, Cham (2017)."},{"key":"1698_CR15","doi-asserted-by":"crossref","unstructured":"Biryukov A., Wagner D.A.: Slide attacks. In: Knudsen L.R. (ed.) FSE. LNCS, vol. 1636, pp. 245\u2013259. Springer (1999).","DOI":"10.1007\/3-540-48519-8_18"},{"issue":"1","key":"1698_CR16","doi-asserted-by":"publisher","first-page":"170","DOI":"10.46586\/tosc.v2019.i1.170-191","volume":"2019","author":"C Boura","year":"2019","unstructured":"Boura C., Canteaut A., Coggia D.: A general proof framework for recent AES distinguishers. IACR Trans. Symmetric Cryptol. 2019(1), 170\u2013191 (2019).","journal-title":"IACR Trans. Symmetric Cryptol."},{"key":"1698_CR17","doi-asserted-by":"crossref","unstructured":"Chakraborti A., Datta N., Jha A., Mancillas-L\u00f3pez C., Nandi M., Sasaki Y.: Elastic-Tweak: a framework for short tweak tweakable block cipher. In: Adhikari A., K\u00fcsters R., Preneel B. (eds.) INDOCRYPT. LNCS, vol. 13143, pp. 114\u2013137. Springer (2021).","DOI":"10.1007\/978-3-030-92518-5_6"},{"key":"1698_CR18","volume-title":"ESTATE Authenticated Encryption Mode: Hardware Benchmarking and Security Analysis","author":"A Chakraborti","year":"2019","unstructured":"Chakraborti A., Datta N., Jha A., Lopez C.M., Nandi M., Sasaki Y.: ESTATE Authenticated Encryption Mode: Hardware Benchmarking and Security Analysis. National Institute of Standards and Technology (NIST), Gaithersburg (2019)."},{"issue":"S1","key":"1698_CR19","doi-asserted-by":"publisher","first-page":"350","DOI":"10.46586\/tosc.v2020.iS1.350-389","volume":"2020","author":"A Chakraborti","year":"2020","unstructured":"Chakraborti A., Datta N., Jha A., Mancillas-L\u00f3pez C., Nandi M., Sasaki Y.: ESTATE: a lightweight and low energy authenticated encryption mode. IACR Trans. Symmetric Cryptol. 2020(S1), 350\u2013389 (2020).","journal-title":"IACR Trans. Symmetric Cryptol."},{"key":"1698_CR20","doi-asserted-by":"crossref","unstructured":"Chen Y.L., Mennink B., Preneel B: Categorization of faulty nonce misuse resistant message authentication. In: Tibouchi M., Wang H. (eds.) ASIACRYPT III. LNCS, vol. 13092, pp. 520\u2013550. Springer (2021).","DOI":"10.1007\/978-3-030-92078-4_18"},{"issue":"3","key":"1698_CR21","first-page":"327","volume":"2020","author":"B Christina","year":"2020","unstructured":"Christina B., Daniel C.: Efficient MILP modelings for sboxes and linear layers of SPN ciphers. IACR Trans. Symmetric Cryptol. 2020(3), 327\u2013361 (2020).","journal-title":"IACR Trans. Symmetric Cryptol."},{"key":"1698_CR22","doi-asserted-by":"crossref","unstructured":"Cogliati B., Dutta A., Nandi M., Patarin J., Saha A.: Proof of mirror theory for a wide range of $$\\xi _{\\text{max}}$$. In: Hazay C., Stam M. (eds.) EUROCRYPT IV. LNCS, vol. 14007, pp. 470\u2013501. Springer (2023).","DOI":"10.1007\/978-3-031-30634-1_16"},{"key":"1698_CR23","unstructured":"Cogliati B., Patarin J.: Mirror theory: a simple proof of the $$P_i + P_j$$ theorem with $$\\xi _{max}=2$$. IACR Cryptol. ePrint Archive, 734 (2020)."},{"key":"1698_CR24","doi-asserted-by":"crossref","unstructured":"Cogliati B., Seurin Y.: EWCDM: an efficient, beyond-birthday secure, nonce-misuse resistant MAC. In: Robshaw M., Katz J. (eds.) CRYPTO I. LNCS, vol. 9814, pp. 121\u2013149. Springer (2016).","DOI":"10.1007\/978-3-662-53018-4_5"},{"key":"1698_CR25","unstructured":"Crowley P., Huckleberry N., Biggers E.: Length-preserving encryption with HCTR2. IACR Cryptol. ePrint Arch., 1441 (2021)."},{"key":"1698_CR26","unstructured":"Crowley P.: Length-Preserving Encryption with HCTR2. Technical report, Google LLC, 3 October 2023. Presentation at The Third NIST Workshop on Block Cipher Modes of Operation (2023)."},{"key":"1698_CR27","doi-asserted-by":"crossref","unstructured":"Dai W., Hoang V.T., Tessaro S: Information-theoretic indistinguishability via the chi-squared method. In: Katz J., Shacham H. (eds.) CRYPTO Part III. LNCS, vol. 10403, pp. 497\u2013523. Springer (2017). Full version at http:\/\/eprint.iacr.org\/2017\/537, version 20170616:190106.","DOI":"10.1007\/978-3-319-63697-9_17"},{"key":"1698_CR28","doi-asserted-by":"crossref","unstructured":"Demirci H., Sel\u00e7uk A.A: A meet-in-the-middle attack on 8-round AES. In: Nyberg K. (ed.) FSE. LNCS, vol. 5086, pp. 116\u2013126. Springer (2008).","DOI":"10.1007\/978-3-540-71039-4_7"},{"key":"1698_CR29","doi-asserted-by":"crossref","unstructured":"Derbez P., Fouque P.-A.: Exhausting Demirci\u2013Sel\u00e7uk meet-in-the-middle attacks against reduced-round AES. In: Moriai,S. (ed.) FSE. LNCS, vol. 8424, pp. 541\u2013560. Springer (2013).","DOI":"10.1007\/978-3-662-43933-3_28"},{"issue":"2","key":"1698_CR30","doi-asserted-by":"publisher","first-page":"161","DOI":"10.46586\/tosc.v2018.i2.161-191","volume":"2018","author":"P Derbez","year":"2018","unstructured":"Derbez P., Iwata T., Sun L., Sun S., Todo Y., Wang H., Wang M.: Cryptanalysis of AES-PRF and its dual. IACR Trans. Symmetric Cryptol. 2018(2), 161\u2013191 (2018).","journal-title":"IACR Trans. Symmetric Cryptol."},{"issue":"3","key":"1698_CR31","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1109\/PROC.1979.11256","volume":"67","author":"W Diffie","year":"1979","unstructured":"Diffie W., Hellman M.E.: Privacy and authentication: an introduction to cryptography. Proc. IEEE 67(3), 397\u2013427 (1979).","journal-title":"Proc. IEEE"},{"key":"1698_CR32","doi-asserted-by":"crossref","unstructured":"Dobraunig C., Matusiewicz K., Mennink B., Tereschenko A.: Efficient instances of docked double decker with AES, and application to authenticated encryption. In: Fehr S., Fouque P.-A. (eds.) EUROCRYPT I. LNCS, vol. 15601, pp. 62\u201392. Springer (2025).","DOI":"10.1007\/978-3-031-91107-1_3"},{"key":"1698_CR33","doi-asserted-by":"crossref","unstructured":"Dutta A., List E. Proving the security of the extended summation-truncation hybrid. In: Mukhopadhyay S., Stanica P. (eds.) INDOCRYPT I. LNCS, vol. 15495, pp. 165\u2013187. Springer (2024).","DOI":"10.1007\/978-3-031-80308-6_8"},{"issue":"9","key":"1698_CR34","doi-asserted-by":"publisher","first-page":"6218","DOI":"10.1109\/TIT.2022.3171178","volume":"68","author":"A Dutta","year":"2022","unstructured":"Dutta A., Nandi M., Saha A.: Proof of mirror theory for $$\\xi  _{\\text{ max }}$$ = 2. IEEE Trans. Inf. Theory 68(9), 6218\u20136232 (2022).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1698_CR35","unstructured":"Dworkin M.J.: NIST special publication 800-38A 2001 edition. NIST Spec. Publ., vol. 800, p. 38A (2001)."},{"issue":"5","key":"1698_CR36","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1038\/scientificamerican0573-15","volume":"228","author":"H Feistel","year":"1973","unstructured":"Feistel H.: Cryptography and computer privacy. Sci. Am. 228(5), 15\u201323 (1973).","journal-title":"Sci. Am."},{"key":"1698_CR37","doi-asserted-by":"publisher","first-page":"214","DOI":"10.1016\/j.dam.2021.01.029","volume":"294","author":"S Gilboa","year":"2021","unstructured":"Gilboa S., Gueron S.: The advantage of truncated permutations. Discret. Appl. Math. 294, 214\u2013223 (2021).","journal-title":"Discret. Appl. Math."},{"key":"1698_CR38","doi-asserted-by":"crossref","unstructured":"Granger R., Jovanovic P., Mennink B., Neves S.: Improved masking for tweakable blockciphers with applications to authenticated encryption. In: EUROCRYPT, pp. 263\u2013293. Springer (2016).","DOI":"10.1007\/978-3-662-49890-3_11"},{"key":"1698_CR39","doi-asserted-by":"crossref","unstructured":"Grassi L., Rechberger C., R\u00f8njom S.: A new structural-differential property of 5-round AES. In: Coron J.-S., Nielsen J.B. (eds.) EUROCRYPT II. LNCS, vol. 10211, pp. 289\u2013317 (2017).","DOI":"10.1007\/978-3-319-56614-6_10"},{"key":"1698_CR40","doi-asserted-by":"crossref","unstructured":"Grassi L.: MixColumns properties and attacks on (round-reduced) AES with a single secret s-box. In: Smart N.P. (ed.) CT-RSA. LNCS, vol. 10808, pp. 243\u2013263. Springer (2018).","DOI":"10.1007\/978-3-319-76953-0_13"},{"issue":"2","key":"1698_CR41","doi-asserted-by":"publisher","first-page":"133","DOI":"10.46586\/tosc.v2018.i2.133-160","volume":"2018","author":"L Grassi","year":"2018","unstructured":"Grassi L.: Mixture differential cryptanalysis: a new approach to distinguishers and attacks on round-reduced AES. IACR Trans. Symmetric Cryptol. 2018(2), 133\u2013160 (2018).","journal-title":"IACR Trans. Symmetric Cryptol."},{"key":"1698_CR42","unstructured":"Gueron S., Langley A., Lindell Y: AES-GCM-SIV: specification and analysis. Cryptology ePrint Archive. Report 2017\/168 (2017)."},{"key":"1698_CR43","doi-asserted-by":"crossref","unstructured":"Gueron S., Mouha N.: Simpira v2: a family of efficient permutations using the AES round function. In: ASIACRYPT, pp. 95\u2013125. Springer (2016).","DOI":"10.1007\/978-3-662-53887-6_4"},{"key":"1698_CR44","doi-asserted-by":"crossref","unstructured":"Gunsing A., Mennink B.: The summation-truncation hybrid: reusing discarded bits for free. In: Micciancio D., Ristenpart T. (eds.) CRYPTO I. LNCS, vol. 12170, pp. 187\u2013217. Springer (2020).","DOI":"10.1007\/978-3-030-56784-2_7"},{"key":"1698_CR45","doi-asserted-by":"crossref","unstructured":"Hall C., Wagner D.A., Kelsey J., Schneier B.: Building PRFs from PRPs. In: CRYPTO 1998, Proceedings, pp. 370\u2013389 (1998).","DOI":"10.1007\/BFb0055742"},{"key":"1698_CR46","doi-asserted-by":"crossref","unstructured":"Iwata T., Minematsu K., Peyrin T., Seurin Y: ZMAC: a fast tweakable block cipher mode for highly secure message authentication. In: Katz J., Shacham H. (eds.) CRYPTO, Part III. LNCS, vol. 10403, pp. 34\u201365. Springer (2017).","DOI":"10.1007\/978-3-319-63697-9_2"},{"key":"1698_CR47","doi-asserted-by":"crossref","unstructured":"Iwata T.: New blockcipher modes of operation with beyond the birthday bound security. In: Robshaw M.J.B. (ed.) FSE. LNCS, vol. 4047, pp. 310\u2013327. Springer (2006).","DOI":"10.1007\/11799313_20"},{"key":"1698_CR48","first-page":"1087","volume":"2016","author":"T Iwata","year":"2016","unstructured":"Iwata T., Mennink B., Viz\u00e1r D.: CENC is optimally secure. IACR Cryptol. ePrint Arch. 2016, 1087 (2016).","journal-title":"IACR Cryptol. ePrint Arch."},{"issue":"1","key":"1698_CR49","doi-asserted-by":"publisher","first-page":"134","DOI":"10.46586\/tosc.v2016.i1.134-157","volume":"2016","author":"T Iwata","year":"2016","unstructured":"Iwata T., Minematsu K.: Stronger security variants of GCM-SIV. IACR Trans. Symmetric Cryptol. 2016(1), 134\u2013157 (2016).","journal-title":"IACR Trans. Symmetric Cryptol."},{"key":"1698_CR50","doi-asserted-by":"crossref","unstructured":"Jean J., Nikolic I., Peyrin T: Tweaks and keys for block ciphers: the TWEAKEY framework. In: Sarkar P., Iwata T. (eds.) ASIACRYPT II. LNCS, vol. 8874, pp. 274\u2013288. Springer (2014).","DOI":"10.1007\/978-3-662-45608-8_15"},{"key":"1698_CR51","unstructured":"Jean J., Nikoli\u0107 I., Peyrin T.: Kiasu v1.1. http:\/\/competitions.cr.yp.to\/caesar-submissions.html, 16 March 2014. First-round submission to the CAESAR competition."},{"key":"1698_CR52","doi-asserted-by":"crossref","unstructured":"Jean J., Nikolic I.: Internal differential boomerangs: practical analysis of the round-reduce keccak-$$f$$ permutation. In: Leander G. (ed.) FSE. LNCS, vol. 9054, pp. 537\u2013556. Springer (2015).","DOI":"10.1007\/978-3-662-48116-5_26"},{"key":"1698_CR53","doi-asserted-by":"crossref","unstructured":"Khovratovich D., Nikolic I.: Rotational cryptanalysis of ARX. In: Hong S., Iwata T. (eds.) FSE. LNCS, vol. 6147, pp. 333\u2013346. Springer (2010).","DOI":"10.1007\/978-3-642-13858-4_19"},{"issue":"1","key":"1698_CR54","doi-asserted-by":"publisher","first-page":"474","DOI":"10.46586\/tosc.v2017.i1.474-505","volume":"2017","author":"T Kranz","year":"2017","unstructured":"Kranz T., Leander G., Wiemer F.: Linear cryptanalysis: key schedules and tweakable block ciphers. IACR Trans. Symmetric Cryptol. 2017(1), 474\u2013505 (2017).","journal-title":"IACR Trans. Symmetric Cryptol."},{"key":"1698_CR55","unstructured":"Lefevre C., Beltr\u00e1n M.M.: MacaKey: full-state keyed sponge meets the summation-truncation hybrid. Cryptol. ePrint Archive, Paper 2025\/893 (2025)."},{"key":"1698_CR56","doi-asserted-by":"crossref","unstructured":"Lefranc D., Painchault P., Rouat V., Mayer E.: A generic method to design modes of operation beyond the birthday bound. In: Adams C.M., Miri A., Wiener M.J. (eds.) SAC. LNCS, vol. 4876, pp. 328\u2013343. Springer (2007).","DOI":"10.1007\/978-3-540-77360-3_21"},{"issue":"12","key":"1698_CR57","doi-asserted-by":"publisher","first-page":"1761","DOI":"10.1093\/comjnl\/bxz059","volume":"62","author":"Y Liu","year":"2019","unstructured":"Liu Y., Shi Y., Dawu G., Zeng Z., Zhao F., Li W., Liu Z., Bao Y.: Improved meet-in-the-middle attacks on reduced-round Kiasu-BC and Joltik-BC. Comput. J. 62(12), 1761\u20131776 (2019).","journal-title":"Comput. J."},{"key":"1698_CR58","doi-asserted-by":"crossref","unstructured":"Mennink B., Neves S.: Encrypted Davies\u2013Meyer and its dual: towards optimal security using mirror theory. In: Katz J., Shacham H. (eds.) CRYPTO III. LNCS, vol. 10403, pp. 556\u2013583. Springer (2017).","DOI":"10.1007\/978-3-319-63697-9_19"},{"key":"1698_CR59","doi-asserted-by":"crossref","unstructured":"Mennink B.: The relation between CENC and NEMO. In: Camenisch J., Papadimitratos P. (eds.) CANS. LNCS, vol. 11124, pp. 177\u2013189. Springer (2018).","DOI":"10.1007\/978-3-030-00434-7_9"},{"issue":"3","key":"1698_CR60","doi-asserted-by":"publisher","first-page":"228","DOI":"10.46586\/tosc.v2017.i3.228-252","volume":"2017","author":"B Mennink","year":"2017","unstructured":"Mennink B., Neves S.: Optimal PRFs from blockcipher designs. IACR Trans. Symmetric Cryptol. 2017(3), 228\u2013252 (2017).","journal-title":"IACR Trans. Symmetric Cryptol."},{"key":"1698_CR61","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-49530-9","volume-title":"Feistel Ciphers\u2014Security Proofs and Cryptanalysis","author":"V Nachef","year":"2017","unstructured":"Nachef V., Patarin J., Volte E.: Feistel Ciphers\u2014Security Proofs and Cryptanalysis. Springer, Cham (2017)."},{"key":"1698_CR62","doi-asserted-by":"crossref","unstructured":"Patarin J: The \u201ccoefficients H\u201d technique. In: Avanzi R.M., Keliher L., Sica F. (eds.) SAC. LNCS, vol. 5381, pp. 328\u2013345. Springer (2008).","DOI":"10.1007\/978-3-642-04159-4_21"},{"key":"1698_CR63","unstructured":"Patarin J.: Introduction to mirror theory: analysis of systems of linear equalities and linear non equalities for cryptography. IACR Cryptol. ePrint Arch. 2010, 287 (2010)."},{"key":"1698_CR64","doi-asserted-by":"crossref","unstructured":"Patarin J.: On linear systems of equations with distinct variables and small block size. In: Won D., Kim S. (eds.) ICISC. LNCS, vol. 3935, pp. 299\u2013321. Springer (2005).","DOI":"10.1007\/11734727_25"},{"key":"1698_CR65","doi-asserted-by":"crossref","unstructured":"Peyrin T., Seurin Y.: Counter-in-tweak: authenticated encryption modes for tweakable block ciphers. In: Robshaw M., Katz J. (eds.) CRYPTO I. LNCS, vol. 9814, pp. 33\u201363. Springer (2016).","DOI":"10.1007\/978-3-662-53018-4_2"},{"key":"1698_CR66","doi-asserted-by":"crossref","unstructured":"Peyrin T.: Improved differential attacks for ECHO and gr\u00f8stl. In: Rabin T. (ed.) CRYPTO. LNCS, vol. 6223, pp. 370\u2013392. Springer (2010).","DOI":"10.1007\/978-3-642-14623-7_20"},{"key":"1698_CR67","first-page":"1","volume":"1321","author":"RL Rivest","year":"1992","unstructured":"Rivest R.L.: The MD5 message-digest algorithm. RFC 1321, 1\u201321 (1992).","journal-title":"RFC"},{"key":"1698_CR68","doi-asserted-by":"crossref","unstructured":"Rivest R.L: The MD4 message digest algorithm. In: Menezes A., Vanstone, S.A. (eds.) CRYPTO. LNCS, vol. 537, pp. 303\u2013311. Springer, Heidelberg (1990).","DOI":"10.1007\/3-540-38424-3_22"},{"issue":"4","key":"1698_CR69","doi-asserted-by":"publisher","first-page":"656","DOI":"10.1002\/j.1538-7305.1949.tb00928.x","volume":"28","author":"CE Shannon","year":"1949","unstructured":"Shannon C.E.: Communication theory of secrecy systems. Bell Syst. Tech. J. 28(4), 656\u2013715 (1949).","journal-title":"Bell Syst. Tech. J."},{"key":"1698_CR70","doi-asserted-by":"crossref","unstructured":"Shimizu A., Miyaguchi S.: Fast data encipherment algorithm FEAL. In: Chaum D., Price W.L. (eds.) EUROCRYPT. LNCS, vol. 304, pp. 267\u2013278. Springer, Berlin (1987).","DOI":"10.1007\/3-540-39118-5_24"},{"issue":"7","key":"1698_CR71","doi-asserted-by":"publisher","first-page":"4838","DOI":"10.1109\/TIT.2021.3058377","volume":"67","author":"B Sun","year":"2021","unstructured":"Sun B.: Provable security evaluation of block ciphers against demirci-sel\u00e7uk\u2019s meet-in-the-middle attack. IEEE Trans. Inf. Theory 67(7), 4838\u20134844 (2021).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1698_CR72","doi-asserted-by":"crossref","unstructured":"Todo Y.: Structural evaluation by generalized integral property. In: Oswald E., Fischlin M. (eds.) EUROCRYPT I. LNCS, vol. 9056, pp. 287\u2013314. Springer (2015).","DOI":"10.1007\/978-3-662-46800-5_12"},{"key":"1698_CR73","doi-asserted-by":"crossref","unstructured":"Tolba M., Abdelkhalek A., Youssef A.M.: A meet in the middle attack on reduced round Kiasu-BC. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 99(10), 1888\u20131890 (2016).","DOI":"10.1587\/transfun.E99.A.1888"},{"key":"1698_CR74","doi-asserted-by":"crossref","unstructured":"Wheeler D.J., Needham R.M.: TEA, a tiny encryption algorithm. In: Preneel B. (ed.) FSE. LNCS, vol. 1008, pp. 363\u2013366. Springer, Heidelberg (1994).","DOI":"10.1007\/3-540-60590-8_29"},{"key":"1698_CR75","doi-asserted-by":"crossref","unstructured":"Yang Q., Song L., Sun S., Shi D., Lei H.: New properties of the double boomerang connectivity table. IACR Trans. Symmetric Cryptol. 2022(4), 208\u2013242 (2022).","DOI":"10.46586\/tosc.v2022.i4.208-242"}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-025-01698-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10623-025-01698-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-025-01698-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,15]],"date-time":"2025-10-15T18:03:43Z","timestamp":1760551423000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10623-025-01698-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,7,25]]},"references-count":75,"journal-issue":{"issue":"10","published-print":{"date-parts":[[2025,10]]}},"alternative-id":["1698"],"URL":"https:\/\/doi.org\/10.1007\/s10623-025-01698-6","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"type":"print","value":"0925-1022"},{"type":"electronic","value":"1573-7586"}],"subject":[],"published":{"date-parts":[[2025,7,25]]},"assertion":[{"value":"25 November 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 June 2025","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 July 2025","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 July 2025","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that there is no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}