{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T09:34:43Z","timestamp":1743068083282,"version":"3.40.3"},"publisher-location":"Cham","reference-count":27,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031229114"},{"type":"electronic","value":"9783031229121"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"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":[[2022]]},"DOI":"10.1007\/978-3-031-22912-1_17","type":"book-chapter","created":{"date-parts":[[2022,12,31]],"date-time":"2022-12-31T15:38:49Z","timestamp":1672501129000},"page":"373-397","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Monte Carlo Tree Search for\u00a0Automatic Differential Characteristics Search: Application to\u00a0SPECK"],"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"}]},{"given":"David","family":"Gerault","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Matteo","family":"Protopapa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Matteo","family":"Rossi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,1,1]]},"reference":[{"key":"17_CR1","unstructured":"Abramson, B.D.: The expected-outcome model of two-player games. Ph.D. thesis, Columbia University, USA (1987). AAI8827528"},{"key":"17_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"546","DOI":"10.1007\/978-3-662-46706-0_28","volume-title":"Fast Software Encryption","author":"A Biryukov","year":"2015","unstructured":"Biryukov, A., Roy, A., Velichkov, V.: Differential analysis of block ciphers SIMON and SPECK. In: Cid, C., Rechberger, C. (eds.) FSE 2014. LNCS, vol. 8540, pp. 546\u2013570. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-46706-0_28"},{"key":"17_CR3","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, 3\u201372 (1991)","journal-title":"J. Cryptol."},{"key":"17_CR4","doi-asserted-by":"crossref","unstructured":"Beaulieu, R., Shors, D., Smith, J., Treatman-Clark, S., Weeks, B., Wingers, L.: The SIMON and SPECK lightweight block ciphers. In: Proceedings of the 52nd Annual Design Automation Conference, DAC 2015. Association for Computing Machinery, New York (2015)","DOI":"10.1145\/2744769.2747946"},{"key":"17_CR5","doi-asserted-by":"crossref","unstructured":"Biryukov, A., Velichkov, V.: Automatic search for differential trails in ARX ciphers (extended version). IACR Cryptology ePrint Archive 2013:853 (2013)","DOI":"10.1007\/978-3-319-04852-9_12"},{"key":"17_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1007\/978-3-319-04852-9_12","volume-title":"Topics in Cryptology \u2013 CT-RSA 2014","author":"A Biryukov","year":"2014","unstructured":"Biryukov, A., Velichkov, V.: Automatic search for differential trails in ARX ciphers. In: Benaloh, J. (ed.) CT-RSA 2014. LNCS, vol. 8366, pp. 227\u2013250. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-04852-9_12"},{"key":"17_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1007\/978-3-662-52993-5_15","volume-title":"Fast Software Encryption","author":"A Biryukov","year":"2016","unstructured":"Biryukov, A., Velichkov, V., Le Corre, Y.: Automatic search for the best trails in ARX: application to block cipher Speck. In: Peyrin, T. (ed.) FSE 2016. LNCS, vol. 9783, pp. 289\u2013310. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-52993-5_15"},{"key":"17_CR8","doi-asserted-by":"crossref","unstructured":"Burmeister, J., Wiles, J.: The challenge of go as a domain for AI research: a comparison between go and chess. In: Proceedings of Third Australian and New Zealand Conference on Intelligent Information Systems. ANZIIS-95, pp. 181\u2013186 (1995)","DOI":"10.1109\/ANZIIS.1995.705737"},{"key":"17_CR9","unstructured":"Chaslot, G., Bakkes, S., Szitai, I., Spronck, P.: Monte-Carlo tree search: a new framework for game AI1. In: Belgian\/Netherlands Artificial Intelligence Conference, pp. 389\u2013390 (2008)"},{"key":"17_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1007\/978-3-540-75538-8_7","volume-title":"Computers and Games","author":"R Coulom","year":"2007","unstructured":"Coulom, R.: Efficient selectivity and backup operators in Monte-Carlo tree search. In: van den Herik, H.J., Ciancarini, P., Donkers, H.H.L.M.J. (eds.) CG 2006. LNCS, vol. 4630, pp. 72\u201383. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-75538-8_7"},{"key":"17_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1007\/978-3-319-13051-4_9","volume-title":"Selected Areas in Cryptography \u2013 SAC 2014","author":"I Dinur","year":"2014","unstructured":"Dinur, I.: Improved differential cryptanalysis of round-reduced speck. In: Joux, A., Youssef, A. (eds.) SAC 2014. LNCS, vol. 8781, pp. 147\u2013164. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-13051-4_9"},{"key":"17_CR12","doi-asserted-by":"crossref","unstructured":"Dwivedi, A.D., Morawiecki, P., Srivastava, G.: Differential cryptanalysis of round-reduced speck suitable for internet of things devices. IEEE Access 7, 16476\u201316486 (2019)","DOI":"10.1109\/ACCESS.2019.2894337"},{"key":"17_CR13","doi-asserted-by":"publisher","first-page":"79105","DOI":"10.1109\/ACCESS.2018.2881130","volume":"6","author":"Ashutosh Dhar Dwivedi and Gautam Srivastava","year":"2018","unstructured":"Ashutosh Dhar Dwivedi and Gautam Srivastava: Differential cryptanalysis of round-reduced lea. IEEE Access 6, 79105\u201379113 (2018)","journal-title":"IEEE Access"},{"key":"17_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"268","DOI":"10.1007\/978-3-662-52993-5_14","volume-title":"Fast Software Encryption","author":"K Fu","year":"2016","unstructured":"Fu, K., Wang, M., Guo, Y., Sun, S., Hu, L.: MILP-based automatic search algorithms for differential and linear trails for speck. In: Peyrin, T. (ed.) FSE 2016. LNCS, vol. 9783, pp. 268\u2013288. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-52993-5_14"},{"issue":"2","key":"17_CR15","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1109\/TSSC.1968.300136","volume":"4","author":"PE Hart","year":"1968","unstructured":"Hart, P.E., Nilsson, N.J., Raphael, B.: A formal basis for the heuristic determination of minimum cost paths. IEEE Trans. Syst. Sci. Cybern. 4(2), 100\u2013107 (1968)","journal-title":"IEEE Trans. Syst. Sci. Cybern."},{"key":"17_CR16","unstructured":"Helmbold, D., Parker-Wood, A.: All-moves-as-first heuristics in Monte-Carlo go. In: Proceedings of the 2009 International Conference on Artificial Intelligence, ICAI 2009, vol. 2, pp. 605\u2013610, January 2009"},{"key":"17_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1007\/978-3-030-35423-7_6","volume-title":"Progress in Cryptology \u2013 INDOCRYPT 2019","author":"M Huang","year":"2019","unstructured":"Huang, M., Wang, L.: Automatic tool for searching for differential characteristics in ARX ciphers and applications. In: Hao, F., Ruj, S., Sen Gupta, S. (eds.) INDOCRYPT 2019. LNCS, vol. 11898, pp. 115\u2013138. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-35423-7_6"},{"issue":"1","key":"17_CR18","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/0004-3702(85)90084-0","volume":"27","author":"RE Korf","year":"1985","unstructured":"Korf, R.E.: Depth-first iterative-deepening: an optimal admissible tree search. Artif. Intell. 27(1), 97\u2013109 (1985)","journal-title":"Artif. Intell."},{"key":"17_CR19","doi-asserted-by":"publisher","unstructured":"Kozen, D.C.: Depth-first and breadth-first search. In: Kozen, D.C. (ed.) The Design and Analysis of Algorithms. Texts and Monographs in Computer Science, pp. 19\u201324. Springer, New York (1992). https:\/\/doi.org\/10.1007\/978-1-4612-4400-4_4","DOI":"10.1007\/978-1-4612-4400-4_4"},{"key":"17_CR20","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"282","DOI":"10.1007\/11871842_29","volume-title":"Machine Learning: ECML 2006","author":"L Kocsis","year":"2006","unstructured":"Kocsis, L., Szepesv\u00e1ri, C.: Bandit based Monte-Carlo planning. In: F\u00fcrnkranz, J., Scheffer, T., Spiliopoulou, M. (eds.) ECML 2006. LNCS (LNAI), vol. 4212, pp. 282\u2013293. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11871842_29"},{"issue":"2","key":"17_CR21","doi-asserted-by":"publisher","first-page":"1054","DOI":"10.1109\/TIT.2020.3040543","volume":"67","author":"Z Liu","year":"2021","unstructured":"Liu, Z., Li, Y., Jiao, L., Wang, M.: A new method for searching optimal differential and linear trails in ARX ciphers. IEEE Trans. Inf. Theory 67(2), 1054\u20131068 (2021)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"17_CR22","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"},{"key":"17_CR23","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\u2014EUROCRYPT \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":"17_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"366","DOI":"10.1007\/BFb0053451","volume-title":"Advances in Cryptology \u2014 EUROCRYPT\u201994","author":"M Matsui","year":"1995","unstructured":"Matsui, M.: On correlation between the order of S-boxes and the strength of DES. In: De Santis, A. (ed.) EUROCRYPT 1994. LNCS, vol. 950, pp. 366\u2013375. Springer, Heidelberg (1995). https:\/\/doi.org\/10.1007\/BFb0053451"},{"key":"17_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1007\/978-3-319-40367-0_24","volume-title":"Information Security and Privacy","author":"L Song","year":"2016","unstructured":"Song, L., Huang, Z., Yang, Q.: Automatic differential analysis of ARX block ciphers with application to SPECK and LEA. In: Liu, J.K., Steinfeld, R. (eds.) ACISP 2016. LNCS, vol. 9723, pp. 379\u2013394. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-40367-0_24"},{"key":"17_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-87608-3_1","volume-title":"Computers and Games","author":"MPD Schadd","year":"2008","unstructured":"Schadd, M.P.D., Winands, M.H.M., van den Herik, H.J., Chaslot, G.M.J.-B., Uiterwijk, J.W.H.M.: Single-player Monte-Carlo tree search. In: van den Herik, H.J., Xu, X., Ma, Z., Winands, M.H.M. (eds.) CG 2008. LNCS, vol. 5131, pp. 1\u201312. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-87608-3_1"},{"key":"17_CR27","doi-asserted-by":"crossref","unstructured":"Sun, L., Wang, W., Wang, M.: Accelerating the search of differential and linear characteristics with the sat method. IACR Trans. Symmetric Cryptol. 269\u2013315 (2021)","DOI":"10.46586\/tosc.v2021.i1.269-315"}],"container-title":["Lecture Notes in Computer Science","Progress in Cryptology \u2013 INDOCRYPT 2022"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-22912-1_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,11]],"date-time":"2024-10-11T08:39:47Z","timestamp":1728635987000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-22912-1_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031229114","9783031229121"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-22912-1_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"1 January 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"INDOCRYPT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Cryptology in India","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Kolkata","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"India","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 December 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 December 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"indocrypt2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.tcgcrest.org\/indocrypt-2022\/","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":"74","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":"31","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":"42% - 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.22","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":"4.59","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)"}}]}}