Security/efficiency tradeoffs for permutation-based hashing

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

Volumn 4965 LNCS, Issue , 2008, Pages 220-236

  Rogaway, Phillip ^a   Steinberger, John ^b  

^a University of California Davis   (United States)

^b UNIVERSITY OF BRITISH COLUMBIA   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL METHODS; DATA STRUCTURES; FUNCTION EVALUATION;

HASHING; IDEAL-PERMUTATION MODELS; PERMUTATION INVOCATIONS;

SECURITY OF DATA;

EID: 44449089437     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-78967-3_13     Document Type: Conference Paper

References (11)

1. Black, J., Cochran, M., Shrimpton, T.: On the impossibility of highly-efficient blockcipher-based hash functions. In: Cramer, R.J.F. (ed.) EUROCRYPT 2005. LNCS, vol. 3494, pp. 526-541. Springer, Heidelberg (2005)
2. 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)
3. Even, S., Mansour, Y.: A construction of a cipher from a single pseudorandom permutation. In: Matsumoto, T., Imai, H., Rivest, R.L. (eds.) ASIACRYPT 1991. LNCS, vol. 739, pp. 210-224. Springer, Heidelberg (1993)
4. Hirose, S.: How to construct double-block-length hash functions. The second cryptographic hash workshop (sponsored by NIST) (2006)
5. Knudsen, L., Lai, X., Preneel, B.: Attacks on fast double block length hash functions. Journal of Cryptology 11(1), 59-72 (1998)
6. 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)
7. Nandi, M.: Towards optimal double-length hash functions. In: Maitra, S., Veni Madhavan, C.E., Venkatesan, R. (eds.) INDOCRYPT 2005. LNCS, vol. 3797, pp. 77-89. Springer, Heidelberg (2005)
8. Preneel, B., Govaerts, R., Vandewalle, J.: On the power of memory in the design of collision resistant hash functions. In: Zheng, Y., Seberry, J. (eds.) AUSCRYPT 2002. LNCS, vol. 718, pp. 105-121. Springer, Heidelberg (1993)
9. Rogaway, P., Steinberger, J.: How to build a permutation-based hash function. Manuscript, available from either author's homepage (2008)
10. Satoh, T., Haga, M., Kurosawa, K.: Towards secure and fast hash functions. IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences E82-A(1), 55-62 (1999)
11. Shannon, C.: A mathematical theory of communication. Bell System Technical Journal 27, 379-423, 623-656 (1948)