2008•Unpublished venueRequires access

Analysis of Fast Blockcipher-Based Hash Functions

Martin Staněk

Abstract

Abstract. An important property of a hash function is the performance. We study fast iterated hash functions based on block ciphers. These hash functions and their compression functions are analyzed in the standard black-box model. We show an upper bound on rate of any collision resistant hash function. In addition, we improve known bound on the rate of collision resistant compression functions. Key words: hash functions, provable security, black-box model. 1

About this research paper

What this paper is about

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Key concepts: Hash function, Collision resistance, SHA-2, Collision attack, Computer science, MDC-2, Double hashing, Cryptographic hash function