On Parallel Hash Functions Based on Block-Ciphers
Summary :
In this paper, we study variants of the parallel hash function construction of Damgård. We first show an improvement such that the number of processors is almost a half if |M|=(2s + 1)n for some s, where M is the message to be hashed. We next show that there exists a variant of our parallel hash construction such that it is secure even if the underlying compression function is not necessarily collision-free nor one-way. The cost is that some constant times more processors are required.
- Publication
- IEICE TRANSACTIONS on Fundamentals Vol.E87-A No.1 pp.67-74
- Publication Date
- 2004/01/01
- Publicized
- Online ISSN
- DOI
- Type of Manuscript
- Special Section PAPER (Special Section on Cryptography and Information Security)
- Category
- Symmetric Cipher
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Toshihiko MATSUO, Kaoru KUROSAWA, "On Parallel Hash Functions Based on Block-Ciphers" in IEICE TRANSACTIONS on Fundamentals,
vol. E87-A, no. 1, pp. 67-74, January 2004, doi: .
Abstract: In this paper, we study variants of the parallel hash function construction of Damgård. We first show an improvement such that the number of processors is almost a half if |M|=(2s + 1)n for some s, where M is the message to be hashed. We next show that there exists a variant of our parallel hash construction such that it is secure even if the underlying compression function is not necessarily collision-free nor one-way. The cost is that some constant times more processors are required.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/e87-a_1_67/_p
Copy
@ARTICLE{e87-a_1_67,
author={Toshihiko MATSUO, Kaoru KUROSAWA, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={On Parallel Hash Functions Based on Block-Ciphers},
year={2004},
volume={E87-A},
number={1},
pages={67-74},
abstract={In this paper, we study variants of the parallel hash function construction of Damgård. We first show an improvement such that the number of processors is almost a half if |M|=(2s + 1)n for some s, where M is the message to be hashed. We next show that there exists a variant of our parallel hash construction such that it is secure even if the underlying compression function is not necessarily collision-free nor one-way. The cost is that some constant times more processors are required.},
keywords={},
doi={},
ISSN={},
month={January},}
Copy
TY - JOUR
TI - On Parallel Hash Functions Based on Block-Ciphers
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 67
EP - 74
AU - Toshihiko MATSUO
AU - Kaoru KUROSAWA
PY - 2004
DO -
JO - IEICE TRANSACTIONS on Fundamentals
SN -
VL - E87-A
IS - 1
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - January 2004
AB - In this paper, we study variants of the parallel hash function construction of Damgård. We first show an improvement such that the number of processors is almost a half if |M|=(2s + 1)n for some s, where M is the message to be hashed. We next show that there exists a variant of our parallel hash construction such that it is secure even if the underlying compression function is not necessarily collision-free nor one-way. The cost is that some constant times more processors are required.
ER -
English
