{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T02:35:03Z","timestamp":1767321303289,"version":"3.48.0"},"publisher-location":"Cham","reference-count":35,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032105356","type":"print"},{"value":"9783032105363","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"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":[],"published-print":{"date-parts":[[2026]]},"DOI":"10.1007\/978-3-032-10536-3_4","type":"book-chapter","created":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T02:32:49Z","timestamp":1767321169000},"page":"79-109","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Breaking the\u00a0Twinkle Authenticated Encryption Scheme and\u00a0Analyzing Its Underlying Permutation"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7240-5304","authenticated-orcid":false,"given":"Debasmita","family":"Chakraborty","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3820-3765","authenticated-orcid":false,"given":"Hosein","family":"Hadipour","sequence":"additional","affiliation":[]},{"given":"Anup Kumar","family":"Kundu","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0934-4769","authenticated-orcid":false,"given":"Mostafizar","family":"Rahman","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0009-0005-4891-1342","authenticated-orcid":false,"given":"Prathamesh","family":"Ram","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1273-2394","authenticated-orcid":false,"given":"Yu","family":"Sasaki","sequence":"additional","affiliation":[]},{"given":"Dilip","family":"Sau","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0009-0003-8280-5178","authenticated-orcid":false,"given":"Aman","family":"Sinha","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2026,1,2]]},"reference":[{"key":"4_CR1","unstructured":"Caesar: Competition for authenticated encryption: security, applicability, and robustness (2014). https:\/\/competitions.cr.yp.to\/caesar.html"},{"key":"4_CR2","unstructured":"AMD secure encrypted virtualization (SEV) | AMD (2019). https:\/\/www.amd.com\/en\/developer\/sev.html"},{"key":"4_CR3","unstructured":"NIST lightweight cryptography competition (2021). https:\/\/csrc.nist.gov\/projects\/lightweight-cryptography\/finalists"},{"key":"4_CR4","doi-asserted-by":"publisher","unstructured":"Anand, R., et al.: GLEEOK: a family of low-latency PRFS and its applications to authenticated encryption. IACR Trans. Cryptogr. Hardw. Embed. Syst. 2024(2), 545\u2013587 (2024). https:\/\/doi.org\/10.46586\/tches.v2024.i2.545-587","DOI":"10.46586\/tches.v2024.i2.545-587"},{"key":"4_CR5","unstructured":"Architecture & Technology Group: Arm CCA Security Model 1.0. https:\/\/developer.arm.com\/documentation\/DEN0096\/latest\/ (2021). document number: DEN0096"},{"key":"4_CR6","unstructured":"ARM Holdings: introduction to PAC (2021). https:\/\/developer.arm.com\/documentation\/109576\/0100\/Pointer-Authentication-Code\/Introduction-to-PAC"},{"key":"4_CR7","doi-asserted-by":"publisher","unstructured":"Avanzi, R.: The QARMA block cipher family. almost MDS matrices over rings with zero divisors, nearly symmetric even-mansour constructions with non-involutory central rounds, and search heuristics for low-latency s-boxes. IACR Trans. Symmetric Cryptol. 2017(1), 4\u201344 (2017). https:\/\/doi.org\/10.13154\/tosc.v2017.i1.4-44","DOI":"10.13154\/tosc.v2017.i1.4-44"},{"key":"4_CR8","doi-asserted-by":"publisher","unstructured":"Banik, S., Isobe, T., Liu, F., Minematsu, K., Sakamoto, K.: Orthros: a low-latency PRF. IACR Trans. Symmetric Cryptol. 2021(1), 37\u201377 (2021). https:\/\/doi.org\/10.46586\/tosc.v2021.i1.37-77","DOI":"10.46586\/tosc.v2021.i1.37-77"},{"key":"4_CR9","doi-asserted-by":"publisher","unstructured":"Beierle, C., et al.: The SKINNY family of block ciphers and its low-latency variant MANTIS. In: Robshaw, M., Katz, J. (eds.) CRYPTO 2016. LNCS, vol.\u00a09815, pp. 123\u2013153. Springer (2016). https:\/\/doi.org\/10.1007\/978-3-662-53008-5_5","DOI":"10.1007\/978-3-662-53008-5_5"},{"key":"4_CR10","doi-asserted-by":"publisher","unstructured":"Belkheyar, Y., Daemen, J., Dobraunig, C., Ghosh, S., Rasoolzadeh, S.: BipBip: a low-latency tweakable block cipher with small dimensions. IACR Trans. Cryptogr. Hardw. Embed. Syst. 2023(1), 326\u2013368 (2023). https:\/\/doi.org\/10.46586\/tches.v2023.i1.326-368","DOI":"10.46586\/tches.v2023.i1.326-368"},{"key":"4_CR11","doi-asserted-by":"crossref","unstructured":"Bellare, M., Hoang, V.T.: Efficient schemes for committing authenticated encryption. In: EUROCRYPT 2022. LNCS, vol. 13276, pp. 845\u2013875 (2022)","DOI":"10.1007\/978-3-031-07085-3_29"},{"key":"4_CR12","doi-asserted-by":"publisher","unstructured":"Bernstein, D.J., et al.: Gimli : a cross-platform permutation. In: Fischer, W., Homma, N. (eds.) CHES 2017. LNCS, vol. 10529, pp. 299\u2013320. Springer (2017). https:\/\/doi.org\/10.1007\/978-3-319-66787-4_15","DOI":"10.1007\/978-3-319-66787-4_15"},{"key":"4_CR13","unstructured":"Borghoff, J., et al.: PRINCE - a low-latency block cipher for pervasive computing applications (full version). IACR Cryptol. ePrint Arch, p.\u00a0529 (2012). http:\/\/eprint.iacr.org\/2012\/529"},{"key":"4_CR14","unstructured":"Canale, F., G\u00fcneysu, T., Leander, G., Thoma, J.P., Todo, Y., Ueno, R.: SCARF - A low-latency block cipher for secure cache-randomization. In: Calandrino, J.A., Troncoso, C. (eds.) USENIX Security 2023, pp. 1937\u20131954. USENIX Association (2023). https:\/\/www.usenix.org\/conference\/usenixsecurity23\/presentation\/canale"},{"key":"4_CR15","unstructured":"Cui, T., Chen, S., Jia, K., Fu, K., Wang, M.: New automatic search tool for impossible differentials and zero-correlation linear approximations. IACR Cryptology ePrint Archive, Report 2016\/689 (2016). https:\/\/eprint.iacr.org\/2016\/689"},{"key":"4_CR16","doi-asserted-by":"publisher","unstructured":"Dodis, Y., Grubbs, P., Ristenpart, T., Woodage, J.: Fast message franking: from invisible salamanders to encryptment. In: Shacham, H., Boldyreva, A. (eds.) CRYPTO 2018. LNCS, vol. 10991, pp. 155\u2013186. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-96884-1_6","DOI":"10.1007\/978-3-319-96884-1_6"},{"key":"4_CR17","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-01004-0_1","volume":"4","author":"R Elbaz","year":"2009","unstructured":"Elbaz, R., Champagne, D., Gebotys, C.H., Lee, R.B., Potlapally, N.R., Torres, L.: Hardware mechanisms for memory authentication: a survey of existing techniques and engines. Trans. Comput. Sci. 4, 1\u201322 (2009). https:\/\/doi.org\/10.1007\/978-3-642-01004-0_1","journal-title":"Trans. Comput. Sci."},{"issue":"1","key":"4_CR18","doi-asserted-by":"publisher","first-page":"449","DOI":"10.46586\/tosc.v2017.i1.449-473","volume":"2017","author":"P Farshim","year":"2017","unstructured":"Farshim, P., Orlandi, C., Rosie, R.: Security of symmetric primitives under incorrect usage of keys. IACR Trans. Symmetric Cryptol. 2017(1), 449\u2013473 (2017)","journal-title":"IACR Trans. Symmetric Cryptol."},{"key":"4_CR19","doi-asserted-by":"crossref","unstructured":"Gueron, S.: Memory encryption for general-purpose processors. IEEE Secur. Priv. 14(6), 54\u201362 (2016). https:\/\/doi.org\/10.1109\/MSP.2016.124","DOI":"10.1109\/MSP.2016.124"},{"key":"4_CR20","doi-asserted-by":"publisher","unstructured":"Hadipour, H., Derbez, P., and, M.E.: Revisiting differential-linear attacks via a boomerang perspective with application to AES, Ascon, CLEFIA, SKINNY, PRESENT, KNOT, TWINE, WARP, LBlock, Simeck, and SERPENT, pp. 38\u201372 (2024). https:\/\/doi.org\/10.1007\/978-3-031-68385-5_2","DOI":"10.1007\/978-3-031-68385-5_2"},{"key":"4_CR21","doi-asserted-by":"publisher","unstructured":"Hadipour, H., Gerhalter, S., Sadeghi, S., Eichlseder, M.: Improved search for integral, impossible differential and zero-correlation attacks application to ascon, forkskinny, skinny, mantis, PRESENT and qarmav2. IACR Trans. Symmetric Cryptol. 2024(1), 234\u2013325 (2024). https:\/\/doi.org\/10.46586\/TOSC.V2024.I1.234-325","DOI":"10.46586\/TOSC.V2024.I1.234-325"},{"key":"4_CR22","doi-asserted-by":"publisher","unstructured":"Hadipour, H., Nageler, M., Eichlseder, M.: Throwing boomerangs into feistel structures application to clefia, warp, lblock, lblock-s and TWINE. IACR Trans. Symmetric Cryptol. 2022(3), 271\u2013302 (2022). https:\/\/doi.org\/10.46586\/tosc.v2022.i3.271-302","DOI":"10.46586\/tosc.v2022.i3.271-302"},{"key":"4_CR23","doi-asserted-by":"publisher","unstructured":"Hadipour, H., Sadeghi, S., Eichlseder, M.: Finding the impossible: automated search for full impossible differential, zero-correlation, and integral attacks. In: EUROCRYPT 2023. LNCS, vol. 14007, pp. 128\u2013157. Springer (2023). https:\/\/doi.org\/10.1007\/978-3-031-30634-1_5","DOI":"10.1007\/978-3-031-30634-1_5"},{"key":"4_CR24","doi-asserted-by":"publisher","unstructured":"Hosoyamada, A., et al.: Cryptanalysis of ROCCA and feasibility of its security claim. IACR Trans. Symmetric Cryptol. 2022(3), 123\u2013151 (2022). https:\/\/doi.org\/10.46586\/TOSC.V2022.I3.123-151","DOI":"10.46586\/TOSC.V2022.I3.123-151"},{"key":"4_CR25","doi-asserted-by":"publisher","unstructured":"Leander, G., Moos, T., Moradi, A., Rasoolzadeh, S.: The SPEEDY family of block ciphers engineering an ultra low-latency cipher from gate level for secure processor architectures. IACR Trans. Cryptogr. Hardw. Embed. Syst. 2021(4), 510\u2013545 (2021). https:\/\/doi.org\/10.46586\/TCHES.V2021.I4.510-545","DOI":"10.46586\/TCHES.V2021.I4.510-545"},{"key":"4_CR26","doi-asserted-by":"publisher","unstructured":"LeMay, M., et al.: Cryptographic capability computing. In: MICRO 2021: 54th Annual IEEE\/ACM International Symposium on Microarchitecture, Virtual Event, Greece, 18-22 October 2021, pp. 253\u2013267. ACM (2021). https:\/\/doi.org\/10.1145\/3466752.3480076","DOI":"10.1145\/3466752.3480076"},{"key":"4_CR27","unstructured":"Len, J., Grubbs, P., Ristenpart, T.: Partitioning oracle attacks. In: USENIX Security 2021, pp. 195\u2013212 (2021)"},{"key":"4_CR28","doi-asserted-by":"publisher","unstructured":"Sakamoto, K., Liu, F., Nakano, Y., Kiyomoto, S., Isobe, T.: ROCCA: an efficient AES-based encryption scheme for beyond 5G. IACR Trans. Symmetric Cryptol. 2021(2), 1\u201330 (2021). https:\/\/doi.org\/10.46586\/TOSC.V2021.I2.1-30, full version is available on IACR Cryptol. ePrint Arch. 2022\/116","DOI":"10.46586\/TOSC.V2021.I2.1-30"},{"key":"4_CR29","doi-asserted-by":"publisher","unstructured":"Sasaki, Y., Todo, Y.: New impossible differential search tool from design and cryptanalysis aspects. In: EUROCRYPT 2017. LNCS, vol. 10212, pp. 185\u2013215. Springer (2017). https:\/\/doi.org\/10.1007\/978-3-319-56617-7_7","DOI":"10.1007\/978-3-319-56617-7_7"},{"key":"4_CR30","doi-asserted-by":"publisher","unstructured":"Sun, B., et al.: Links among impossible differential, integral and zero correlation linear cryptanalysis. In: CRYPTO 2015. LNCS, vol.\u00a09215, pp. 95\u2013115. Springer (2015). https:\/\/doi.org\/10.1007\/978-3-662-47989-6_5","DOI":"10.1007\/978-3-662-47989-6_5"},{"key":"4_CR31","doi-asserted-by":"publisher","unstructured":"Todo, Y.: Structural evaluation by generalized integral property. In: Oswald, E., Fischlin, M. (eds.) EUROCRYPT 2015. LNCS, vol.\u00a09056, pp. 287\u2013314. Springer (2015). https:\/\/doi.org\/10.1007\/978-3-662-46800-5_12","DOI":"10.1007\/978-3-662-46800-5_12"},{"key":"4_CR32","doi-asserted-by":"publisher","unstructured":"Todo, Y., Morii, M.: Bit-based division property and application to Simon family. In: Peyrin, T. (ed.) FSE 2016. LNCS, vol.\u00a09783, pp. 357\u2013377. Springer (2016). https:\/\/doi.org\/10.1007\/978-3-662-52993-5_18","DOI":"10.1007\/978-3-662-52993-5_18"},{"key":"4_CR33","doi-asserted-by":"publisher","unstructured":"Wang, J., Huang, T., Wu, S., Liu, Z.: Twinkle: a family of low-latency schemes for authenticated encryption and pointer authentication. IACR Commun. Cryptol. 1(2) (2024). https:\/\/doi.org\/10.62056\/a3n59qgxq","DOI":"10.62056\/a3n59qgxq"},{"issue":"3","key":"4_CR34","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1016\/0022-0000(81)90033-7","volume":"22","author":"MN Wegman","year":"1981","unstructured":"Wegman, M.N., Carter, L.: New hash functions and their use in authentication and set equality. J. Comput. Syst. Sci. 22(3), 265\u2013279 (1981). https:\/\/doi.org\/10.1016\/0022-0000(81)90033-7","journal-title":"J. Comput. Syst. Sci."},{"key":"4_CR35","doi-asserted-by":"publisher","unstructured":"Xiang, Z., Zhang, W., Bao, Z., Lin, D.: Applying MILP method to searching integral distinguishers based on division property for 6 lightweight block ciphers. In: Cheon, J.H., Takagi, T. (eds.) ASIACRYPT 2016. LNCS, vol. 10031, pp. 648\u2013678 (2016). https:\/\/doi.org\/10.1007\/978-3-662-53887-6_24","DOI":"10.1007\/978-3-662-53887-6_24"}],"container-title":["Lecture Notes in Computer Science","Selected Areas in Cryptography \u2013 SAC 2025"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-10536-3_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T02:32:50Z","timestamp":1767321170000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-10536-3_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032105356","9783032105363"],"references-count":35,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-10536-3_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]},"assertion":[{"value":"2 January 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SAC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Selected Areas in Cryptography","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Toronto, ON","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Canada","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 August 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 August 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"32","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sacrypt2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/sacworkshop.org\/SAC25\/index.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}