{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,19]],"date-time":"2026-02-19T08:12:47Z","timestamp":1771488767544,"version":"3.50.1"},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2024,12,20]],"date-time":"2024-12-20T00:00:00Z","timestamp":1734652800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2024,12,20]],"date-time":"2024-12-20T00:00:00Z","timestamp":1734652800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100000781","name":"European Research Council","doi-asserted-by":"publisher","award":["645622"],"award-info":[{"award-number":["645622"]}],"id":[{"id":"10.13039\/501100000781","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001659","name":"Deutsche Forschungsgemeinschaft","doi-asserted-by":"publisher","award":["390781972"],"award-info":[{"award-number":["390781972"]}],"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,3]]},"abstract":"<jats:title>Abstract<\/jats:title>\n          <jats:p>GIFT-64 is a block cipher that has received a lot of attention from the community since its proposal in 2017. The attack on the highest number of rounds is a differential related-key attack on 26 rounds. We studied this attack, in particular with respect to some recent generic frameworks for improving key recovery, and we realised that this framework, combined with an efficient parallel key guessing of interesting subsets of the key and a consequent list merging applied to the partial solutions, can improve the complexity of the attack. We propose two different trade-offs, as a result of the improved key-recovery. We believe that the techniques are quite generic and that it is possible to apply them to improve other differential attacks.<\/jats:p>","DOI":"10.1007\/s10623-024-01527-2","type":"journal-article","created":{"date-parts":[[2024,12,20]],"date-time":"2024-12-20T13:26:20Z","timestamp":1734701180000},"page":"787-822","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Guessing less and better: improved attacks on GIFT-64"],"prefix":"10.1007","volume":"93","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3030-334X","authenticated-orcid":false,"given":"Federico","family":"Canale","sequence":"first","affiliation":[]},{"given":"Mar\u00eda","family":"Naya-Plasencia","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,12,20]]},"reference":[{"key":"1527_CR1","doi-asserted-by":"publisher","unstructured":"Banik S., Pandey S.K., Peyrin T., Sasaki Y., Sim S.M., Todo Y.: GIFT: a small present\u2014towards reaching the limit of lightweight encryption. In: Fischer W., Homma N. (eds.) Cryptographic Hardware and Embedded Systems\u2014CHES 2017\u201419th International Conference, Taipei, Taiwan, September 25\u201328, 2017, Proceedings. Lecture Notes in Computer Science, vol. 10529, pp. 321\u2013345 (2017). https:\/\/doi.org\/10.1007\/978-3-319-66787-4_16.","DOI":"10.1007\/978-3-319-66787-4_16"},{"key":"1527_CR2","doi-asserted-by":"publisher","unstructured":"Biham E., Shamir A.: Differential cryptanalysis of DES-like cryptosystems. In: Menezes A., Vanstone S.A. (eds.) Advances in Cryptology\u2014CRYPTO \u201990, 10th Annual International Cryptology Conference, Santa Barbara, California, USA, August 11\u201315, 1990, Proceedings. Lecture Notes in Computer Science, vol. 537, pp. 2\u201321 (1990). https:\/\/doi.org\/10.1007\/3-540-38424-3_1.","DOI":"10.1007\/3-540-38424-3_1"},{"issue":"1\u20133","key":"1527_CR3","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s10623-010-9452-2","volume":"59","author":"C Blondeau","year":"2011","unstructured":"Blondeau C., G\u00e9rard B., Tillich J.: Accurate estimates of the data complexity and success probability for various cryptanalyses. Des. Codes Cryptogr. 59(1\u20133), 3\u201334 (2011). https:\/\/doi.org\/10.1007\/s10623-010-9452-2.","journal-title":"Des. Codes Cryptogr."},{"key":"1527_CR4","doi-asserted-by":"publisher","unstructured":"Broll M., Canale F., David N., Fl\u00f3rez-Guti\u00e9rrez A., Leander G., Naya-Plasencia M., Todo Y.: New attacks from old distinguishers improved attacks on serpent. In: Galbraith S.D. (ed.) Topics in Cryptology\u2014CT-RSA 2022\u2014Cryptographers\u2019 Track at the RSA Conference 2022, Virtual Event, March 1\u20132, 2022, Proceedings. Lecture Notes in Computer Science, vol. 13161, pp. 484\u2013510. (2022). https:\/\/doi.org\/10.1007\/978-3-030-95312-6_20.","DOI":"10.1007\/978-3-030-95312-6_20"},{"key":"1527_CR5","doi-asserted-by":"publisher","unstructured":"Broll M., Canale F., Fl\u00f3rez-Guti\u00e9rrez A., Leander G., Naya-Plasencia M.: Generic framework for key-guessing improvements. 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\u201310, 2021, Proceedings, Part I. Lecture Notes in Computer Science, vol. 13090, pp. 453\u2013483 (2021). https:\/\/doi.org\/10.1007\/978-3-030-92062-3_16.","DOI":"10.1007\/978-3-030-92062-3_16"},{"key":"1527_CR6","doi-asserted-by":"publisher","unstructured":"Canteaut A., Naya-Plasencia M., Vayssi\u00e8re B.: Sieve-in-the-middle: improved MITM attacks. In: Canetti R., Garay J.A. (eds.) Advances in Cryptology\u2014CRYPTO 2013\u201433rd Annual Cryptology Conference, Santa Barbara, CA, USA, August 18\u201322, 2013. Proceedings, Part I. Lecture Notes in Computer Science, vol. 8042, pp. 222\u2013240 (2013). https:\/\/doi.org\/10.1007\/978-3-642-40041-4_13.","DOI":"10.1007\/978-3-642-40041-4_13"},{"key":"1527_CR7","doi-asserted-by":"publisher","unstructured":"Chen H., Zong R., Dong X.: Improved differential attacks on GIFT-64. In: Zhou J., Luo X., Shen Q., Xu Z. (eds.) Information and Communications Security\u201421st International Conference, ICICS 2019, Beijing, China, December 15\u201317, 2019, Revised Selected Papers. Lecture Notes in Computer Science, vol. 11999, pp. 447\u2013462 (2019). https:\/\/doi.org\/10.1007\/978-3-030-41579-2_26.","DOI":"10.1007\/978-3-030-41579-2_26"},{"issue":"12","key":"1527_CR8","doi-asserted-by":"publisher","first-page":"1805","DOI":"10.1093\/comjnl\/bxz076","volume":"62","author":"L Chen","year":"2019","unstructured":"Chen L., Wang G., Zhang G.: Milp-based related-key rectangle attack and its application to gift, khudra, MIBS. Comput. J. 62(12), 1805\u20131821 (2019). https:\/\/doi.org\/10.1093\/comjnl\/bxz076.","journal-title":"Comput. J."},{"key":"1527_CR9","doi-asserted-by":"publisher","unstructured":"Dong X., Qin L., Sun S., Wang X.: Key guessing strategies for linear key-schedule algorithms in rectangle attacks. In: Dunkelman O., Dziembowski S. (eds.) Advances in Cryptology\u2014EUROCRYPT 2022\u201441st Annual International Conference on the Theory and Applications of Cryptographic Techniques, Trondheim, Norway, May 30\u2013June 3, 2022, Proceedings, Part III. Lecture Notes in Computer Science, vol. 13277, pp. 3\u201333 (2022). https:\/\/doi.org\/10.1007\/978-3-031-07082-2_1.","DOI":"10.1007\/978-3-031-07082-2_1"},{"key":"1527_CR10","doi-asserted-by":"publisher","unstructured":"Ji F., Zhang W., Zhou C., Ding T.: Improved (related-key) differential cryptanalysis on GIFT. In: Dunkelman O., Jacobson Jr. M.J., O\u2019Flynn, C. (eds.) Selected Areas in Cryptography\u2014SAC 2020\u201427th International Conference, Halifax, NS, Canada (Virtual Event), October 21\u201323, 2020, Revised Selected Papers. Lecture Notes in Computer Science, vol. 12804, pp. 198\u2013228 (2020). https:\/\/doi.org\/10.1007\/978-3-030-81652-0_8.","DOI":"10.1007\/978-3-030-81652-0_8"},{"key":"1527_CR11","doi-asserted-by":"publisher","unstructured":"Liu Y., Sasaki Y.: Related-key boomerang attacks on GIFT with automated trail search including BCT effect. In: Jang-Jaccard J., Guo F. (eds.) Information Security and Privacy\u201424th Australasian Conference, ACISP 2019, Christchurch, New Zealand, July 3\u20135, 2019, Proceedings. Lecture Notes in Computer Science, vol. 11547, pp. 555\u2013572 (2019). https:\/\/doi.org\/10.1007\/978-3-030-21548-4_30.","DOI":"10.1007\/978-3-030-21548-4_30"},{"key":"1527_CR12","doi-asserted-by":"publisher","unstructured":"Naya-Plasencia M.: How to improve rebound attacks. In: Rogaway P. (ed.) Advances in Cryptology\u2014CRYPTO 2011\u201431st Annual Cryptology Conference, Santa Barbara, CA, USA, August 14\u201318, 2011. Proceedings. Lecture Notes in Computer Science, vol. 6841, pp. 188\u2013205 (2011). https:\/\/doi.org\/10.1007\/978-3-642-22792-9_11.","DOI":"10.1007\/978-3-642-22792-9_11"},{"issue":"1","key":"1527_CR13","doi-asserted-by":"publisher","first-page":"269","DOI":"10.46586\/tosc.v2021.i1.269-315","volume":"2021","author":"L Sun","year":"2021","unstructured":"Sun L., Wang W., Wang M.: Accelerating the search of differential and linear characteristics with the SAT method. IACR Trans. Symmetric Cryptol. 2021(1), 269\u2013315 (2021). https:\/\/doi.org\/10.46586\/tosc.v2021.i1.269-315.","journal-title":"IACR Trans. Symmetric Cryptol."},{"issue":"6","key":"1527_CR14","doi-asserted-by":"publisher","first-page":"1103","DOI":"10.1007\/s10623-020-00730-1","volume":"88","author":"B Zhao","year":"2020","unstructured":"Zhao B., Dong X., Meier W., Jia K., Wang G.: Generalized related-key rectangle attacks on block ciphers with linear key schedule: applications to SKINNY and GIFT. Des. Codes Cryptogr. 88(6), 1103\u20131126 (2020). https:\/\/doi.org\/10.1007\/s10623-020-00730-1.","journal-title":"Des. Codes Cryptogr."},{"key":"1527_CR15","doi-asserted-by":"publisher","unstructured":"Zhu B., Dong X., Yu H.: Milp-based differential attack on round-reduced GIFT. In: Matsui M. (ed.) Topics in Cryptology\u2014CT-RSA 2019\u2014The Cryptographers\u2019 Track at the RSA Conference 2019, San Francisco, CA, USA, March 4\u20138, 2019, Proceedings. Lecture Notes in Computer Science, vol. 11405, pp. 372\u2013390 (2019). https:\/\/doi.org\/10.1007\/978-3-030-12612-4_19.","DOI":"10.1007\/978-3-030-12612-4_19"},{"issue":"1","key":"1527_CR16","doi-asserted-by":"publisher","first-page":"156","DOI":"10.46586\/tosc.v2021.i1.156-184","volume":"2021","author":"R Zong","year":"2021","unstructured":"Zong R., Dong X., Chen H., Luo Y., Wang S., Li Z.: Towards key-recovery-attack friendly distinguishers: application to GIFT-128. IACR Trans. Symmetric Cryptol. 2021(1), 156\u2013184 (2021). https:\/\/doi.org\/10.46586\/tosc.v2021.i1.156-184.","journal-title":"IACR Trans. Symmetric Cryptol."}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-024-01527-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10623-024-01527-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-024-01527-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,17]],"date-time":"2025-03-17T16:40:38Z","timestamp":1742229638000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10623-024-01527-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,12,20]]},"references-count":16,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2025,3]]}},"alternative-id":["1527"],"URL":"https:\/\/doi.org\/10.1007\/s10623-024-01527-2","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,12,20]]},"assertion":[{"value":"11 March 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 May 2024","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 November 2024","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 December 2024","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}