Abstract
We propose a family of compression functions built from fixed-key blockciphers and investigate their collision and preimage security in the ideal-cipher model. The constructions have security approaching and in many cases equaling the security upper bounds found in previous work of the authors [24]. In particular, we describe a 2n-bit to n-bit compression function using three n-bit permutation calls that has collision security N 0.5, where Nā=ā2n, and we describe 3n-bit to 2n-bit compression functions using five and six permutation calls and having collision security of at least N 0.55 and N 0.63.
Chapter PDF
Similar content being viewed by others
Keywords
References
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)
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)
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)
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)
Bertoni, G., Daemen, J., Peeters, M., Van Assche, G.: Sponge functions. In: Ecrypt Hash Workshop (2007), http://sponge.noekeon.org/
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)
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)
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)
DamgĆ„rd, I.: A design principle for hash functions. In: Brassard, G. (ed.) CRYPTO 1989. LNCS, vol.Ā 435, pp. 416ā427. Springer, Heidelberg (1990)
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)
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)
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)
Joux, A.: Multicollisions in iterated hash functions. In: Franklin, M. (ed.) CRYPTO 2004. LNCS, vol.Ā 3152, pp. 306ā316. Springer, Heidelberg (2004)
Knudsen, L., Lai, X., Preneel, B.: Attacks on fast double block length hash functions. Journal of CryptologyĀ 11(1), 59ā72 (1998)
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)
Matyas, S., Meyer, C., Oseas, J.: Generating strong one-way functions with cryptographic algorithm. IBM Tech.Ā Disclosure BulletinĀ 27, 5658ā5659 (1985)
Menezes, A., van Oorschot, P., Vanstone, S.: Handbook of Applied Cryptography. CRC Press, Boca Raton (1996)
Merkle, R.: One way hash functions and DES. In: Brassard, G. (ed.) CRYPTO 1989. LNCS, vol.Ā 435, pp. 428ā446. Springer, Heidelberg (1990)
Nandi, M.: Designs of efficient secure large hash values. Cryptology ePrint report 2005/296
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)
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)
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)
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)
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)
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)
Satoh, T., Haga, M., Kurosawa, K.: Towards secure and fast hash functions. TIEICE: IEICE Transactions on Communications/Electronics/Information and Systems, 55ā62 (1999)
Shannon, C.: A mathematical theory of communication. Bell System Technical JournalĀ 27, 379ā423, 623ā656 (1948)
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)
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)
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)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
Ā© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Rogaway, P., Steinberger, J. (2008). Constructing Cryptographic Hash Functions from Fixed-Key Blockciphers. In: Wagner, D. (eds) Advances in Cryptology ā CRYPTO 2008. CRYPTO 2008. Lecture Notes in Computer Science, vol 5157. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-85174-5_24
Download citation
DOI: https://doi.org/10.1007/978-3-540-85174-5_24
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-85173-8
Online ISBN: 978-3-540-85174-5
eBook Packages: Computer ScienceComputer Science (R0)