{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T18:01:37Z","timestamp":1725904897540},"publisher-location":"Cham","reference-count":29,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319612720"},{"type":"electronic","value":"9783319612737"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-61273-7_14","type":"book-chapter","created":{"date-parts":[[2017,7,13]],"date-time":"2017-07-13T07:22:58Z","timestamp":1499930578000},"page":"277-293","source":"Crossref","is-referenced-by-count":1,"title":["A New Test Statistic for Key Recovery Attacks Using Multiple Linear Approximations"],"prefix":"10.1007","author":[{"given":"Subhabrata","family":"Samajder","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Palash","family":"Sarkar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,7,14]]},"reference":[{"key":"14_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"432","DOI":"10.1007\/978-3-540-30539-2_31","volume-title":"Advances in Cryptology - ASIACRYPT 2004","author":"T Baign\u00e8res","year":"2004","unstructured":"Baign\u00e8res, T., Junod, P., Vaudenay, S.: How far can we go beyond linear cryptanalysis? In: Lee, P.J. (ed.) ASIACRYPT 2004. LNCS, vol. 3329, pp. 432\u2013450. Springer, Heidelberg (2004). doi:\n10.1007\/978-3-540-30539-2_31"},{"key":"14_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1007\/978-3-642-16280-0_10","volume-title":"Provable Security","author":"T Baign\u00e8res","year":"2010","unstructured":"Baign\u00e8res, T., Sepehrdad, P., Vaudenay, S.: Distinguishing distributions using chernoff information. In: Heng, S.-H., Kurosawa, K. (eds.) ProvSec 2010. LNCS, vol. 6402, pp. 144\u2013165. Springer, Heidelberg (2010). doi:\n10.1007\/978-3-642-16280-0_10"},{"key":"14_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-28628-8_1","volume-title":"Advances in Cryptology \u2013 CRYPTO 2004","author":"A Biryukov","year":"2004","unstructured":"Biryukov, A., De Canni\u00e8re, C., Quisquater, M.: On multiple linear approximations. In: Franklin, M. (ed.) CRYPTO 2004. LNCS, vol. 3152, pp. 1\u201322. Springer, Heidelberg (2004). doi:\n10.1007\/978-3-540-28628-8_1"},{"key":"14_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1007\/978-3-642-32928-9_19","volume-title":"Security and Cryptography for Networks","author":"C Blondeau","year":"2012","unstructured":"Blondeau, C., G\u00e9rard, B., Nyberg, K.: Multiple differential cryptanalysis using, and \n            $$X^2$$\n           statistics. In: Visconti, I., Prisco, R. (eds.) SCN 2012. LNCS, vol. 7485, pp. 343\u2013360. Springer, Heidelberg (2012). doi:\n10.1007\/978-3-642-32928-9_19"},{"key":"14_CR5","doi-asserted-by":"publisher","unstructured":"Blondeau, C., Nyberg, K.: Joint data and key distribution of simple, multiple, and multidimensional linear cryptanalysis test statistic and its impact to data complexity. Des. Codes Crypt. 1\u201331 (2016). doi:\n10.1007\/s10623-016-0268-6\n\n, ISSN: 1573-7586","DOI":"10.1007\/s10623-016-0268-6"},{"key":"14_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/978-3-662-43933-3_2","volume-title":"Fast Software Encryption","author":"A Bogdanov","year":"2014","unstructured":"Bogdanov, A., Tischhauser, E.: On the wrong key randomisation and key equivalence hypotheses in Matsui\u2019s algorithm 2. In: Moriai, S. (ed.) FSE 2013. LNCS, vol. 8424, pp. 19\u201338. Springer, Heidelberg (2014). doi:\n10.1007\/978-3-662-43933-3_2"},{"key":"14_CR7","unstructured":"Collard, B., Standaert, F.-X., Quisquater, J.-J.: (2008). \nhttp:\/\/www.dice.ucl.ac.be\/fstandae\/PUBLIS\/50b.zip\n\n. Accessed 30 July 2014"},{"key":"14_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"382","DOI":"10.1007\/978-3-540-71039-4_24","volume-title":"Fast Software Encryption","author":"B Collard","year":"2008","unstructured":"Collard, B., Standaert, F.-X., Quisquater, J.-J.: Experiments on the multiple linear cryptanalysis of reduced round serpent. In: Nyberg, K. (ed.) FSE 2008. LNCS, vol. 5086, pp. 382\u2013397. Springer, Heidelberg (2008). doi:\n10.1007\/978-3-540-71039-4_24"},{"issue":"3","key":"14_CR9","first-page":"221","volume":"1","author":"J Daemen","year":"2007","unstructured":"Daemen, J., Rijmen, V.: Probability distributions of correlation and differentials in block ciphers. J. Math. Crypt. JMC 1(3), 221\u2013242 (2007)","journal-title":"J. Math. Crypt. JMC"},{"key":"14_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"112","DOI":"10.1007\/978-3-642-10868-6_8","volume-title":"Cryptography and Coding","author":"B G\u00e9rard","year":"2009","unstructured":"G\u00e9rard, B., Tillich, J.-P.: On linear cryptanalysis with many linear approximations. In: Parker, M.G. (ed.) IMACC 2009. LNCS, vol. 5921, pp. 112\u2013132. Springer, Heidelberg (2009). doi:\n10.1007\/978-3-642-10868-6_8"},{"key":"14_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BFb0052330","volume-title":"Fast Software Encryption","author":"H Handschuh","year":"1997","unstructured":"Handschuh, H., Gilbert, H.: \n            $$\\chi ^2$$\n           cryptanalysis of the SEAL encryption algorithm. In: Biham, E. (ed.) FSE 1997. LNCS, vol. 1267, pp. 1\u201312. Springer, Heidelberg (1997). doi:\n10.1007\/BFb0052330"},{"key":"14_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1007\/3-540-49264-X_3","volume-title":"Advances in Cryptology \u2014 EUROCRYPT 1995","author":"C Harpes","year":"1995","unstructured":"Harpes, C., Kramer, G.G., Massey, J.L.: A generalization of linear cryptanalysis and the applicability of Matsui\u2019s piling-up lemma. In: Guillou, L.C., Quisquater, J.-J. (eds.) EUROCRYPT 1995. LNCS, vol. 921, pp. 24\u201338. Springer, Heidelberg (1995). doi:\n10.1007\/3-540-49264-X_3"},{"key":"14_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1007\/978-3-540-70500-0_15","volume-title":"Information Security and Privacy","author":"M Hermelin","year":"2008","unstructured":"Hermelin, M., Cho, J.Y., Nyberg, K.: Multidimensional linear cryptanalysis of reduced round serpent. In: Mu, Y., Susilo, W., Seberry, J. (eds.) ACISP 2008. LNCS, vol. 5107, pp. 203\u2013215. Springer, Heidelberg (2008). doi:\n10.1007\/978-3-540-70500-0_15"},{"key":"14_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1007\/978-3-642-03317-9_13","volume-title":"Fast Software Encryption","author":"M Hermelin","year":"2009","unstructured":"Hermelin, M., Cho, J.Y., Nyberg, K.: Multidimensional extension of Matsui\u2019s Algorithm 2. In: Dunkelman, O. (ed.) FSE 2009. LNCS, vol. 5665, pp. 209\u2013227. Springer, Heidelberg (2009). doi:\n10.1007\/978-3-642-03317-9_13"},{"key":"14_CR15","unstructured":"Hermelin, M., Cho, J.Y., Nyberg, K.: Statistical tests for key recovery using multidimensional extension of Matsui\u2019s Algorithm 1. In: Handschuh, H., Lucks, S., Preneel, B., Rogaway, P. (ed.) Symmetric Cryptography, number 09031 in Dagstuhl Seminar Proceedings, Dagstuhl, Germany. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Germany (2009). \nhttp:\/\/drops.dagstuhl.de\/opus\/volltexte\/2009\/1954\n\n, ISSN: 1862\u20134405"},{"key":"14_CR16","doi-asserted-by":"crossref","unstructured":"Johansson, T., Maximov, A.: A linear distinguishing attack on scream. In: Proceedings 2003 IEEE International Symposium on Information Theory, p. 164. IEEE (2003)","DOI":"10.1109\/ISIT.2003.1228178"},{"key":"14_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1007\/3-540-45537-X_16","volume-title":"Selected Areas in Cryptography","author":"P Junod","year":"2001","unstructured":"Junod, P.: On the complexity of Matsui\u2019s attack. In: Vaudenay, S., Youssef, A.M. (eds.) SAC 2001. LNCS, vol. 2259, pp. 199\u2013211. Springer, Heidelberg (2001). doi:\n10.1007\/3-540-45537-X_16"},{"key":"14_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/3-540-39200-9_2","volume-title":"Advances in Cryptology \u2014 EUROCRYPT 2003","author":"P Junod","year":"2003","unstructured":"Junod, P.: On the Optimality of linear, differential, and sequential distinguishers. In: Biham, E. (ed.) EUROCRYPT 2003. LNCS, vol. 2656, pp. 17\u201332. Springer, Heidelberg (2003). doi:\n10.1007\/3-540-39200-9_2"},{"key":"14_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1007\/978-3-540-39887-5_18","volume-title":"Fast Software Encryption","author":"P Junod","year":"2003","unstructured":"Junod, P., Vaudenay, S.: Optimal key ranking procedures in a statistical cryptanalysis. In: Johansson, T. (ed.) FSE 2003. LNCS, vol. 2887, pp. 235\u2013246. Springer, Heidelberg (2003). doi:\n10.1007\/978-3-540-39887-5_18"},{"key":"14_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1007\/3-540-48658-5_4","volume-title":"Advances in Cryptology \u2014 CRYPTO 1994","author":"BS Kaliski","year":"1994","unstructured":"Kaliski, B.S., Robshaw, M.J.B.: Linear cryptanalysis using multiple approximations. In: Desmedt, Y.G. (ed.) CRYPTO 1994. LNCS, vol. 839, pp. 26\u201339. Springer, Heidelberg (1994). doi:\n10.1007\/3-540-48658-5_4"},{"key":"14_CR21","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 1993","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). doi:\n10.1007\/3-540-48285-7_33"},{"key":"14_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-48658-5_1","volume-title":"Advances in Cryptology \u2014 CRYPTO 1994","author":"M Matsui","year":"1994","unstructured":"Matsui, M.: The first experimental cryptanalysis of the data encryption standard. In: Desmedt, Y.G. (ed.) CRYPTO 1994. LNCS, vol. 839, pp. 1\u201311. Springer, Heidelberg (1994). doi:\n10.1007\/3-540-48658-5_1"},{"key":"14_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)"},{"issue":"12","key":"14_CR24","doi-asserted-by":"crossref","first-page":"5510","DOI":"10.1109\/TIT.2006.885528","volume":"52","author":"S Murphy","year":"2006","unstructured":"Murphy, S.: The independence of linear approximations in symmetric cryptanalysis. IEEE Trans. Inform. Theory 52(12), 5510\u20135518 (2006)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"14_CR25","doi-asserted-by":"crossref","unstructured":"Nyberg, K., Hermelin, M.: Multidimensional walsh transform and a characterization of bent functions. In: Proceedings of the 2007 IEEE Information Theory Workshop on Information Theory for Wireless Networks, pp. 83\u201386 (2007)","DOI":"10.1109\/ITWITWN.2007.4318037"},{"key":"14_CR26","unstructured":"Samajder, S., Sarkar, P.: Rigorous upper bounds on data complexities of block cipher cryptanalysis. IACR Cryptology ePrint Archive, 2015:916 (2015). \nhttp:\/\/eprint.iacr.org\/2015\/916"},{"key":"14_CR27","doi-asserted-by":"publisher","unstructured":"Samajder, S., Sarkar, P.: Another Look at Normal Approximations in Cryptanalysis. J. Math. Crypt. (2016). doi:\n10.1515\/jmc-2016-0006","DOI":"10.1515\/jmc-2016-0006"},{"key":"14_CR28","unstructured":"Samajder, S., Sarkar, P.: Can large deviation theory be used for estimating data complexity? Cryptology ePrint Archive, Report 2016\/465 (2016). \nhttp:\/\/eprint.iacr.org\/"},{"issue":"1","key":"14_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."}],"container-title":["Lecture Notes in Computer Science","Paradigms in Cryptology \u2013 Mycrypt 2016. Malicious and Exploratory Cryptology"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-61273-7_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,7,13]],"date-time":"2017-07-13T07:27:01Z","timestamp":1499930821000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-61273-7_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319612720","9783319612737"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-61273-7_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}