{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T01:05:00Z","timestamp":1772240700395,"version":"3.50.1"},"reference-count":31,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2017,12,4]],"date-time":"2017-12-04T00:00:00Z","timestamp":1512345600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Cryptogr. Commun."],"published-print":{"date-parts":[[2018,11]]},"DOI":"10.1007\/s12095-017-0268-z","type":"journal-article","created":{"date-parts":[[2017,12,4]],"date-time":"2017-12-04T01:15:41Z","timestamp":1512350141000},"page":"1137-1163","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Multiple (Truncated) Differential Cryptanalysis: Explicit Upper Bounds on Data Complexity"],"prefix":"10.1007","volume":"10","author":[{"given":"Subhabrata","family":"Samajder","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5346-2650","authenticated-orcid":false,"given":"Palash","family":"Sarkar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,12,4]]},"reference":[{"key":"268_CR1","doi-asserted-by":"crossref","unstructured":"Albrecht. M.R., Leander, G.: An all-in-one approach to differential cryptanalysis for small block ciphers. In: Selected Areas in Cryptography. Lecture Notes in Computer Science, Springer vol. 7707, pp 1\u201315 (2012)","DOI":"10.1007\/978-3-642-35999-6_1"},{"key":"268_CR2","doi-asserted-by":"crossref","unstructured":"Baign\u00e8res, T., Junod, P., Vaudenay, S.: How far can we go beyond linear cryptanalysis?. In: Advances in Cryptology\u2013ASIACRYPT 2004, pp 432\u2013450. Springer (2004)","DOI":"10.1007\/978-3-540-30539-2_31"},{"key":"268_CR3","doi-asserted-by":"crossref","unstructured":"Biham, E., Biryukov, A., Shamir, A.: Cryptanalysis of skipjack reduced to 31 rounds using impossible differentials. In: Advances in Cryptology\u2013Eurocrypt\u201999, pp 12\u201323. Springer (1999)","DOI":"10.1007\/3-540-48910-X_2"},{"key":"268_CR4","doi-asserted-by":"crossref","unstructured":"Biham, E., Shamir, A.: Differential cryptanalysis of DES-Like cryptosystems. In: Advances in Cryptology\u2013CRYPTO\u201990, pp 2\u201321. Springer (1990)","DOI":"10.1007\/3-540-38424-3_1"},{"issue":"1","key":"268_CR5","doi-asserted-by":"crossref","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 Cryptology 4(1), 3\u201372 (1991)","journal-title":"J Cryptology"},{"key":"268_CR6","doi-asserted-by":"crossref","unstructured":"Biryukov, A., Canni\u00e8re, C.D., Quisquater, M.: On multiple linear approximations. In: Advances in Cryptology\u2013CRYPTO 2004, pp 1\u201322. Springer (2004)","DOI":"10.1007\/978-3-540-28628-8_1"},{"key":"268_CR7","doi-asserted-by":"crossref","unstructured":"Blondeau, C., G\u00e9rard, B.: Multiple differential cryptanalysis: theory and practice. In: Fast Software Encryption, pp 35\u201354. Springer (2011)","DOI":"10.1007\/978-3-642-21702-9_3"},{"key":"268_CR8","doi-asserted-by":"crossref","unstructured":"Blondeau, C., G\u00e9rard, B., : Multiple differential cryptanalysis: theory and practice (Corrected) Technical report. http:\/\/eprint.iacr.org\/2011\/115 (2011)","DOI":"10.1007\/978-3-642-21702-9_3"},{"key":"268_CR9","doi-asserted-by":"crossref","unstructured":"Blondeau, C., G\u00e9rard, B., Nyberg, K.: Multiple differential cryptanalysis using LLR and \u03c7 2 statistics. In: Security and Cryptography for Networks, pp 343\u2013360. Springer (2012)","DOI":"10.1007\/978-3-642-32928-9_19"},{"issue":"1-3","key":"268_CR10","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/s10623-010-9452-2","volume":"59","author":"C Blondeau","year":"2011","unstructured":"Blondeau, C., G\u00e9rard, B., Tillich, J.-P.: Accurate estimates of the data complexity and success probability for various cryptanalyses. Des. Codes Crypt. 59 (1-3), 3\u201334 (2011)","journal-title":"Des. Codes Crypt."},{"key":"268_CR11","doi-asserted-by":"publisher","unstructured":"Bogdanov, A., Leander, G., Nyberg, K., Wang, M.: Integral and multidimensional linear distinguishers with correlation zero. In: Wang, X., Sako, K. (eds.) Advances in Cryptology - ASIACRYPT 2012 - 18th International Conference on the Theory and Application of Cryptology and Information Security, Beijing, China, December 2-6, 2012. Proceedings, volume 7658 of Lecture Notes in Computer Science. https:\/\/doi.org\/10.1007\/978-3-642-34961-4_16 , ISBN: 978-3-642-34960-7, pp 244\u2013261. Springer (2012)","DOI":"10.1007\/978-3-642-34961-4_16"},{"key":"268_CR12","doi-asserted-by":"publisher","unstructured":"Bogdanov, A., Geng, H., Wang, M., Wen, L., Collard, B.: Zero-correlation linear cryptanalysis with fft and improved attacks on ISO standards camellia and CLEFIA. In: Lange, T., Lauter, K.E., Lisonek, P. (eds.) Selected Areas in Cryptography - SAC 2013 - 20th International Conference, Burnaby, BC, Canada, August 14-16, 2013, Revised Selected Papers, volume 8282 of Lecture Notes in Computer Science. https:\/\/doi.org\/10.1007\/978-3-662-43414-7_16 , ISBN: 978-3-662-43413-0, pp 306\u2013323. Springer (2013)","DOI":"10.1007\/978-3-662-43414-7_16"},{"issue":"2","key":"268_CR13","doi-asserted-by":"crossref","first-page":"683","DOI":"10.1007\/s10623-014-9976-y","volume":"73","author":"H Soleimany","year":"2014","unstructured":"Soleimany, H., Nyberg, K.: Zero-correlation linear cryptanalysis of reduced-round LBlock. Des. Codes Crypt. 73(2), 683\u2013698 (2014)","journal-title":"Des. Codes Crypt."},{"issue":"1","key":"268_CR14","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1049\/iet-ifs:20060099","volume":"1","author":"J Daemen","year":"2007","unstructured":"Daemen, J., Rijmen, V.: Plateau characteristics. IET Inf. Secur. 1(1), 11\u201317 (2007)","journal-title":"IET Inf. Secur."},{"key":"268_CR15","first-page":"278","volume":"2009","author":"I Dinur","year":"2009","unstructured":"Dinur, I., Shamir, A.: Cube attacks on tweakable black box polynomials. Advan. Cryptology\u2013EUROCRYPT 2009, 278\u2013299 (2009)","journal-title":"Advan. Cryptology\u2013EUROCRYPT"},{"key":"268_CR16","doi-asserted-by":"crossref","unstructured":"Hermelin, M., Cho, J.Y., Nyberg, K.: Multidimensional extension of Matsui\u2019s algorithm 2. In: Fast Software Encryption, pp 209\u2013227. Springer (2009)","DOI":"10.1007\/978-3-642-03317-9_13"},{"key":"268_CR17","doi-asserted-by":"crossref","unstructured":"Junod, P.: On the complexity of Matsui\u2019s attack. In: Selected Areas in Cryptography, pp 199\u2013211. Springer (2001)","DOI":"10.1007\/3-540-45537-X_16"},{"key":"268_CR18","doi-asserted-by":"crossref","unstructured":"Junod, P: On the optimality of linear, differential, and sequential distinguishers. In: Advances in Cryptology\u2013EUROCRYPT 2003, pp 17\u201332. Springer (2003)","DOI":"10.1007\/3-540-39200-9_2"},{"key":"268_CR19","doi-asserted-by":"crossref","unstructured":"Junod, P., Vaudenay, S.: Optimal key ranking procedures in a statistical cryptanalysis. In: Fast Software Encryption, pp 235\u2013246. Springer (2003)","DOI":"10.1007\/978-3-540-39887-5_18"},{"key":"268_CR20","doi-asserted-by":"crossref","unstructured":"Kaliski, B.S. Jr, Robshaw, M.J.B.: Linear cryptanalysis using multiple approximations. In: Advances in Cryptology\u2013Crypto\u201994, pp 26\u201339. Springer (1994)","DOI":"10.1007\/3-540-48658-5_4"},{"key":"268_CR21","doi-asserted-by":"crossref","unstructured":"Knudsen, L.R.: Truncated and higher order differentials. In: Fast Software Encryption, pp 196\u2013211. Springer (1995)","DOI":"10.1007\/3-540-60590-8_16"},{"key":"268_CR22","doi-asserted-by":"crossref","unstructured":"Lai, X.: Higher order derivatives and differential cryptanalysis. In: Communications and Cryptography, pp 227\u2013233. Springer (1994)","DOI":"10.1007\/978-1-4615-2694-0_23"},{"key":"268_CR23","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511813603","volume-title":"Probability and Computing: Randomized Algorithms And Probabilistic Analysis","author":"M Mitzenmacher","year":"2005","unstructured":"Mitzenmacher, M., Upfal, E.: Probability and Computing: Randomized Algorithms And Probabilistic Analysis. Cambridge University Press, Cambridge (2005)"},{"key":"268_CR24","volume-title":"Randomized Algorithms","author":"R Motwani","year":"2010","unstructured":"Motwani, R., Raghavan, P.: Randomized Algorithms. Chapman & hall\/CRC, USA (2010)"},{"key":"268_CR25","unstructured":"Murphy, S.: The Analysis of Simultaneous Differences in Differential Cryptanalysis. Technical Report RHUL-MA-2012-13, Royal Holloway, University of London. Availabel at http:\/\/www.isg.rhul.ac.uk\/sean\/SimDiffA.pdf (2011)"},{"key":"268_CR26","unstructured":"Samajder, S., Sarkar, P.: Rigorous Upper Bounds on Data Complexities of Block Cipher Cryptanalysis. IACR Cryptology ePrint Archive, 2015.916. http:\/\/eprint.iacr.org\/2015\/916 (2015)"},{"key":"268_CR27","doi-asserted-by":"publisher","unstructured":"Samajder, S., Sarkar, P.: Another Look at Normal Approximations in Cryptanalysis. Journal of Mathematical Cryptology. ISSN (Online) 1862-2984, ISSN (Print) 1862-2976. https:\/\/doi.org\/10.1515\/jmc-2016-0006 (2016)","DOI":"10.1515\/jmc-2016-0006"},{"key":"268_CR28","unstructured":"Samajder, S., Sarkar, P.: Can large deviation theory be used for estimating data complexity? Cryptology ePrint Archive Report 2016\/465. http:\/\/eprint.iacr.org\/ (2016)"},{"issue":"1","key":"268_CR29","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1007\/s00145-007-9013-7","volume":"21","author":"AA Sel\u00e7uk","year":"2008","unstructured":"Sel\u00e7uk, A.A.: On probability of success in linear and differential cryptanalysis. J. Cryptol. 21(1), 131\u2013147 (2008)","journal-title":"J. Cryptol."},{"key":"268_CR30","doi-asserted-by":"crossref","unstructured":"Tezcan, C.: The improbable differential attack: cryptanalysis of reduced round CLEFIA. In: Progress in Cryptology-INDOCRYPT 2010, pp 197\u2013209. Springer (2010)","DOI":"10.1007\/978-3-642-17401-8_15"},{"key":"268_CR31","doi-asserted-by":"crossref","unstructured":"Wagner, D.: The boomerang attack. In: Fast Software Encryption, pp 156\u2013170. Springer (1999)","DOI":"10.1007\/3-540-48519-8_12"}],"container-title":["Cryptography and Communications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s12095-017-0268-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12095-017-0268-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12095-017-0268-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,7]],"date-time":"2019-10-07T05:18:23Z","timestamp":1570425503000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s12095-017-0268-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,12,4]]},"references-count":31,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2018,11]]}},"alternative-id":["268"],"URL":"https:\/\/doi.org\/10.1007\/s12095-017-0268-z","relation":{},"ISSN":["1936-2447","1936-2455"],"issn-type":[{"value":"1936-2447","type":"print"},{"value":"1936-2455","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,12,4]]}}}