Constructing cryptographic hash functions from fixed-key blockciphers

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

Volumn 5157 LNCS, Issue , 2008, Pages 433-450

  Rogaway, Phillip ^a   Steinberger, John ^b  

^a University of California Davis   (United States)

^b UNIVERSITY OF BRITISH COLUMBIA   (Canada)

Author keywords

Blockcipher based hashing; Collision resistant hashing; Compression functions; Cryptographic hash functions; Ideal cipher model

Indexed keywords

DATA COMPRESSION; FUNCTIONS;

BLOCKCIPHER-BASED HASHING; CIPHER MODEL; COLLISION-RESISTANT HASHING; COMPRESSION FUNCTIONS; CRYPTOGRAPHIC HASH FUNCTIONS; CRYPTOLOGY; IDEAL-CIPHER MODEL; UPPER BOUNDS;

CRYPTOGRAPHY;

EID: 51849087663     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-85174-5_24     Document Type: Conference Paper

References (30)

1. Andreeva, E., Neven, G., Preneel, B., Shrimpton, T.: Seven-property preserving iterated hashing: ROX. In: Kurosawa, K. (ed.) ASIACRYPT 2007. LNCS, vol. 4833, pp. 130-146. Springer, Heidelberg (2007)
2. Bellare, M., Ristenpart, T.: Hash functions in the dedicated-key setting: design choices and MPP transforms. In: Arge, L., Cachin, C., Jurdziński, T., Tarlecki, A. (eds.) ICALP 2007. LNCS, vol. 4596, pp. 399-410. Springer, Heidelberg (2007)
3. Bellare, M., Ristenpart, T.: Multi-property-preserving hash domain extension and the EMD transform. In: Lai, X., Chen, K. (eds.) ASIACRYPT 2006. LNCS, vol. 4284, pp. 299-314. Springer, Heidelberg (2006)
4. Bertoni, G., Daemen, J., Peeters, M., Van Assche, G.: On the indifferentiability of the sponge construction. In: Smart, N. (ed.) EUROCRYPT 2008. LNCS, vol. 4965, pp. 181-197. Springer, Heidelberg (2008)
5. Bertoni, G., Daemen, J., Peeters, M., Van Assche, G.: Sponge functions. In: Ecrypt Hash Workshop (2007), http://sponge.noekeon.org/
6. Black, J., Cochran, M., Shrimpton, T.: On the impossibility of highly-efficient blockcipher-based hash functions. In: Cramer, R. (ed.) EUROCRYPT 2005. LNCS, vol. 3494, pp. 526-541. Springer, Heidelberg (2005)
7. Black, J., Rogaway, P., Shrimpton, T.: Black-box analysis of the block-cipher-based hash function constructions from PGV. In: Yung, M. (ed.) CRYPTO 2002. LNCS, vol. 2442, pp. 320-335. Springer, Heidelberg (2002)
8. Coron, J., Dodis, Y., Malinaud, C., Puniya, P.: Merkle-Damgård revisited: how to construct a hash function. In: Shoup, V. (ed.) CRYPTO 2005. LNCS, vol. 3621, pp. 430-448. Springer, Heidelberg (2005)
9. Damgård, I.: A design principle for hash functions. In: Brassard, G. (ed.) CRYPTO 1989. LNCS, vol. 435, pp. 416-427. Springer, Heidelberg (1990)
10. Dodis, Y., Pietrzak, K., Puniya, P.: A new mode of operation for block ciphers and length-preserving MACs. In: Smart, N. (ed.) EUROCRYPT 2008. LNCS, vol. 4965, pp. 198-219. Springer, Heidelberg (2008)
11. Hirose, S.: Some plausible construction of double-block-length hash functions. In: Robshaw, M. (ed.) FSE 2006. LNCS, vol. 4047, pp. 210-225. Springer, Heidelberg (2006)
12. Hattori, M., Hirose, S., Yoshida, S.: Analysis of double block length hash functions. In: Paterson, K.G. (ed.) Cryptography and Coding 2003. LNCS, vol. 2898, pp. 290-302. Springer, Heidelberg (2003)
13. Joux, A.: Multicollisions in iterated hash functions. In: Franklin, M. (ed.) CRYPTO 2004. LNCS, vol. 3152, pp. 306-316. Springer, Heidelberg (2004)
14. Knudsen, L., Lai, X., Preneel, B.: Attacks on fast double block length hash functions. Journal of Cryptology 11(1), 59-72 (1998)
15. Lucks, S.: A failure-friendly design principle for hash functions. In: Roy, B. (ed.) ASIACRYPT 2005. LNCS, vol. 3788, pp. 474-494. Springer, Heidelberg (2005)
16. Matyas, S., Meyer, C., Oseas, J.: Generating strong one-way functions with cryptographic algorithm. IBM Tech. Disclosure Bulletin 27, 5658-5659 (1985)
17. Menezes, A., van Oorschot, P., Vanstone, S.: Handbook of Applied Cryptography. CRC Press, Boca Raton (1996)
18. Merkle, R.: One way hash functions and DES. In: Brassard, G. (ed.) CRYPTO 1989. LNCS, vol. 435, pp. 428-446. Springer, Heidelberg (1990)
19. Nandi, M.: Designs of efficient secure large hash values. Cryptology ePrint report 2005/296
20. Preneel, B., Govaerts, R., Vandewalle, J.: Hash functions based on block ciphers: a synthetic approach. In: Stinson, D.R. (ed.) CRYPTO 1993. LNCS, vol. 773, pp. 368-378. Springer, Heidelberg (1994)
21. Preneel, B., Govaerts, R., Vandewalle, J.: On the power of memory in the design of collision resistant hash functions. In: AUSCRYPT 1992. LNCS, vol. 718, pp. 105-121. Springer, Heidelberg (1993)
22. Ristenpart, T., Shrimpton, T.: How to build a hash function from any collision-resistant function. In: Kurosawa, K. (ed.) ASIACRYPT 2007. LNCS, vol. 4833, pp. 147-163. Springer, Heidelberg (2007)
23. Rogaway, P., Steinberger, J.: Constructing cryptographic hash functions from fixed-key blockciphers. Full version of this paper. Available from either author's web page (manuscript, 2008)
24. Rogaway, P., Steinberger, J.: Security/efficiency tradeoffs for permutation-based hashing. In: Smart, N. (ed.) EUROCRYPT 2008. LNCS, vol. 4965, pp. 220-236. Springer, Heidelberg (2008)
25. Peyrin, T., Gilbert, H., Matthew, F., Robshaw, J.: Combining compression functions and block cipher-based hash functions. In: Lai, X., Chen, K. (eds.) ASIACRYPT 2006. LNCS, vol. 4284, pp. 315-331. Springer, Heidelberg (2006)
26. Satoh, T., Haga, M., Kurosawa, K.: Towards secure and fast hash functions. TIEICE: IEICE Transactions on Communications/Electronics/Information and Systems, 55-62 (1999)
27. Shannon, C.: A mathematical theory of communication. Bell System Technical Journal 27, 379-423, 623-656 (1948)
28. Shrimpton, T., Stam, M.: Building a collision-resistant compression function from non-compressing primitives. In: Aceto, L., Damgård, I., Goldberg, L.A., Halldorsson, M.M., Ingólfsdóttir, A., Walukiewicz, I. (eds.) ICALP 2008. LNCS, vol. 5126. Springer, Heidelberg (2008)
29. Stam, M.: Beyond uniformity: better security/efficiency tradeoffs for compression function security. In: Wagner, D. (ed.) CRYPTO 2008. LNCS, vol. 5157, pp. 397-412. Springer, Heidelberg (2008)
30. Steinberger, J.: The collision intractability of MDC-2 in the ideal-cipher model. In: Naor, M. (ed.) EUROCRYPT 2007. LNCS, vol. 4515, pp. 34-51. Springer, Heidelberg (2007)