{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T07:50:51Z","timestamp":1772265051043,"version":"3.50.1"},"reference-count":31,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2026,2,1]],"date-time":"2026-02-01T00:00:00Z","timestamp":1769904000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,2,1]],"date-time":"2026-02-01T00:00:00Z","timestamp":1769904000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2026,2]]},"DOI":"10.1007\/s10623-025-01779-6","type":"journal-article","created":{"date-parts":[[2026,2,15]],"date-time":"2026-02-15T06:11:16Z","timestamp":1771135876000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Two-key variant of the four-round cascading $$\\textsf{LRW1}$$"],"prefix":"10.1007","volume":"94","author":[{"given":"Shreya","family":"Dey","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Avijit","family":"Dutta","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kazuhiko","family":"Minematsu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2026,2,15]]},"reference":[{"key":"1779_CR1","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/3-540-45708-9_3","volume-title":"Advances in Cryptology\u2014CRYPTO 2002","author":"M Liskov","year":"2002","unstructured":"Liskov M., Rivest R.L., Wagner D.: Tweakable block ciphers. In: Yung M. (ed.) Advances in Cryptology\u2014CRYPTO 2002, pp. 31\u201346. Springer, Berlin (2002)."},{"issue":"3","key":"1779_CR2","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1145\/937527.937529","volume":"6","author":"P Rogaway","year":"2003","unstructured":"Rogaway P., Bellare M., Black J.: OCB: A block-cipher mode of operation for efficient authenticated encryption. ACM Trans. Inf. Syst. Secur. 6(3), 365\u2013403 (2003). https:\/\/doi.org\/10.1145\/937527.937529.","journal-title":"ACM Trans. Inf. Syst. Secur."},{"key":"1779_CR3","doi-asserted-by":"crossref","unstructured":"Hoang V.T., Krovetz T., Rogaway P.: Robust authenticated-encryption AEZ and the problem that it solves. In: Oswald E., Fischlin M. (eds.) Advances in Cryptology\u2014EUROCRYPT 2015\u201334th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Sofia, Bulgaria, April 26\u201330, 2015, Proceedings, Part I, vol. 9056, pp. 15\u201344. Lecture Notes in Computer Science. Springer, Berlin (2015).","DOI":"10.1007\/978-3-662-46800-5_2"},{"issue":"3","key":"1779_CR4","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/s00145-021-09397-w","volume":"34","author":"J Jean","year":"2021","unstructured":"Jean J., Nikolic I., Peyrin T., Seurin Y.: The deoxys AEAD family. J. Cryptol. 34(3), 31 (2021). https:\/\/doi.org\/10.1007\/s00145-021-09397-w.","journal-title":"J. Cryptol."},{"issue":"3","key":"1779_CR5","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1109\/MSP.2010.111","volume":"8","author":"L Martin","year":"2010","unstructured":"Martin L.: XTS: a mode of AES for encrypting hard disks. IEEE Secur. Priv. 8(3), 68\u201369 (2010). https:\/\/doi.org\/10.1109\/MSP.2010.111.","journal-title":"IEEE Secur. Priv."},{"key":"1779_CR6","doi-asserted-by":"crossref","unstructured":"Rogaway P.: Efficient instantiations of tweakable blockciphers and refinements to modes OCB and PMAC. In: ASIACRYPT, vol. 3329, pp. 16\u201331. Lecture Notes in Computer Science. Springer, Berlin (2004).","DOI":"10.1007\/978-3-540-30539-2_2"},{"key":"1779_CR7","doi-asserted-by":"publisher","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.) Advances in Cryptology - CRYPTO 2017 - 37th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 20-24, 2017, Proceedings, Part III. Lecture Notes in Computer Science, vol. 10403, pp. 34\u201365. Springer, Berlin, Heidelberg (2017). https:\/\/doi.org\/10.1007\/978-3-319-63697-9_2 .","DOI":"10.1007\/978-3-319-63697-9_2"},{"key":"1779_CR8","unstructured":"CAESAR: Competition for Authenticated Encryption: Security, Applicability, and Robustness (2014). http:\/\/competitions.cr.yp.to\/caesar.html."},{"key":"1779_CR9","unstructured":"NIST.: Lightweight Cryptography (2018). https:\/\/csrc.nist.gov\/Projects\/Lightweight-Cryptography. Accessed 1 Aug 2019."},{"key":"1779_CR10","doi-asserted-by":"publisher","unstructured":"Landecker W., Shrimpton T., Terashima R.S.: Tweakable blockciphers with beyond birthday-bound security. In: Safavi-Naini, R., Canetti, R. (eds.) Advances in Cryptology - CRYPTO 2012 - 32nd Annual Cryptology Conference, Santa Barbara, CA, USA, August 19\u201323, 2012. Proceedings. Lecture Notes in Computer Science, vol. 7417, pp. 14\u201330. Springer, Berlin (2012). https:\/\/doi.org\/10.1007\/978-3-642-32009-5_2.","DOI":"10.1007\/978-3-642-32009-5_2"},{"key":"1779_CR11","doi-asserted-by":"publisher","unstructured":"Mennink B.: Towards tight security of cascaded lrw2. In: Theory of Cryptography: 16th International Conference, TCC 2018, Panaji, India, November 11\u201314, 2018, Proceedings, Part II, pp. 192\u2013222. Springer, Berlin, Heidelberg (2018). https:\/\/doi.org\/10.1007\/978-3-030-03810-6_8.","DOI":"10.1007\/978-3-030-03810-6_8"},{"issue":"3","key":"1779_CR12","doi-asserted-by":"publisher","first-page":"1272","DOI":"10.1007\/s00145-020-09347-y","volume":"33","author":"A Jha","year":"2020","unstructured":"Jha A., Nandi M.: Tight security of cascaded LRW2. J. Cryptol. 33(3), 1272\u20131317 (2020). https:\/\/doi.org\/10.1007\/s00145-020-09347-y.","journal-title":"J. Cryptol."},{"key":"1779_CR13","doi-asserted-by":"publisher","unstructured":"Lampe R., Seurin Y.: Tweakable blockciphers with asymptotically optimal security. In: Moriai, S. (ed.) Fast Software Encryption\u201420th International Workshop, FSE 2013, Singapore, March 11-13, 2013. Revised Selected Papers. Lecture Notes in Computer Science, vol. 8424, pp. 133\u2013151. Springer, Berlin (2013). https:\/\/doi.org\/10.1007\/978-3-662-43933-3_8.","DOI":"10.1007\/978-3-662-43933-3_8"},{"key":"1779_CR14","doi-asserted-by":"publisher","unstructured":"Bao Z., Guo C., Guo J., Song L.: Tnt: How to tweak a block cipher. In: Advances in Cryptology \u2013 EUROCRYPT 2020: 39th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Zagreb, Croatia, May 10\u201314, 2020, Proceedings, Part II, pp. 641\u2013673. Springer, Berlin (2020). https:\/\/doi.org\/10.1007\/978-3-030-45724-2_22.","DOI":"10.1007\/978-3-030-45724-2_22"},{"issue":"3","key":"1779_CR15","doi-asserted-by":"publisher","first-page":"1035","DOI":"10.1007\/s10623-022-01137-w","volume":"91","author":"Z Zhang","year":"2022","unstructured":"Zhang Z., Qin Z., Guo C.: Just tweak! asymptotically optimal security for the cascaded lrw1 tweakable blockcipher. Des. Codes Cryptogr. 91(3), 1035\u20131052 (2022). https:\/\/doi.org\/10.1007\/s10623-022-01137-w.","journal-title":"Des. Codes Cryptogr."},{"key":"1779_CR16","unstructured":"Jha A., Khairallah M., Nandi M., Saha A.: Tight Security of TNT and Beyond: Attacks, Proofs and Possibilities for the Cascaded LRW Paradigm. Cryptology ePrint Archive, Paper 2023\/1272 (2023). https:\/\/eprint.iacr.org\/2023\/1272."},{"key":"1779_CR17","doi-asserted-by":"publisher","unstructured":"Datta N., Dey S., Dutta A., Mandal S.: Cascading four round LRW1 is beyond birthday bound secure. IACR Trans. Symmetric Cryptol. 2023(4), 365\u2013390 (2023). https:\/\/doi.org\/10.46586\/TOSC.V2023.I4. 365\u2013390.","DOI":"10.46586\/TOSC.V2023.I4"},{"key":"1779_CR18","unstructured":"Khairallah M.: CLRW1$$^{3}$$ is not Secure Beyond the Birthday Bound: Breaking TNT with $${O(2^{n\/2})}$$ queries. Cryptology ePrint Archive. Paper 2023\/1212 (2023). https:\/\/eprint.iacr.org\/2023\/1212."},{"key":"1779_CR19","unstructured":"Jha A., Nandi M., Saha A.: Tight Security of TNT: Reinforcing Khairallah\u2019s Birthday-bound Attack. Cryptology ePrint Archive, Paper 2023\/1233 (2023). https:\/\/eprint.iacr.org\/2023\/1233."},{"key":"1779_CR20","doi-asserted-by":"publisher","unstructured":"Guo C., Guo J., List E., Song L.: Towards closing the security gap of tweak-and-tweak (tnt). In: Advances in Cryptology\u2014ASIACRYPT 2020: 26th International Conference on the Theory and Application of Cryptology and Information Security, Daejeon, South Korea, December 7\u201311, 2020, Proceedings, Part I, pp. 567\u2013597. Springer, Berlin, Heidelberg (2020). https:\/\/doi.org\/10.1007\/978-3-030-64837-4_19 .","DOI":"10.1007\/978-3-030-64837-4_19"},{"key":"1779_CR21","doi-asserted-by":"publisher","unstructured":"Lampe R., Patarin J., Seurin Y.: An asymptotically tight security analysis of the iterated even-mansour cipher. In: Wang, X., Sako, K. (eds.) Advances in Cryptology\u2014ASIACRYPT 2012\u201418th International Conference on the Theory and Application of Cryptology and Information Security, Beijing, China, December 2-6, 2012. Proceedings. Lecture Notes in Computer Science, vol. 7658, pp. 278\u2013295. Springer, Berlin, Heidelberg (2012).https:\/\/doi.org\/10.1007\/978-3-642-34961-4_18.","DOI":"10.1007\/978-3-642-34961-4_18"},{"key":"1779_CR22","doi-asserted-by":"publisher","unstructured":"Mennink B.: Optimally secure tweakable blockciphers. In: Leander, G. (ed.) Fast Software Encryption\u201422nd International Workshop, FSE 2015, Istanbul, Turkey, March 8-11, 2015, Revised Selected Papers. Lecture Notes in Computer Science, Vol. 9054, pp. 428\u2013448. Springer, Berlin (2015). https:\/\/doi.org\/10.1007\/978-3-662-48116-5_21.","DOI":"10.1007\/978-3-662-48116-5_21"},{"key":"1779_CR23","doi-asserted-by":"crossref","unstructured":"Wang L., Guo J., Zhang G., Zhao J., Gu D.: How to build fully secure tweakable blockciphers from classical blockciphers. In: ASIACRYPT, pp. 455\u2013483 (2016).","DOI":"10.1007\/978-3-662-53887-6_17"},{"key":"1779_CR24","doi-asserted-by":"crossref","unstructured":"Jha A., List E., Minematsu K., Mishra S., Nandi M.: XHX - A framework for optimally secure tweakable block ciphers from classical block ciphers and universal hashing. In: LATINCRYPT, vol. 11368, pp. 207\u2013227. Lecture Notes in Computer Science. Springer, Berlin (2017).","DOI":"10.1007\/978-3-030-25283-0_12"},{"key":"1779_CR25","doi-asserted-by":"crossref","unstructured":"Lee B., Lee J.: Tweakable block ciphers secure beyond the birthday bound in the ideal cipher model. IACR Cryptol. ePrint Arch. 784 (2018).","DOI":"10.1007\/978-3-030-03326-2_11"},{"issue":"2","key":"1779_CR26","doi-asserted-by":"publisher","first-page":"47","DOI":"10.46586\/tosc.v2023.i2.47-68","volume":"2023","author":"Y Shen","year":"2023","unstructured":"Shen Y., Standaert F.: Optimally secure tweakable block ciphers with a large tweak from n-bit block ciphers. IACR Trans. Symmetric Cryptol. 2023(2), 47\u201368 (2023).","journal-title":"IACR Trans. Symmetric Cryptol."},{"key":"1779_CR27","doi-asserted-by":"publisher","first-page":"328","DOI":"10.1007\/978-3-642-04159-4_21","volume-title":"Selected Areas in Cryptography","author":"J Patarin","year":"2009","unstructured":"Patarin J.: The \u201ccoefficients h\u2019\u2019 technique. In: Avanzi R.M., Keliher L., Sica F. (eds.) Selected Areas in Cryptography, pp. 328\u2013345. Springer, Berlin (2009)."},{"key":"1779_CR28","doi-asserted-by":"publisher","unstructured":"Chen Y.L., Tessaro S.: Better security-efficiency trade-offs in permutation-based two-party computation. In: Tibouchi, M., Wang, H. (eds.) Advances in Cryptology\u2014ASIACRYPT 2021\u201427th International Conference on the Theory and Application of Cryptology and Information Security, Singapore, December 6-10, 2021, Proceedings, Part II. Lecture Notes in Computer Science, vol. 13091, pp. 275\u2013304. Springer, Berlin, Heidelberg (2021). https:\/\/doi.org\/10.1007\/978-3-030-92075-3_10.","DOI":"10.1007\/978-3-030-92075-3_10"},{"key":"1779_CR29","doi-asserted-by":"publisher","unstructured":"Tessaro S.: Optimally secure block ciphers from ideal primitives. In: Iwata, T., Cheon, J.H. (eds.) Advances in Cryptology\u2014ASIACRYPT 2015\u201421st International Conference on the Theory and Application of Cryptology and Information Security, Auckland, New Zealand, November 29\u2013December 3, 2015, Proceedings, Part II. Lecture Notes in Computer Science, vol. 9453, pp. 437\u2013462. Springer, Berlin, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-48800-3_18.","DOI":"10.1007\/978-3-662-48800-3_18"},{"key":"1779_CR30","unstructured":"Patarin J.: The \u201ccoefficients h\u201d technique. In: Selected Areas in Cryptography, 15th International Workshop, SAC 2008, Sackville, New Brunswick, Canada, August 14-15, Revised Selected Papers, pp. 328\u2013345 (2008)."},{"key":"1779_CR31","doi-asserted-by":"publisher","unstructured":"Guo C., Shen Y., Wang L., Gu D.: Beyond-birthday secure domain-preserving prfs from a single permutation. Des. Codes Cryptogr. 87(6), 1297\u20131322 (2019). https:\/\/doi.org\/10.1007\/s10623-018-0528-8.","DOI":"10.1007\/s10623-018-0528-8"}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-025-01779-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10623-025-01779-6","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-025-01779-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T04:49:15Z","timestamp":1772254155000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10623-025-01779-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,2]]},"references-count":31,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2026,2]]}},"alternative-id":["1779"],"URL":"https:\/\/doi.org\/10.1007\/s10623-025-01779-6","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,2]]},"assertion":[{"value":"24 August 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 June 2025","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 September 2025","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 February 2026","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 no Conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"48"}}