A Parallel Algorithm for Extending Cryptographic Hash Functions

A Parallel Algorithm for Extending Cryptographic Hash Functions

Tác giả: Palash Sarkar, Paul J. Schellenberg

Nguồn trích: Progress in cryptology-INDOCRYPT 2001-LNCS 22418.7

Năm xuất bản: 1905

Số trang: 49

Tóm tắt: We describe a parallel algorithm for extending a small domain hash function to a very large domain hash function. Our construction can handle messages of any practical length and preserves the security properties of the basic hash function. The construction can be viewed as a parallel version of the well known Merkle-Dam˚gard construction, which is a sequential construction. Our parallel algorithm provides a significant reduction in the computation time of the message digest, which is a basic ope

Từ khóa: cryptographic hash function

Tải về