{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:21:20Z","timestamp":1740122480087,"version":"3.37.3"},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"12","license":[{"start":{"date-parts":[[2023,8,3]],"date-time":"2023-08-03T00:00:00Z","timestamp":1691020800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,8,3]],"date-time":"2023-08-03T00:00:00Z","timestamp":1691020800000},"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":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2023,12]]},"DOI":"10.1007\/s10623-023-01272-y","type":"journal-article","created":{"date-parts":[[2023,8,3]],"date-time":"2023-08-03T11:01:57Z","timestamp":1691060517000},"page":"3837-3855","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Another look at key randomisation hypotheses"],"prefix":"10.1007","volume":"91","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5737-2281","authenticated-orcid":false,"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":[[2023,8,3]]},"reference":[{"key":"1272_CR1","first-page":"990","volume":"2016","author":"T Ashur","year":"2016","unstructured":"Ashur T., Beyne T., Rijmen V.: Revisiting the wrong-key-randomization hypothesis. IACR Cryptol. ePrint Arch. 2016, 990 (2016).","journal-title":"IACR Cryptol. ePrint Arch."},{"issue":"1\u20132","key":"1272_CR2","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1007\/s10623-016-0268-6","volume":"82","author":"C Blondeau","year":"2017","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 Cryptogr. 82(1\u20132), 319\u2013349 (2017).","journal-title":"Des. Codes Cryptogr."},{"key":"1272_CR3","doi-asserted-by":"crossref","unstructured":"Bogdanov, A., Tischhauser, E.: On the wrong key randomisation and key equivalence hypotheses in Matsui\u2019s algorithm 2. In: Moriai S (ed) Fast Software Encryption\u201420th International Workshop, FSE 2013, Singapore, March 11\u201313, 2013. Revised Selected Papers, volume 8424 of Lecture Notes in Computer Science, pp. 19\u201338. Springer (2013)","DOI":"10.1007\/978-3-662-43933-3_2"},{"key":"1272_CR4","doi-asserted-by":"publisher","first-page":"592","DOI":"10.1016\/j.cam.2013.10.020","volume":"259","author":"A Bogdanov","year":"2014","unstructured":"Bogdanov A., Kavun E.B., Tischhauser E., Yal\u00e7in T.: Large-scale high-resolution computational validation of novel complexity models in linear cryptanalysis. J. Comput. Appl. Math. 259, 592\u2013598 (2014).","journal-title":"J. Comput. Appl. Math."},{"issue":"3","key":"1272_CR5","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1515\/JMC.2007.011","volume":"1","author":"J Daemen","year":"2007","unstructured":"Daemen J., Rijmen V.: Probability distributions of correlation and differentials in block ciphers. J. Math. Cryptol. 1(3), 221\u2013242 (2007).","journal-title":"J. Math. Cryptol."},{"key":"1272_CR6","doi-asserted-by":"crossref","unstructured":"Harpes, C., Kramer, G.\u00a0G., Massey, J.\u00a0L.: A generalization of linear cryptanalysis and the applicability of Matsui\u2019s piling-up lemma. In: Guillou L. C., Quisquater J.-J. (eds.) Advances in Cryptology\u2014EUROCRYPT \u201995, International Conference on the Theory and Application of Cryptographic Techniques, Saint-Malo, France, May 21\u201325, 1995, Proceeding, volume 921 of Lecture Notes in Computer Science, pp. 24\u201338, Springer (1995)","DOI":"10.1007\/3-540-49264-X_3"},{"key":"1272_CR7","doi-asserted-by":"crossref","unstructured":"Junod, P., Vaudenay, S.: Optimal key ranking procedures in a statistical cryptanalysis. In: Johansson, T. (ed) Fast Software Encryption, 10th International Workshop, FSE 2003, Lund, Sweden, February 24\u201326, 2003, Revised Papers, volume 2887 of Lecture Notes in Computer Science, pp. 235\u2013246, Springer (2003)","DOI":"10.1007\/978-3-540-39887-5_18"},{"key":"1272_CR8","doi-asserted-by":"crossref","unstructured":"Kaliski Jr, B. S., Robshaw, M. J.\u00a0B.: Linear cryptanalysis using multiple approximations. In: Desmedt, Y. (ed) Advances in Cryptology\u2014CRYPTO \u201994, 14th Annual International Cryptology Conference, Santa Barbara, California, USA, August 21\u201325, 1994, Proceedings, volume 839 of Lecture Notes in Computer Science, pp. 26\u201339, Springer (1994)","DOI":"10.1007\/3-540-48658-5_4"},{"key":"1272_CR9","first-page":"143","volume":"2010","author":"G Leander","year":"2010","unstructured":"Leander G.: Small scale variants of the block cipher PRESENT. IACR Cryptol. ePrint Arch. 2010, 143 (2010).","journal-title":"IACR Cryptol. ePrint Arch."},{"key":"1272_CR10","doi-asserted-by":"crossref","unstructured":"Matsui, M.: Linear cryptanalysis method for DES cipher. In: Helleseth, T. (ed) Advances in Cryptology\u2014EUROCRYPT \u201993, Workshop on the Theory and Application of of Cryptographic Techniques, Lofthus, Norway, May 23\u201327, 1993, Proceedings, volume 765 of Lecture Notes in Computer Science, pp. 386\u2013397, Springer (1993)","DOI":"10.1007\/3-540-48285-7_33"},{"key":"1272_CR11","doi-asserted-by":"crossref","unstructured":"Matsui, M.: The first experimental cryptanalysis of the data encryption standard. In: Desmedt, Y, (ed) Advances in Cryptology\u2014CRYPTO \u201994, 14th Annual International Cryptology Conference, Santa Barbara, California, USA, August 21\u201325, 1994, Proceedings, volume 839 of Lecture Notes in Computer Science, pp. 1\u201311, Springer (1994)","DOI":"10.1007\/3-540-48658-5_1"},{"key":"1272_CR12","unstructured":"O\u2019Connor, L.: Properties of linear approximation tables. In: Preneel, B. (ed) Fast Software Encryption: Second International Workshop. Leuven, Belgium, 14\u201316 December 1994, Proceedings, volume 1008 of Lecture Notes in Computer Science, pp. 131\u2013136, Springer (1994)"},{"issue":"2","key":"1272_CR13","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1515\/jmc-2016-0006","volume":"10","author":"S Samajder","year":"2016","unstructured":"Samajder S., Sarkar P.: Another look at normal approximations in cryptanalysis. J. Math. Cryptol. 10(2), 69\u201399 (2016).","journal-title":"J. Math. Cryptol."},{"key":"1272_CR14","first-page":"1219","volume":"2017","author":"S Samajder","year":"2017","unstructured":"Samajder S., Sarkar P.: Correlations between (nonlinear) combiners of input and output of random functions and permutations. IACR Cryptol. ePrint Arch. 2017, 1219 (2017).","journal-title":"IACR Cryptol. ePrint Arch."},{"issue":"5","key":"1272_CR15","doi-asserted-by":"publisher","first-page":"835","DOI":"10.1007\/s12095-017-0257-2","volume":"10","author":"S Samajder","year":"2018","unstructured":"Samajder S., Sarkar P.: Success probability of multiple\/multidimensional linear cryptanalysis under general key randomisation hypotheses. Cryptogr. Commun. 10(5), 835\u2013879 (2018).","journal-title":"Cryptogr. Commun."},{"issue":"4","key":"1272_CR16","doi-asserted-by":"publisher","first-page":"645","DOI":"10.3934\/amc.2019040","volume":"13","author":"S Samajder","year":"2019","unstructured":"Samajder S., Sarkar P.: Another look at success probability of linear cryptanalysis. Adv. Math. Commun. 13(4), 645\u2013688 (2019).","journal-title":"Adv. Math. Commun."},{"issue":"1","key":"1272_CR17","doi-asserted-by":"publisher","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":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-023-01272-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10623-023-01272-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-023-01272-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,4]],"date-time":"2023-11-04T12:04:43Z","timestamp":1699099483000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10623-023-01272-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,8,3]]},"references-count":17,"journal-issue":{"issue":"12","published-print":{"date-parts":[[2023,12]]}},"alternative-id":["1272"],"URL":"https:\/\/doi.org\/10.1007\/s10623-023-01272-y","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"type":"print","value":"0925-1022"},{"type":"electronic","value":"1573-7586"}],"subject":[],"published":{"date-parts":[[2023,8,3]]},"assertion":[{"value":"24 February 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 March 2021","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 June 2023","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 August 2023","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}