{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T21:07:13Z","timestamp":1743109633484,"version":"3.40.3"},"publisher-location":"Cham","reference-count":31,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031588679"},{"type":"electronic","value":"9783031588686"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"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":[[2024]]},"DOI":"10.1007\/978-3-031-58868-6_4","type":"book-chapter","created":{"date-parts":[[2024,5,5]],"date-time":"2024-05-05T16:01:36Z","timestamp":1714924896000},"page":"78-111","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Automated-Based Rebound Attacks on\u00a0ACE Permutation"],"prefix":"10.1007","author":[{"given":"Jiali","family":"Shi","sequence":"first","affiliation":[]},{"given":"Guoqiang","family":"Liu","sequence":"additional","affiliation":[]},{"given":"Chao","family":"Li","sequence":"additional","affiliation":[]},{"given":"Yingxin","family":"Li","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,5,6]]},"reference":[{"key":"4_CR1","unstructured":"Aagaard, M., AlTawy, R., Gong, G., Mandal, K., Rohit, R.: ACE: an authenticated encryption and hash algorithm. Submission to NIST-LWC (Round 2) (2019). https:\/\/csrc.nist.gov\/CSRC\/media\/Projects\/lightweight-cryptography\/documents\/round-2\/spec-doc-rnd2\/ace-spec-round2.pdf"},{"key":"4_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1007\/978-3-319-72565-9_7","volume-title":"Selected Areas in Cryptography \u2013 SAC 2017","author":"R AlTawy","year":"2018","unstructured":"AlTawy, R., Rohit, R., He, M., Mandal, K., Yang, G., Gong, G.: sLiSCP: simeck-based permutations for\u00a0lightweight sponge cryptographic\u00a0primitives. In: Adams, C., Camenisch, J. (eds.) SAC 2017. LNCS, vol. 10719, pp. 129\u2013150. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-72565-9_7"},{"key":"4_CR3","doi-asserted-by":"publisher","unstructured":"AlTawy, R., Rohit, R., He, M., Mandal, K., Yang, G., Gong, G.: Sliscp-light: towards hardware optimized sponge-specific cryptographic permutations. ACM Trans. Embed. Comput. Syst. 17(4), 81:1\u201381:26 (2018). https:\/\/doi.org\/10.1145\/3233245","DOI":"10.1145\/3233245"},{"key":"4_CR4","unstructured":"Beaulieu, R., Shors, D., Smith, J., Treatman-Clark, S., Weeks, B., Wingers, L.: The SIMON and SPECK families of lightweight block ciphers. IACR Cryptology ePrint Archive, p. 404 (2013). http:\/\/eprint.iacr.org\/2013\/404"},{"issue":"1\u20133","key":"4_CR5","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1007\/s10623-012-9660-z","volume":"66","author":"A Bogdanov","year":"2013","unstructured":"Bogdanov, A., Shibutani, K.: Generalized Feistel networks revisited. Des. Codes Cryptogr. 66(1\u20133), 75\u201397 (2013). https:\/\/doi.org\/10.1007\/s10623-012-9660-z","journal-title":"Des. Codes Cryptogr."},{"key":"4_CR6","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1007\/978-3-031-15802-5_4","volume-title":"CRYPTO 2022, Part I","author":"X Dong","year":"2022","unstructured":"Dong, X., Guo, J., Li, S., Pham, P.: Triangulating rebound attack on AES-like hashing. In: Dodis, Y., Shrimpton, T. (eds.) CRYPTO 2022, Part I. LNCS, vol. 13507, pp. 94\u2013124. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-15802-5_4"},{"key":"4_CR7","unstructured":"Dong, X., Li, S., Pham, P.: Chosen-key distinguishing attacks on full AES-192, AES-256, Kiasu-BC, and more. IACR Cryptology ePrint Archive, p. 1095 (2023). https:\/\/eprint.iacr.org\/2023\/1095"},{"key":"4_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1007\/978-3-642-13858-4_21","volume-title":"Fast Software Encryption","author":"H Gilbert","year":"2010","unstructured":"Gilbert, H., Peyrin, T.: Super-Sbox cryptanalysis: improved attacks for AES-like permutations. In: Hong, S., Iwata, T. (eds.) FSE 2010. LNCS, vol. 6147, pp. 365\u2013383. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-13858-4_21"},{"key":"4_CR9","doi-asserted-by":"publisher","unstructured":"Hosoyamada, A., Naya-Plasencia, M., Sasaki, Y.: Improved attacks on sLiSCP permutation and tight bound of limited birthday distinguishers. IACR Trans. Symmetric Cryptol. 2020(4), 147\u2013172 (2020). https:\/\/doi.org\/10.46586\/tosc.v2020.i4.147-172","DOI":"10.46586\/tosc.v2020.i4.147-172"},{"key":"4_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"504","DOI":"10.1007\/978-3-642-42045-0_26","volume-title":"Advances in Cryptology - ASIACRYPT 2013","author":"M Iwamoto","year":"2013","unstructured":"Iwamoto, M., Peyrin, T., Sasaki, Yu.: Limited-birthday distinguishers for hash functions. In: Sako, K., Sarkar, P. (eds.) ASIACRYPT 2013, Part II. LNCS, vol. 8270, pp. 504\u2013523. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-42045-0_26"},{"key":"4_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1007\/978-3-662-47989-6_8","volume-title":"Advances in Cryptology \u2013 CRYPTO 2015","author":"S K\u00f6lbl","year":"2015","unstructured":"K\u00f6lbl, S., Leander, G., Tiessen, T.: Observations on the SIMON block cipher family. In: Gennaro, R., Robshaw, M. (eds.) CRYPTO 2015, Part I. LNCS, vol. 9215, pp. 161\u2013185. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-47989-6_8"},{"key":"4_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-02777-2","volume-title":"Theory and Applications of Satisfiability Testing - SAT 2009","year":"2009","unstructured":"Kullmann, O. (ed.): SAT 2009. LNCS, vol. 5584. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-02777-2"},{"key":"4_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/3-540-46416-6_2","volume-title":"Advances in Cryptology \u2014 EUROCRYPT \u201991","author":"X Lai","year":"1991","unstructured":"Lai, X., Massey, J.L., Murphy, S.: Markov ciphers and differential cryptanalysis. In: Davies, D.W. (ed.) EUROCRYPT 1991. LNCS, vol. 547, pp. 17\u201338. Springer, Heidelberg (1991). https:\/\/doi.org\/10.1007\/3-540-46416-6_2"},{"key":"4_CR14","doi-asserted-by":"publisher","unstructured":"Lamberger, M., Mendel, F., Schl\u00e4ffer, M., Rechberger, C., Rijmen, V.: The rebound attack and subspace distinguishers: application to whirlpool. J. Cryptol. 28(2), 257\u2013296 (2015). https:\/\/doi.org\/10.1007\/s00145-013-9166-5","DOI":"10.1007\/s00145-013-9166-5"},{"key":"4_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"272","DOI":"10.1007\/978-3-030-92062-3_10","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2021","author":"G Leurent","year":"2021","unstructured":"Leurent, G., Pernot, C., Schrottenloher, A.: Clustering effect in\u00a0Simon and\u00a0Simeck. In: Tibouchi, M., Wang, H. (eds.) ASIACRYPT 2021, Part I. LNCS, vol. 13090, pp. 272\u2013302. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-92062-3_10"},{"key":"4_CR16","doi-asserted-by":"crossref","unstructured":"Liu, J., Liu, G., Qu, L.: A new automatic tool searching for impossible differential of NIST candidate ACE. Mathematics 8(9), 1576 (2020). Number: 9 Publisher: Multidisciplinary Digital Publishing Institute","DOI":"10.3390\/math8091576"},{"key":"4_CR17","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1007\/978-3-030-10970-7_5","volume-title":"SAC 2018","author":"Y Liu","year":"2018","unstructured":"Liu, Y., Sasaki, Y., Song, L., Wang, G.: Cryptanalysis of reduced sLiSCP permutation in sponge-hash and duplex-AE modes. In: Cid, C., Jacobson, M., Jr. (eds.) SAC 2018. LNCS, vol. 11349, pp. 92\u2013114. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-10970-7_5"},{"key":"4_CR18","doi-asserted-by":"publisher","unstructured":"Liu, Z., Li, Y., Wang, M.: Optimal differential trails in Simon-like ciphers. IACR Trans. Symmetric Cryptol. 2017(1), 358\u2013379 (2017). https:\/\/doi.org\/10.13154\/tosc.v2017.i1.358-379","DOI":"10.13154\/tosc.v2017.i1.358-379"},{"issue":"1\/2","key":"4_CR19","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1023\/A:1006326723002","volume":"24","author":"F Massacci","year":"2000","unstructured":"Massacci, F., Marraro, L.: Logical cryptanalysis as a SAT problem. J. Autom. Reason. 24(1\/2), 165\u2013203 (2000). https:\/\/doi.org\/10.1023\/A:1006326723002","journal-title":"J. Autom. Reason."},{"key":"4_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"260","DOI":"10.1007\/978-3-642-03317-9_16","volume-title":"Fast Software Encryption","author":"F Mendel","year":"2009","unstructured":"Mendel, F., Rechberger, C., Schl\u00e4ffer, M., Thomsen, S.S.: The rebound attack: cryptanalysis of reduced whirlpool and. In: Dunkelman, O. (ed.) FSE 2009. LNCS, vol. 5665, pp. 260\u2013276. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-03317-9_16"},{"key":"4_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1007\/11814948_13","volume-title":"Theory and Applications of Satisfiability Testing - SAT 2006","author":"I Mironov","year":"2006","unstructured":"Mironov, I., Zhang, L.: Applications of SAT solvers to cryptanalysis of hash functions. In: Biere, A., Gomes, C.P. (eds.) SAT 2006. LNCS, vol. 4121, pp. 102\u2013115. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11814948_13"},{"issue":"10\u201311","key":"4_CR22","doi-asserted-by":"publisher","first-page":"392","DOI":"10.1016\/j.ipl.2013.03.004","volume":"113","author":"P Morawiecki","year":"2013","unstructured":"Morawiecki, P., Srebrny, M.: A SAT-based preimage analysis of reduced Keccak hash functions. Inf. Process. Lett. 113(10\u201311), 392\u2013397 (2013). https:\/\/doi.org\/10.1016\/j.ipl.2013.03.004","journal-title":"Inf. Process. Lett."},{"issue":"6","key":"4_CR23","doi-asserted-by":"publisher","first-page":"937","DOI":"10.1145\/1217856.1217859","volume":"53","author":"R Nieuwenhuis","year":"2006","unstructured":"Nieuwenhuis, R., Oliveras, A., Tinelli, C.: Solving SAT and SAT modulo theories: From an abstract Davis-Putnam-Logemann-Loveland procedure to DPLL($$T$$). J. ACM 53(6), 937\u2013977 (2006). https:\/\/doi.org\/10.1145\/1217856.1217859","journal-title":"J. ACM"},{"key":"4_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1007\/978-3-642-24209-0_3","volume-title":"Information Security and Cryptology - ICISC 2010","author":"I Nikoli\u0107","year":"2011","unstructured":"Nikoli\u0107, I., Pieprzyk, J., Soko\u0142owski, P., Steinfeld, R.: Known and chosen key differential distinguishers for block ciphers. In: Rhee, K.-H., Nyang, D.H. (eds.) ICISC 2010. LNCS, vol. 6829, pp. 29\u201348. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-24209-0_3"},{"key":"4_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1007\/BFb0034838","volume-title":"Advances in Cryptology \u2014 ASIACRYPT \u201996","author":"K Nyberg","year":"1996","unstructured":"Nyberg, K.: Generalized Feistel networks. In: Kim, K., Matsumoto, T. (eds.) ASIACRYPT 1996. LNCS, vol. 1163, pp. 91\u2013104. Springer, Heidelberg (1996). https:\/\/doi.org\/10.1007\/BFb0034838"},{"key":"4_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"827","DOI":"10.1007\/11564751_73","volume-title":"Principles and Practice of Constraint Programming - CP 2005","author":"C Sinz","year":"2005","unstructured":"Sinz, C.: Towards an optimal CNF encoding of Boolean cardinality constraints. In: van Beek, P. (ed.) CP 2005. LNCS, vol. 3709, pp. 827\u2013831. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11564751_73"},{"key":"4_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"196","DOI":"10.1007\/978-3-662-49890-3_8","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2016","author":"B Sun","year":"2016","unstructured":"Sun, B., Liu, M., Guo, J., Rijmen, V., Li, R.: Provable security evaluation of structures against impossible differential and zero correlation linear cryptanalysis. In: Fischlin, M., Coron, J.-S. (eds.) EUROCRYPT 2016. LNCS, vol. 9665, pp. 196\u2013213. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-49890-3_8"},{"key":"4_CR28","doi-asserted-by":"publisher","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","DOI":"10.46586\/tosc.v2021.i1.269-315"},{"key":"4_CR29","unstructured":"Wang, S., Feng, D., Hu, B., Guan, J., Shi, T., Zhang, K.: The simplest SAT model of combining Matsui\u2019s bounding conditions with sequential encoding method. IACR Cryptology ePrint Archive, p. 626 (2022). https:\/\/eprint.iacr.org\/2022\/626"},{"key":"4_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1007\/978-3-662-48324-4_16","volume-title":"Cryptographic Hardware and Embedded Systems \u2013 CHES 2015","author":"G Yang","year":"2015","unstructured":"Yang, G., Zhu, B., Suder, V., Aagaard, M.D., Gong, G.: The Simeck family of lightweight block ciphers. In: G\u00fcneysu, T., Handschuh, H. (eds.) CHES 2015. LNCS, vol. 9293, pp. 307\u2013329. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-48324-4_16"},{"key":"4_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"306","DOI":"10.1007\/978-3-030-93206-0_19","volume-title":"Information Security Practice and Experience","author":"T Ye","year":"2021","unstructured":"Ye, T., Wei, Y., Li, L., Pasalic, E.: Impossible differential cryptanalysis and integral cryptanalysis of the ACE-class permutation. In: Deng, R., et al. (eds.) ISPEC 2021. LNCS, vol. 13107, pp. 306\u2013326. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-93206-0_19"}],"container-title":["Lecture Notes in Computer Science","Topics in Cryptology \u2013 CT-RSA 2024"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-58868-6_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,5]],"date-time":"2024-05-05T16:01:49Z","timestamp":1714924909000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-58868-6_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031588679","9783031588686"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-58868-6_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"6 May 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CT-RSA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Cryptographers\u2019 Track at the RSA Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"San Francisco, CA","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 May 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 May 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ctrsa2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ct-rsa-2024.aau.at\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}