{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,27]],"date-time":"2025-07-27T07:47:22Z","timestamp":1753602442807,"version":"3.40.3"},"publisher-location":"Cham","reference-count":52,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030648367"},{"type":"electronic","value":"9783030648374"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"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":[[2020]]},"DOI":"10.1007\/978-3-030-64837-4_13","type":"book-chapter","created":{"date-parts":[[2020,12,5]],"date-time":"2020-12-05T16:02:55Z","timestamp":1607184175000},"page":"385-414","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["A Bit-Vector Differential Model for the Modular Addition by a Constant"],"prefix":"10.1007","author":[{"given":"Seyyed Arash","family":"Azimi","sequence":"first","affiliation":[]},{"given":"Adri\u00e1n","family":"Ranea","sequence":"additional","affiliation":[]},{"given":"Mahmoud","family":"Salmasizadeh","sequence":"additional","affiliation":[]},{"given":"Javad","family":"Mohajeri","sequence":"additional","affiliation":[]},{"given":"Mohammad Reza","family":"Aref","sequence":"additional","affiliation":[]},{"given":"Vincent","family":"Rijmen","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,12,6]]},"reference":[{"key":"13_CR1","unstructured":"Omale, G.: Gartner identifies top 10 strategic IoT technologies and trends (2018). https:\/\/www.gartner.com\/en\/newsroom\/press-releases\/2018-11-07-gartner-identifies-top-10-strategic-iot-technologies-and-trends"},{"key":"13_CR2","unstructured":"National Institute of Standards and Technology. Lightweight cryptography project. https:\/\/csrc.nist.gov\/Projects\/Lightweight-Cryptography"},{"issue":"3","key":"13_CR3","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1007\/s13389-018-0193-x","volume":"9","author":"D Dinu","year":"2019","unstructured":"Dinu, D., Corre, L.Y., Khovratovich, D., Perrin, L., Gro\u00dfsch\u00e4dl, J., Biryukov, A.: Triathlon of lightweight block ciphers for the internet of things. J. Cryptographic Eng. 9(3), 283\u2013302 (2019)","journal-title":"J. Cryptographic Eng."},{"key":"13_CR4","unstructured":"Aumasson, J.-P., Henzen, L., Meier, W., Phan, R.C.-W.: Sha-3 proposal blake. Submission to NIST (round 3), 92 (2008)"},{"key":"13_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1007\/978-3-540-68351-3_8","volume-title":"New Stream Cipher Designs","author":"DJ Bernstein","year":"2008","unstructured":"Bernstein, D.J.: The Salsa20 family of stream ciphers. In: Robshaw, M., Billet, O. (eds.) New Stream Cipher Designs. LNCS, vol. 4986, pp. 84\u201397. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-68351-3_8"},{"key":"13_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"306","DOI":"10.1007\/978-3-319-13051-4_19","volume-title":"Selected Areas in Cryptography \u2013 SAC 2014","author":"N Mouha","year":"2014","unstructured":"Mouha, N., Mennink, B., Van Herrewege, A., Watanabe, D., Preneel, B., Verbauwhede, I.: Chaskey: an efficient MAC algorithm for 32-bit microcontrollers. In: Joux, A., Youssef, A. (eds.) SAC 2014. LNCS, vol. 8781, pp. 306\u2013323. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-13051-4_19"},{"key":"13_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1007\/11894063_4","volume-title":"Cryptographic Hardware and Embedded Systems - CHES 2006","author":"D Hong","year":"2006","unstructured":"Hong, D., et al.: HIGHT: a new block cipher suitable for low-resource device. In: Goubin, L., Matsui, M. (eds.) CHES 2006. LNCS, vol. 4249, pp. 46\u201359. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11894063_4"},{"key":"13_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-319-05149-9_1","volume-title":"Information Security Applications","author":"D Hong","year":"2014","unstructured":"Hong, D., Lee, J.-K., Kim, D.-C., Kwon, D., Ryu, K.H., Lee, D.-G.: LEA: a 128-bit block cipher for fast encryption on common processors. In: Kim, Y., Lee, H., Perrig, A. (eds.) WISA 2013. LNCS, vol. 8267, pp. 3\u201327. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-05149-9_1"},{"key":"13_CR9","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 2013, 404 (2013)"},{"key":"13_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"484","DOI":"10.1007\/978-3-662-53887-6_18","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2016","author":"D Dinu","year":"2016","unstructured":"Dinu, D., Perrin, L., Udovenko, A., Velichkov, V., Gro\u00dfsch\u00e4dl, J., Biryukov, A.: Design strategies for ARX with provable bounds: Sparx and LAX. In: Cheon, J.H., Takagi, T. (eds.) ASIACRYPT 2016. LNCS, vol. 10031, pp. 484\u2013513. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53887-6_18"},{"key":"13_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"389","DOI":"10.1007\/3-540-46877-3_35","volume-title":"Advances in Cryptology \u2014 EUROCRYPT 1990","author":"X Lai","year":"1991","unstructured":"Lai, X., Massey, J.L.: A proposal for a new block encryption standard. In: Damg\u00e5rd, I.B. (ed.) EUROCRYPT 1990. LNCS, vol. 473, pp. 389\u2013404. Springer, Heidelberg (1991). https:\/\/doi.org\/10.1007\/3-540-46877-3_35"},{"key":"13_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1007\/3-540-60590-8_29","volume-title":"Fast Software Encryption","author":"DJ Wheeler","year":"1995","unstructured":"Wheeler, D.J., Needham, R.M.: TEA, a tiny encryption algorithm. In: Preneel, B. (ed.) FSE 1994. LNCS, vol. 1008, pp. 363\u2013366. Springer, Heidelberg (1995). https:\/\/doi.org\/10.1007\/3-540-60590-8_29"},{"key":"13_CR13","unstructured":"Needham, R., Wheeler, D.: Tea extensions. Technical report, Computer Laboratory, University of Cambridge (1997)"},{"key":"13_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-319-78556-1_1","volume-title":"Information Security and Cryptology \u2013 ICISC 2017","author":"B Koo","year":"2018","unstructured":"Koo, B., Roh, D., Kim, H., Jung, Y., Lee, D.-G., Kwon, D.: CHAM: a family of lightweight block ciphers for resource-constrained devices. In: Kim, H., Kim, D.-C. (eds.) ICISC 2017. LNCS, vol. 10779, pp. 3\u201325. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-78556-1_1"},{"key":"13_CR15","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":"13_CR16","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":"13_CR17","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 1994","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":"13_CR18","unstructured":"Mouha, N., Preneel., B.: Towards finding optimal differential characteristics for ARX: Application to Salsa20. IACR Cryptology ePrint Archive, 2013:328 (2013). http:\/\/eprint.iacr.org\/2013\/328"},{"key":"13_CR19","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"},{"key":"13_CR20","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1007\/978-3-319-10575-8_11","volume-title":"Handbook of Model Checking","author":"C Barrett","year":"2018","unstructured":"Barrett, C., Tinelli, C.: Satisfiability modulo theories. Handbook of Model Checking, pp. 305\u2013343. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-10575-8_11"},{"key":"13_CR21","doi-asserted-by":"publisher","first-page":"619","DOI":"10.1007\/978-3-540-68279-0_16","volume-title":"50 Years of Integer Programming 1958-2008","author":"A Lodi","year":"2010","unstructured":"Lodi, A.: Mixed integer programming computation. In: J\u00fcnger, M., et al. (eds.) 50 Years of Integer Programming 1958-2008, pp. 619\u2013645. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-540-68279-0_16"},{"key":"13_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":"13_CR23","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. LNCS, vol. 9215, pp. 161\u2013185. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-47989-6_8"},{"issue":"3","key":"13_CR24","doi-asserted-by":"publisher","first-page":"24","DOI":"10.13154\/tosc.v2017.i3.24-36","volume":"2017","author":"Y Liu","year":"2017","unstructured":"Liu, Y., De Witte, G., Ranea, A., Ashur, T.: Rotational-XOR cryptanalysis of reduced-round SPECK. IACR Trans. Symmetric Cryptol. 2017(3), 24\u201336 (2017). https:\/\/doi.org\/10.13154\/tosc.v2017.i3.24-36","journal-title":"IACR Trans. Symmetric Cryptol."},{"key":"13_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":"13_CR26","unstructured":"Machado, A.W.: Differential probability of modular addition with a constant operand. IACR Cryptology ePrint Archive, 2001:52 (2001). http:\/\/eprint.iacr.org\/2001\/052"},{"issue":"2","key":"13_CR27","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1007\/s00224-015-9653-1","volume":"59","author":"G Kov\u00e1sznai","year":"2016","unstructured":"Kov\u00e1sznai, G., Fr\u00f6hlich, A., Biere, A.: Complexity of fixed-size bit-vector logics. Theory Comput. Syst. 59(2), 323\u2013376 (2016)","journal-title":"Theory Comput. Syst."},{"key":"13_CR28","volume-title":"Hacker\u2019s Delight","author":"HS Warren Jr","year":"2003","unstructured":"Warren Jr., H.S.: Hacker\u2019s Delight. Addison-Wesley, Boston (2003)"},{"issue":"1","key":"13_CR29","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). https:\/\/doi.org\/10.1007\/BF00630563","journal-title":"J. Cryptol."},{"key":"13_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1007\/3-540-68697-5_19","volume-title":"Advances in Cryptology \u2014 CRYPTO 1996","author":"J Kelsey","year":"1996","unstructured":"Kelsey, J., Schneier, B., Wagner, D.: Key-schedule cryptanalysis of IDEA, G-DES, GOST, SAFER, and triple-DES. In: Koblitz, N. (ed.) CRYPTO 1996. LNCS, vol. 1109, pp. 237\u2013251. Springer, Heidelberg (1996). https:\/\/doi.org\/10.1007\/3-540-68697-5_19"},{"issue":"1","key":"13_CR31","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1080\/0161-118791861749","volume":"11","author":"RS Winternitz","year":"1987","unstructured":"Winternitz, R.S., Hellman, M.E.: Chosen-key attacks on a block cipher. Cryptologia 11(1), 16\u201320 (1987)","journal-title":"Cryptologia"},{"key":"13_CR32","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 1991","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":"13_CR33","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"},{"issue":"1","key":"13_CR34","doi-asserted-by":"publisher","first-page":"281","DOI":"10.13154\/tosc.v2017.i1.281-306","volume":"2017","author":"S Sun","year":"2017","unstructured":"Sun, S., et al.: Analysis of AES, skinny, and others with constraint programming. IACR Trans. Symmetric Cryptol. 2017(1), 281\u2013306 (2017). https:\/\/doi.org\/10.13154\/tosc.v2017.i1.281-306","journal-title":"IACR Trans. Symmetric Cryptol."},{"key":"13_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"306","DOI":"10.1007\/978-3-319-16295-9_17","volume-title":"Progress in Cryptology - LATINCRYPT 2014","author":"J-P Aumasson","year":"2015","unstructured":"Aumasson, J.-P., Jovanovic, P., Neves, S.: Analysis of NORX: investigating differential and rotational properties. In: Aranha, D.F., Menezes, A. (eds.) LATINCRYPT 2014. LNCS, vol. 8895, pp. 306\u2013324. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-16295-9_17"},{"key":"13_CR36","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1007\/3-540-36231-2_5","volume-title":"Progress in Cryptology \u2014 INDOCRYPT 2002","author":"H Lipmaa","year":"2002","unstructured":"Lipmaa, H.: On differential properties of pseudo-Hdamard transform and related mappings (extended abstract). In: Menezes, A., Sarkar, P. (eds.) INDOCRYPT 2002. LNCS, vol. 2551, pp. 48\u201361. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-36231-2_5"},{"key":"13_CR37","unstructured":"Bagherzadeh, E., Ahmadian, Z.: Milp-based automatic differential searches for LEA and HIGHT. IACR Cryptology ePrint Archive, 2018:948 (2018). https:\/\/eprint.iacr.org\/2018\/948"},{"issue":"1\u20133","key":"13_CR38","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/s10623-012-9668-4","volume":"66","author":"E Schulte-Geers","year":"2013","unstructured":"Schulte-Geers, E.: On CCZ-equivalence of addition mod $$2^n$$. Des. Codes Cryptogr. 66(1\u20133), 111\u2013127 (2013). https:\/\/doi.org\/10.1007\/s10623-012-9668-4","journal-title":"Des. Codes Cryptogr."},{"key":"13_CR39","doi-asserted-by":"crossref","unstructured":"Mitchell, J.N.: Computer multiplication and division using binary logarithms. IRE Trans. Electr. Comput. (4), 512\u2013517 (1962)","DOI":"10.1109\/TEC.1962.5219391"},{"key":"13_CR40","doi-asserted-by":"publisher","first-page":"53","DOI":"10.3233\/SAT190101","volume":"9","author":"A Niemetz","year":"2015","unstructured":"Niemetz, A., Preiner, M., Biere, A.: Boolector 2.0 system description. J. Satisfiab. Boolean Model. Comput 9, 53\u201358 (2015)","journal-title":"J. Satisfiab. Boolean Model. Comput"},{"key":"13_CR41","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"519","DOI":"10.1007\/978-3-540-73368-3_52","volume-title":"Computer Aided Verification","author":"V Ganesh","year":"2007","unstructured":"Ganesh, V., Dill, D.L.: A decision procedure for bit-vectors and arrays. In: Damm, W., Hermanns, H. (eds.) CAV 2007. LNCS, vol. 4590, pp. 519\u2013531. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-73368-3_52"},{"key":"13_CR42","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1007\/3-540-48519-8_12","volume-title":"Fast Software Encryption","author":"D Wagner","year":"1999","unstructured":"Wagner, D.: The boomerang attack. In: Knudsen, L. (ed.) FSE 1999. LNCS, vol. 1636, pp. 156\u2013170. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/3-540-48519-8_12"},{"key":"13_CR43","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"340","DOI":"10.1007\/3-540-44987-6_21","volume-title":"Advances in Cryptology \u2014 EUROCRYPT 2001","author":"E Biham","year":"2001","unstructured":"Biham, E., Dunkelman, O., Keller, N.: The rectangle attack \u2014 rectangling the serpent. In: Pfitzmann, B. (ed.) EUROCRYPT 2001. LNCS, vol. 2045, pp. 340\u2013357. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-44987-6_21"},{"key":"13_CR44","doi-asserted-by":"publisher","unstructured":"Meurer, A., et al.: Sympy: symbolic computing in python. Peer J. Comput. Sci. 3:e103 (2017). ISSN 2376\u20135992. https:\/\/doi.org\/10.7717\/peerj-cs.103","DOI":"10.7717\/peerj-cs.103"},{"key":"13_CR45","unstructured":"Gario, M., Micheli, A.: Pysmt: a solver-agnostic library for fast prototyping of smt-based algorithms. In: SMT Workshop 2015 (2015)"},{"key":"13_CR46","unstructured":"Hadarean, L., Hyvarinen, A., Niemetz, A., Reger, G.: 14th International Satisfiability Modulo Theories Competition (smt-comp 2019): Rules and Procedures (2019)"},{"issue":"1","key":"13_CR47","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10207-008-0059-9","volume":"8","author":"L Jiqiang","year":"2009","unstructured":"Jiqiang, L.: Related-key rectangle attack on 36 rounds of the XTEA block cipher. Int. J. Inf. Sec. 8(1), 1\u201311 (2009)","journal-title":"Int. J. Inf. Sec."},{"key":"13_CR48","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"286","DOI":"10.1007\/11958239_19","volume-title":"Progress in Cryptology - VIETCRYPT 2006","author":"E Lee","year":"2006","unstructured":"Lee, E., Hong, D., Chang, D., Hong, S., Lim, J.: A weak key class of XTEA for a related-key rectangle attack. In: Nguyen, P.Q. (ed.) VIETCRYPT 2006. LNCS, vol. 4341, pp. 286\u2013297. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11958239_19"},{"key":"13_CR49","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1007\/978-3-540-76788-6_2","volume-title":"Information Security and Cryptology - ICISC 2007","author":"J Lu","year":"2007","unstructured":"Lu, J.: Cryptanalysis of reduced versions of the HIGHT block cipher from CHES 2006. In: Nam, K.-H., Rhee, G. (eds.) ICISC 2007. LNCS, vol. 4817, pp. 11\u201326. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-76788-6_2"},{"key":"13_CR50","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/978-3-642-24209-0_4","volume-title":"Information Security and Cryptology - ICISC 2010","author":"B Koo","year":"2011","unstructured":"Koo, B., Hong, D., Kwon, D.: Related-key attack on the full HIGHT. In: Rhee, K.-H., Nyang, D.H. (eds.) ICISC 2010. LNCS, vol. 6829, pp. 49\u201367. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-24209-0_4"},{"key":"13_CR51","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1007\/BFb0028479","volume-title":"Information and Communications Security","author":"J Kelsey","year":"1997","unstructured":"Kelsey, J., Schneier, B., Wagner, D.: Related-key cryptanalysis of 3-WAY, Biham-DES,CAST, DES-X, NewDES, RC2, and TEA. In: Han, Y., Okamoto, T., Qing, S. (eds.) ICICS 1997. LNCS, vol. 1334, pp. 233\u2013246. Springer, Heidelberg (1997). https:\/\/doi.org\/10.1007\/BFb0028479"},{"key":"13_CR52","unstructured":"ISO\/IEC 18033\u20133:2010. Information technology - Security techniques - Encryption algorithms - Part 3: Block ciphers. Standard, International Organization for Standardization, March 2010"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 ASIACRYPT 2020"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-64837-4_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T18:29:00Z","timestamp":1710354540000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-64837-4_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030648367","9783030648374"],"references-count":52,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-64837-4_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"6 December 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ASIACRYPT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on the Theory and Application of Cryptology and Information Security","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Daejeon","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Korea (Republic of)","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 December 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 December 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"asiacrypt2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/asiacrypt.iacr.org\/2020\/","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":"websubrev","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"316","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":"85","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":"27% - 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","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":"19","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)"}},{"value":"The conference will take place virtually due to the COVID-19 pandemic.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}