{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T11:17:20Z","timestamp":1725794240612},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319067339"},{"type":"electronic","value":"9783319067346"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-06734-6_5","type":"book-chapter","created":{"date-parts":[[2014,5,21]],"date-time":"2014-05-21T00:22:02Z","timestamp":1400631722000},"page":"69-87","source":"Crossref","is-referenced-by-count":7,"title":["Differential Biases in Reduced-Round Keccak"],"prefix":"10.1007","author":[{"given":"Sourav","family":"Das","sequence":"first","affiliation":[]},{"given":"Willi","family":"Meier","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"5_CR1","unstructured":"Aumasson, J.P., Meier, W.: Zero-sum distinguishers for reduced Keccak-f and for the core functions of Luffa and Hamsi. NIST Mailing List (2009)"},{"key":"5_CR2","doi-asserted-by":"crossref","unstructured":"Bellare, M., Rogaway, P.: Random Oracles are Practical: A Paradigm for Designing Efficient Protocols. In: CCS, Proceedings of the 1st ACM Conference on Computer and Communications Security, pp. 62\u201373. ACM (1993)","DOI":"10.1145\/168588.168596"},{"key":"5_CR3","unstructured":"Bernstein, D.J.: Second preimages for 6 (7?(8??)) rounds of keccak? NIST Mailing List (2010)"},{"key":"5_CR4","unstructured":"Bertoni, G., Daemen, J., Peeters, M., Van Assche, G.: The Keccak SHA-3 submission. Submission to NIST, Round 3 (2011)"},{"key":"5_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-19574-7_1","volume-title":"Selected Areas in Cryptography","author":"C. Boura","year":"2011","unstructured":"Boura, C., Canteaut, A.: Zero-Sum Distinguishers for Iterated Permutations and Application to Keccak-f and Hamsi-256. In: Biryukov, A., Gong, G., Stinson, D.R. (eds.) SAC 2010. LNCS, vol.\u00a06544, pp. 1\u201317. Springer, Heidelberg (2011)"},{"key":"5_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"252","DOI":"10.1007\/978-3-642-21702-9_15","volume-title":"Fast Software Encryption","author":"C. Boura","year":"2011","unstructured":"Boura, C., Canteaut, A., De Canni\u00e8re, C.: Higher Order Differential Properties of Keccak and Luffa. In: Joux, A. (ed.) FSE 2011. LNCS, vol.\u00a06733, pp. 252\u2013269. Springer, Heidelberg (2011)"},{"key":"5_CR7","doi-asserted-by":"crossref","unstructured":"Chang, S., Perlner, R., Burr, W.E., Turan, M.S., Kelsey, J.M., Paul, S., Bassham, L.E.: Third-Round Report of the SHA-3 Cryptographic Hash Algorithm Competition (2012), \n                    \n                      http:\/\/csrc.nist.gov\/groups\/ST\/hash\/sha-3\/Round3\/documents\/Round3ReportNISTIR7896.pdf","DOI":"10.6028\/NIST.IR.7896"},{"key":"5_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"422","DOI":"10.1007\/978-3-642-34047-5_24","volume-title":"Fast Software Encryption","author":"J. Daemen","year":"2012","unstructured":"Daemen, J., Van Assche, G.: Differential Propagation Analysis of Keccak. In: Canteaut, A. (ed.) FSE 2012. LNCS, vol.\u00a07549, pp. 422\u2013441. Springer, Heidelberg (2012)"},{"key":"5_CR9","unstructured":"Dinur, I., Dunkelman, O., Shamir, A.: Improved Practical Attacks on Round-Reduced Keccak. To appear in Journal of Cryptology"},{"key":"5_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"442","DOI":"10.1007\/978-3-642-34047-5_25","volume-title":"Fast Software Encryption","author":"I. Dinur","year":"2012","unstructured":"Dinur, I., Dunkelman, O., Shamir, A.: New Attacks on Keccak-224 and Keccak-256. In: Canteaut, A. (ed.) FSE 2012. LNCS, vol.\u00a07549, pp. 442\u2013461. Springer, Heidelberg (2012)"},{"key":"5_CR11","doi-asserted-by":"crossref","unstructured":"Dinur, I., Dunkelman, O., Shamir, A.: Collision Attacks on Up to 5 Rounds of SHA-3 Using Generalized Internal Differentials. In: FSE 2013. LNCS (2013)","DOI":"10.1007\/978-3-662-43933-3_12"},{"key":"5_CR12","unstructured":"Duan, M., Lai, X.: Improved Zero-Sum Distinguisher for Full Round Keccak-f Permutation. Cryptology ePrint Archive, Report 2011\/023 (2011)"},{"key":"5_CR13","doi-asserted-by":"crossref","unstructured":"Duc, A., et al.: Unaligned Rebound Attack \u2013 Application to Keccak, \n                    \n                      http:\/\/eprint.iacr.org\/2011\/420","DOI":"10.1007\/978-3-642-34047-5_23"},{"key":"5_CR14","unstructured":"Morawiecki, P., Pieprzyk, J., Srebrny, M., Straus, M.: Preimage attacks on the round-reduced Keccak with the aid of differential cryptanalysis. Cryptology ePrint Archive, \n                    \n                      http:\/\/eprint.iacr.org\/2013\/561.pdf"},{"key":"5_CR15","doi-asserted-by":"crossref","unstructured":"Morawiecki, P., Pieprzyk, J., Srebrny, M.: Rotational cryptanalysis of round-reduced Keccak. In: FSE (2013), \n                    \n                      http:\/\/eprint.iacr.org\/2012\/546.pdf","DOI":"10.1007\/978-3-662-43933-3_13"},{"key":"5_CR16","unstructured":"National Institute of Standards and Technology. FIPS 180-1: Secure Hash Standard (April 1995), \n                    \n                      http:\/\/csrc.nist.gov"},{"key":"5_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1007\/978-3-642-25578-6_18","volume-title":"Progress in Cryptology \u2013 INDOCRYPT 2011","author":"M. Naya-Plasencia","year":"2011","unstructured":"Naya-Plasencia, M., R\u00f6ck, A., Meier, W.: Practical Analysis of Reduced-Round Keccak. In: Bernstein, D.J., Chatterjee, S. (eds.) INDOCRYPT 2011. LNCS, vol.\u00a07107, pp. 236\u2013254. Springer, Heidelberg (2011)"},{"key":"5_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"370","DOI":"10.1007\/978-3-642-14623-7_20","volume-title":"Advances in Cryptology \u2013 CRYPTO 2010","author":"T. Peyrin","year":"2010","unstructured":"Peyrin, T.: Improved Differential Attacks for ECHO and Gr\u00f8stl. In: Rabin, T. (ed.) CRYPTO 2010. LNCS, vol.\u00a06223, pp. 370\u2013392. Springer, Heidelberg (2010)"},{"key":"5_CR19","doi-asserted-by":"crossref","unstructured":"Rivest, R.L.: The MD5 message-digest algorithm. Request for Comments (RFC) 1320, Internet Activities Board, Internet Privacy Task Force (April 1992)","DOI":"10.17487\/rfc1321"},{"key":"5_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/11535218_2","volume-title":"Advances in Cryptology \u2013 CRYPTO 2005","author":"X. Wang","year":"2005","unstructured":"Wang, X., Yin, Y.L., Yu, H.: Finding Collisions in the Full SHA-1. In: Shoup, V. (ed.) CRYPTO 2005. LNCS, vol.\u00a03621, pp. 17\u201336. Springer, Heidelberg (2005)"},{"key":"5_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/11426639_2","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2005","author":"X. Wang","year":"2005","unstructured":"Wang, X., Yu, H.: How to Break MD5 and Other Hash Functions. In: Cramer, R. (ed.) EUROCRYPT 2005. LNCS, vol.\u00a03494, pp. 19\u201335. Springer, Heidelberg (2005)"}],"container-title":["Lecture Notes in Computer Science","Progress in Cryptology \u2013 AFRICACRYPT 2014"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-06734-6_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,26]],"date-time":"2019-05-26T17:35:44Z","timestamp":1558892144000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-06734-6_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319067339","9783319067346"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-06734-6_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}