{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,19]],"date-time":"2026-05-19T21:38:50Z","timestamp":1779226730285,"version":"3.51.4"},"publisher-location":"Cham","reference-count":57,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031533679","type":"print"},{"value":"9783031533686","type":"electronic"}],"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-53368-6_19","type":"book-chapter","created":{"date-parts":[[2024,2,18]],"date-time":"2024-02-18T19:02:15Z","timestamp":1708282935000},"page":"387-408","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":13,"title":["CLAASP: A Cryptographic Library for\u00a0the\u00a0Automated Analysis of\u00a0Symmetric Primitives"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2349-0247","authenticated-orcid":false,"given":"Emanuele","family":"Bellini","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8583-0668","authenticated-orcid":false,"given":"David","family":"Gerault","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3863-3714","authenticated-orcid":false,"given":"Juan","family":"Grados","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0820-1005","authenticated-orcid":false,"given":"Yun Ju","family":"Huang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3234-4399","authenticated-orcid":false,"given":"Rusydi","family":"Makarim","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0008-5279-4902","authenticated-orcid":false,"given":"Mohamed","family":"Rachidi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9487-0669","authenticated-orcid":false,"given":"Sharwan","family":"Tiwari","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,2,19]]},"reference":[{"key":"19_CR1","doi-asserted-by":"publisher","unstructured":"Ankele, R., K\u00f6lbl, S.: Mind the gap - a closer look at the security of block ciphers against differential cryptanalysis. In: Cid, C., Jr., M.J.J. (eds.) SAC 2018. LNCS, vol. 11349, pp. 163\u2013190. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-10970-7_8","DOI":"10.1007\/978-3-030-10970-7_8"},{"key":"19_CR2","unstructured":"Aranha, D.F., Gouv\u00eaa, C.P.L., Markmann, T., Wahby, R.S., Liao, K.: RELIC is an efficient library for cryptography. https:\/\/github.com\/relic-toolkit\/relic"},{"key":"19_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"542","DOI":"10.1007\/978-3-642-10366-7_32","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2009","author":"J-P Aumasson","year":"2009","unstructured":"Aumasson, J.-P., \u00c7al\u0131k, \u00c7., Meier, W., \u00d6zen, O., Phan, R.C.-W., Var\u0131c\u0131, K.: Improved cryptanalysis of skein. In: Matsui, M. (ed.) ASIACRYPT 2009. LNCS, vol. 5912, pp. 542\u2013559. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-10366-7_32"},{"issue":"8","key":"19_CR4","doi-asserted-by":"publisher","first-page":"1797","DOI":"10.1007\/s10623-022-01074-8","volume":"90","author":"SA Azimi","year":"2022","unstructured":"Azimi, S.A., Ranea, A., Salmasizadeh, M., Mohajeri, J., Aref, M.R., Rijmen, V.: A bit-vector differential model for the modular addition by a constant and its applications to differential and impossible-differential cryptanalysis. Des. Codes Cryptogr. 90(8), 1797\u20131855 (2022)","journal-title":"Des. Codes Cryptogr."},{"key":"19_CR5","unstructured":"Barrett, C., Fontaine, P., Tinelli, C.: The Satisfiability Modulo Theories Library (SMT-LIB). www.SMT-LIB.org (2016)"},{"key":"19_CR6","doi-asserted-by":"crossref","unstructured":"Bassham, L., et al.: Special Publication (NIST SP) - 800\u201322 Rev 1a: A Statistical Test Suite for Random and Pseudorandom Number Generators for Cryptographic Applications (2010)","DOI":"10.6028\/NIST.SP.800-22r1a"},{"key":"19_CR7","unstructured":"Bassham, L., Soto, J.: NISTIR 6483: randomness testing of the advanced encryption standard finalist candidates. NIST Internal or Interagency Reports (2000)"},{"key":"19_CR8","unstructured":"Bellini, E., et al.: CLAASP: a cryptographic library for the automated analysis of symmetric primitives. Cryptology ePrint Archive, Paper 2023\/622 (2023). https:\/\/eprint.iacr.org\/2023\/622"},{"key":"19_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"252","DOI":"10.1007\/978-3-031-30872-7_10","volume-title":"Topics in Cryptology \u2013 CT-RSA 2023","author":"E Bellini","year":"2023","unstructured":"Bellini, E., G\u00e9rault, D., Grados, J., Makarim, R.H., Peyrin, T.: Fully automated differential-linear attacks against ARX ciphers. In: Rosulek, M. (ed.) CT-RSA 2023. LNCS, vol. 13871, pp. 252\u2013276. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-30872-7_10"},{"key":"19_CR10","doi-asserted-by":"crossref","unstructured":"Bellini, E., Gerault, D., Hambitzer, A., Rossi, M.: A Cipher-agnostic neural training pipeline with automated finding of good input differences. Cryptology ePrint Archive, Paper 2022\/1467 (2022). https:\/\/eprint.iacr.org\/2022\/1467","DOI":"10.46586\/tosc.v2023.i3.184-212"},{"key":"19_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1007\/978-3-031-17510-7_8","volume-title":"Innovative Security Solutions for Information Technology and Communications","author":"E Bellini","year":"2021","unstructured":"Bellini, E., Hambitzer, A., Protopapa, M., Rossi, M.: Limitations of the use of neural networks in black box cryptanalysis. In: Ryan, P.Y., Toma, C. (eds.) SecITC 2021. LNCS, vol. 13195, pp. 100\u2013124. Springer, Heidelberg (2021). https:\/\/doi.org\/10.1007\/978-3-031-17510-7_8"},{"key":"19_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"805","DOI":"10.1007\/978-3-030-77870-5_28","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2021","author":"A Benamira","year":"2021","unstructured":"Benamira, A., Gerault, D., Peyrin, T., Tan, Q.Q.: A deeper look at machine learning-based cryptanalysis. In: Canteaut, A., Standaert, F.-X. (eds.) EUROCRYPT 2021. LNCS, vol. 12696, pp. 805\u2013835. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-77870-5_28"},{"issue":"1","key":"19_CR13","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/BF00630563","volume":"4","author":"E Biham","year":"1991","unstructured":"Biham, E., Shamir, A.: Differential cryptanalysis of des-like cryptosystems. J. Cryptol. 4(1), 3\u201372 (1991)","journal-title":"J. Cryptol."},{"key":"19_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"322","DOI":"10.1007\/978-3-642-13190-5_17","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2010","author":"A Biryukov","year":"2010","unstructured":"Biryukov, A., Nikoli\u0107, I.: Automatic search for related-key differential characteristics in byte-oriented block ciphers: application to AES, Camellia, Khazad and others. In: Gilbert, H. (ed.) EUROCRYPT 2010. LNCS, vol. 6110, pp. 322\u2013344. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-13190-5_17"},{"issue":"9","key":"19_CR15","doi-asserted-by":"publisher","first-page":"1326","DOI":"10.1016\/j.jsc.2008.02.017","volume":"44","author":"M Brickenstein","year":"2009","unstructured":"Brickenstein, M., Dreyer, A.: Polybori: a framework for Gr\u00f6bner-basis computations with Boolean polynomials. J. Symb. Comput. 44(9), 1326\u20131345 (2009)","journal-title":"J. Symb. Comput."},{"key":"19_CR16","unstructured":"Brown, R.G.: DieHarder: A Random Number Test Suite Version 3.31.1 (2021). https:\/\/webhome.phy.duke.edu\/~rgb\/General\/dieharder.php"},{"key":"19_CR17","doi-asserted-by":"crossref","unstructured":"Coutinho, M., Passos, I., V\u00e1squez, J.C.G., de Mendon\u00e7a, F.L.L., de Sousa, R.T., Borges, F.: Latin dances reloaded: improved cryptanalysis against salsa and chacha, and the proposal of forr\u00f3. In: Agrawal, S., Lin, D. (eds.) Advances in Cryptology - ASIACRYPT 2022, LNCS, vol. 13791, pp. 256\u2013286. Springer (2022)","DOI":"10.1007\/978-3-031-22963-3_9"},{"key":"19_CR18","doi-asserted-by":"publisher","first-page":"123735","DOI":"10.1109\/ACCESS.2020.3005504","volume":"8","author":"M Coutinho","year":"2020","unstructured":"Coutinho, M., de Sousa J\u00fanior, R.T., Borges, F.: Continuous diffusion analysis. IEEE Access 8, 123735\u2013123745 (2020)","journal-title":"IEEE Access"},{"key":"19_CR19","doi-asserted-by":"crossref","unstructured":"Cui, T., Chen, S., Fu, K., Wang, M., Jia, K.: New automatic tool for finding impossible differentials and zero-correlation linear approximations. Sci. China Inf. Sci. 64(2) (2021)","DOI":"10.1007\/s11432-018-1506-4"},{"issue":"4","key":"19_CR20","doi-asserted-by":"publisher","first-page":"1","DOI":"10.46586\/tosc.v2018.i4.1-38","volume":"2018","author":"J Daemen","year":"2018","unstructured":"Daemen, J., Hoffert, S., Assche, G.V., Keer, R.V.: The design of Xoodoo and Xoofff. IACR Trans. Symmetric Cryptol. 2018(4), 1\u201338 (2018)","journal-title":"IACR Trans. Symmetric Cryptol."},{"key":"19_CR21","unstructured":"Daum, M.: Cryptanalysis of Hash functions of the MD4-family (2005)"},{"issue":"1","key":"19_CR22","doi-asserted-by":"publisher","first-page":"89","DOI":"10.46586\/tosc.v2023.i1.89-110","volume":"2023","author":"S Dey","year":"2023","unstructured":"Dey, S., Garai, H.K., Maitra, S.: Cryptanalysis of reduced round chacha - new attack & deeper analysis. IACR Trans. Symmetric Cryptol. 2023(1), 89\u2013110 (2023)","journal-title":"IACR Trans. Symmetric Cryptol."},{"key":"19_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"490","DOI":"10.1007\/978-3-662-48800-3_20","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2015","author":"C Dobraunig","year":"2015","unstructured":"Dobraunig, C., Eichlseder, M., Mendel, F.: Heuristic tool for linear cryptanalysis with applications to CAESAR candidates. In: Iwata, T., Cheon, J.H. (eds.) ASIACRYPT 2015. LNCS, vol. 9453, pp. 490\u2013509. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-48800-3_20"},{"key":"19_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1007\/978-3-642-40041-4_11","volume-title":"Advances in Cryptology \u2013 CRYPTO 2013","author":"P-A Fouque","year":"2013","unstructured":"Fouque, P.-A., Jean, J., Peyrin, T.: Structural evaluation of AES and chosen-key distinguisher of 9-round AES-128. In: Canetti, R., Garay, J.A. (eds.) CRYPTO 2013. LNCS, vol. 8042, pp. 183\u2013203. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-40041-4_11"},{"key":"19_CR25","doi-asserted-by":"crossref","unstructured":"G\u00e9rault, D., Lafourcade, P., Minier, M., Solnon, C.: Computing AES related-key differential characteristics with constraint programming. Artif. Intell. 278, 103183 (2020)","DOI":"10.1016\/j.artint.2019.103183"},{"key":"19_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"150","DOI":"10.1007\/978-3-030-26951-7_6","volume-title":"Advances in Cryptology \u2013 CRYPTO 2019","author":"A Gohr","year":"2019","unstructured":"Gohr, A.: Improving attacks on round-reduced Speck32\/64 using deep learning. In: Boldyreva, A., Micciancio, D. (eds.) CRYPTO 2019. LNCS, vol. 11693, pp. 150\u2013179. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-26951-7_6"},{"key":"19_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"230","DOI":"10.1007\/978-3-031-09234-3_12","volume-title":"Applied Cryptography and Network Security","author":"H Hadipour","year":"2022","unstructured":"Hadipour, H., Eichlseder, M.: Autoguess: a tool for finding guess-and-determine attacks and key bridges. In: Ateniese, G., Venturi, D. (eds.) ACNS 2022. LNCS, vol. 13269, pp. 230\u2013250. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-09234-3_12"},{"issue":"3","key":"19_CR28","doi-asserted-by":"publisher","first-page":"265","DOI":"10.46586\/tosc.v2018.i3.265-289","volume":"2018","author":"M Hall-Andersen","year":"2018","unstructured":"Hall-Andersen, M., Vejre, P.S.: Generating graphs packed with paths estimation of linear approximations and differentials. IACR Trans. Symmetric Cryptol. 2018(3), 265\u2013289 (2018)","journal-title":"IACR Trans. Symmetric Cryptol."},{"key":"19_CR29","unstructured":"Hall-Andersen, M., Vejre, P.S.: Cryptagraph. https:\/\/github.com\/psve\/cryptagraph (2019)"},{"key":"19_CR30","unstructured":"Indr\u00f8y, J.P., Raddum, H.: Trail search with CRHS equations. IACR Cryptol. ePrint Arch, p. 1329 (2021)"},{"issue":"2","key":"19_CR31","doi-asserted-by":"publisher","first-page":"59","DOI":"10.46586\/tosc.v2017.i2.59-83","volume":"2017","author":"K Khoo","year":"2017","unstructured":"Khoo, K., Lee, E., Peyrin, T., Sim, S.M.: Human-readable proof of the related-key security of AES-128. IACR Trans. Symmetric Cryptol. 2017(2), 59\u201383 (2017)","journal-title":"IACR Trans. Symmetric Cryptol."},{"key":"19_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"226","DOI":"10.1007\/978-3-642-34961-4_15","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2012","author":"G Leurent","year":"2012","unstructured":"Leurent, G.: Analysis of differential attacks in ARX constructions. In: Wang, X., Sako, K. (eds.) ASIACRYPT 2012. LNCS, vol. 7658, pp. 226\u2013243. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-34961-4_15"},{"key":"19_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1007\/978-3-642-40041-4_14","volume-title":"Advances in Cryptology \u2013 CRYPTO 2013","author":"G Leurent","year":"2013","unstructured":"Leurent, G.: Construction of differential characteristics in ARX designs application to skein. In: Canetti, R., Garay, J.A. (eds.) CRYPTO 2013. LNCS, vol. 8042, pp. 241\u2013258. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-40041-4_14"},{"key":"19_CR34","unstructured":"Libralesso, L., Delobel, F., Lafourcade, P., Solnon, C.: Automatic Generation of Declarative Models For Differential Cryptanalysis. In: Michel, L.D. (ed.) 27th International Conference on Principles and Practice of Constraint Programming, CP 2021, Montpellier, France (Virtual Conference), October 25\u201329, 2021. LIPIcs, vol. 210, pp. 40:1\u201340:18. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2021)"},{"key":"19_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"336","DOI":"10.1007\/3-540-45473-X_28","volume-title":"Fast Software Encryption","author":"H Lipmaa","year":"2002","unstructured":"Lipmaa, H., Moriai, S.: Efficient algorithms for computing differential properties of addition. In: Matsui, M. (ed.) FSE 2001. LNCS, vol. 2355, pp. 336\u2013350. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-45473-X_28"},{"issue":"3","key":"19_CR36","doi-asserted-by":"publisher","first-page":"24","DOI":"10.46586\/tosc.v2017.i3.24-36","volume":"2017","author":"Y Liu","year":"2017","unstructured":"Liu, Y., Witte, G.D., Ranea, A., Ashur, T.: Rotational-XOR cryptanalysis of reduced-round SPECK. IACR Trans. Symmetric Cryptol. 2017(3), 24\u201336 (2017)","journal-title":"IACR Trans. Symmetric Cryptol."},{"key":"19_CR37","unstructured":"Marsaglia, G.: The Marsaglia Random Number CDROM including the Diehard Battery of Tests of Randomness (1995). https:\/\/web.archive.org\/web\/20160125103112. http:\/\/stat.fsu.edu\/pub\/diehard\/"},{"key":"19_CR38","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"386","DOI":"10.1007\/3-540-48285-7_33","volume-title":"Advances in Cryptology \u2014 EUROCRYPT \u201993","author":"M Matsui","year":"1994","unstructured":"Matsui, M.: Linear cryptanalysis method for DES Cipher. In: Helleseth, T. (ed.) EUROCRYPT 1993. LNCS, vol. 765, pp. 386\u2013397. Springer, Heidelberg (1994). https:\/\/doi.org\/10.1007\/3-540-48285-7_33"},{"key":"19_CR39","unstructured":"Mouha, N., Preneel, B.: A Proof that the ARX Cipher Salsa20 is secure against differential cryptanalysis. IACR Cryptol. ePrint Arch, p. 328 (2013)"},{"key":"19_CR40","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1007\/978-3-642-34704-7_5","volume-title":"Information Security and Cryptology","author":"N Mouha","year":"2012","unstructured":"Mouha, N., Wang, Q., Gu, D., Preneel, B.: Differential and linear cryptanalysis using mixed-integer linear programming. In: Wu, C.-K., Yung, M., Lin, D. (eds.) Inscrypt 2011. LNCS, vol. 7537, pp. 57\u201376. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-34704-7_5"},{"key":"19_CR41","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"529","DOI":"10.1007\/978-3-540-74970-7_38","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2007","author":"N Nethercote","year":"2007","unstructured":"Nethercote, N., Stuckey, P.J., Becket, R., Brand, S., Duck, G.J., Tack, G.: MiniZinc: towards a standard CP modelling language. In: Bessi\u00e8re, C. (ed.) CP 2007. LNCS, vol. 4741, pp. 529\u2013543. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-74970-7_38"},{"key":"19_CR42","doi-asserted-by":"publisher","first-page":"627","DOI":"10.1080\/00029890.1955.11988710","volume":"62","author":"WV Quine","year":"1955","unstructured":"Quine, W.V.: A way to simplify truth functions. Amer. Math. Monthly 62, 627\u2013631 (1955)","journal-title":"Amer. Math. Monthly"},{"key":"19_CR43","unstructured":"Ranea, A., Liu, Y., Ashur, T.: An easy-to-use tool for rotational-XOR cryptanalysis of ARX block ciphers. IACR Cryptol. ePrint Arch, p. 727 (2020)"},{"issue":"6","key":"19_CR44","doi-asserted-by":"publisher","first-page":"470","DOI":"10.1049\/ise2.12077","volume":"16","author":"A Ranea","year":"2022","unstructured":"Ranea, A., Rijmen, V.: Characteristic automated search of cryptographic algorithms for distinguishing attacks (CASCADA). IET Inf. Secur. 16(6), 470\u2013481 (2022)","journal-title":"IET Inf. Secur."},{"key":"19_CR45","doi-asserted-by":"publisher","first-page":"63045","DOI":"10.1109\/ACCESS.2019.2917015","volume":"7","author":"J Ren","year":"2019","unstructured":"Ren, J., Chen, S.: Cryptanalysis of reduced-round speck. IEEE Access 7, 63045\u201363056 (2019)","journal-title":"IEEE Access"},{"key":"19_CR46","doi-asserted-by":"crossref","unstructured":"Rukhin, A., et al.: Special Publication (NIST SP) - 800\u201322: A Statistical Test Suite for Random and Pseudorandom Number Generators for Cryptographic Applications (2001)","DOI":"10.6028\/NIST.SP.800-22"},{"issue":"9","key":"19_CR47","doi-asserted-by":"publisher","first-page":"2113","DOI":"10.1007\/s10623-021-00904-5","volume":"89","author":"S Sadeghi","year":"2021","unstructured":"Sadeghi, S., Rijmen, V., Bagheri, N.: Proposing an MILP-based method for the experimental verification of difference-based trails: application to SPECK. SIMECK. Des. Codes Cryptogr. 89(9), 2113\u20132155 (2021)","journal-title":"SIMECK. Des. Codes Cryptogr."},{"key":"19_CR48","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1007\/978-3-319-56617-7_7","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2017","author":"Yu Sasaki","year":"2017","unstructured":"Sasaki, Yu., Todo, Y.: New impossible differential search tool from design and cryptanalysis aspects. In: Coron, J.-S., Nielsen, J.B. (eds.) EUROCRYPT 2017. LNCS, vol. 10212, pp. 185\u2013215. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-56617-7_7"},{"key":"19_CR49","doi-asserted-by":"crossref","unstructured":"Soto, J.: NISTIR 6390: Randomness testing of the advanced encryption standard candidate algorithms. NIST Internal or Interagency Reports (1999)","DOI":"10.6028\/NIST.IR.6390"},{"key":"19_CR50","unstructured":"Soto, J.: Statistical testing of random number generators. In: Proceedings of the 22nd National Information Systems Security Conference, vol. 10, p. 12. NIST Gaithersburg, MD (1999). https:\/\/csrc.nist.gov\/CSRC\/media\/Publications\/conference-paper\/1999\/10\/21\/proceedings-of-the-22nd-nissc-1999\/documents\/papers\/p24.pdf"},{"key":"19_CR51","unstructured":"Stankovski, P.: Automated algebraic cryptanalysis, pp. 11. ECRYPT II (2010). tools for Cryptanalysis 2010; Conference date: 22\u201306-2010 Through 23\u201306-2010"},{"key":"19_CR52","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1007\/978-3-642-17401-8_16","volume-title":"Progress in Cryptology - INDOCRYPT 2010","author":"P Stankovski","year":"2010","unstructured":"Stankovski, P.: Greedy distinguishers and nonrandomness detectors. In: Gong, G., Gupta, K.C. (eds.) INDOCRYPT 2010. LNCS, vol. 6498, pp. 210\u2013226. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-17401-8_16"},{"key":"19_CR53","unstructured":"Stefan K\u00f6lbl: CryptoSMT: an easy to use tool for cryptanalysis of symmetric primitives. https:\/\/github.com\/kste\/cryptosmt"},{"issue":"1","key":"19_CR54","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)","journal-title":"IACR Trans. Symmetric Cryptol."},{"key":"19_CR55","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"158","DOI":"10.1007\/978-3-662-45611-8_9","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2014","author":"S Sun","year":"2014","unstructured":"Sun, S., Hu, L., Wang, P., Qiao, K., Ma, X., Song, L.: Automatic security evaluation and (related-key) differential characteristic search: application to SIMON, PRESENT, LBlock, DES(L) and other bit-oriented block ciphers. In: Sarkar, P., Iwata, T. (eds.) ASIACRYPT 2014. LNCS, vol. 8873, pp. 158\u2013178. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-45611-8_9"},{"key":"19_CR56","unstructured":"Vesselinux, Laboratory of Algorithmics, C., of Luxembourg University, S.L.: Vesselinux\/yaarx: Yet another toolkit for analysis of ARX cryptographic algorithms. https:\/\/github.com\/vesselinux\/yaarx"},{"key":"19_CR57","unstructured":"Zhang, X., Chen, Z., Cai, S.: Parkissat: Random shuffle based and pre-processing extended parallel solvers with clause sharing. SAT COMPETITION, 51 (2022)"}],"container-title":["Lecture Notes in Computer Science","Selected Areas in Cryptography \u2013 SAC 2023"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-53368-6_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,18]],"date-time":"2024-02-18T19:03:56Z","timestamp":1708283036000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-53368-6_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031533679","9783031533686"],"references-count":57,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-53368-6_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"19 February 2024","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":"Fredericton, NB","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":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 August 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 August 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sacrypt2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/sac-workshop.github.io\/sac-2023\/index.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"45","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"21","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"47% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.09","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.56","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}