Meet-in-the-middle attacks on SHA-3 candidates

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5665 LNCS, Issue , 2009, Pages 228-245

  Khovratovich, Dmitry ^a   Nikolić, Ivica ^a   Weinmann, Ralf Philipp ^a  

^a UNIVERSITY OF LUXEMBOURG   (Luxembourg)

Author keywords

[No Author keywords available]

Indexed keywords

COMPRESSION FUNCTIONS; INTERNAL STATE; MEET-IN-THE-MIDDLE; MEMORY COMPLEXITY; NON-RANDOMNESS; PREIMAGE ATTACK;

COMPUTER SOFTWARE;

CRYPTOGRAPHY;

EID: 70350364574     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-03317-9_14     Document Type: Conference Paper

References (16)

1. Bertoni, G., Daemen, J., Peeters, M., Van Assche, G.: Sponge functions (2007), http://sponge.noekeon.org/
2. De Cannière, C., Rechberger, C.: Finding SHA-1 characteristics: General results and applications. In: Lai, X., Chen, K. (eds.) ASIACRYPT 2006. LNCS, vol. 4284, pp. 1-20. Springer, Heidelberg (2006)
3. Diffie, W., Hellman, M.E.: Exhaustive cryptanalysis of the NBS data encryption standard. Computer 10, 74-84 (1977)
4. Gligoroski, D., Ødegård, R.S., Mihova, M., Knapskog, S.J., Kocarev, L., Drapai, A.: Cryptographic hash function Edon-R. Submission to NIST (2008), http://people.item.ntnu.no/danilog/Hash/Edon-R/Supporting-Documentation/ EdonRDocumentation.pdf
5. Mendel, F., Pramstaller, N., Rechberger, C., Kontak, M., Szmidt, J.: Cryptanalysis of the GOST hash function. In: Wagner, D. (ed.) CRYPTO 2008. LNCS, vol. 5157, pp. 162-178. Springer, Heidelberg (2008)
6. Morita, H., Ohta, K., Miyaguchi, S.: A switching closure test to analyze cryp-tosystems. In: Feigenbaum, J. (ed.) CRYPTO 1991. LNCS, vol. 576, pp. 183-193. Springer, Heidelberg (1992)
7. National Institute of Standards and Technology. Announcing Request for Candidate Algorithm Nominations for a New Cryptographic Hash Algorithm (SHA-3) Family 72(212) of Federal Register (November 2007)
8. O'Neil, S.: EnRUPT: First all-in-one symmetric cryptographic primitive. In: SASC 2008 (2008), http://www.ecrypt.eu.org/stvl/sasc2008/
9. O'Neil, S., Nohl, K., Henzen, L.: EnRUPT hash function specification (2008), http://enrupt.com/SHA3/
10. Preneel, B.: Analysis and Design of Cryptographic Hash Functions. PhD thesis, Katholieke Universiteit Leuven, Leuven, Belgium (January 1993)
11. Quisquater, J.-J., Delescaille, J.-P.: How easy is collision search? Application to DES (extended summary). In: Quisquater, J.-J., Vandewalle, J. (eds.) EURO-CRYPT 1989. LNCS, vol. 434, pp. 429-434. Springer, Heidelberg (1989)
12. Quisquater, J.-J., Delescaille, J.-P.: How easy is collision search, new results and applications to DES. In: Brassard, G. (ed.) CRYPTO 1989. LNCS, vol. 435, pp. 408-413. Springer, Heidelberg (1990)
13. Rose, G.G.: Design and primitive specification for Boole, http://seer-grog.net/BoolePaper.pdf
14. van Oorschot, P.C., Wiener, M.J.: Parallel collision search with application to hash functions and discrete logarithms. In: ACM Conference on Computer and Communications Security, pp. 210-218 (1994)
15. Vanci, K., Ozen, O., Kocair, Ç.: Sarmal: SHA-3 proposal. Submission to NIST (2008)
16. Wang, X., Yu, H.: How to break MD5 and other hash functions. In: Cramer, R. (ed.) EUROCRYPT 2005. LNCS, vol. 3494, pp. 19-35. Springer, Heidelberg (2005)