IEICE TRANSACTIONS on Fundamentals
Multilane Hashing Mode Suitable for Parallel Processing
Summary :
A hash function is an important primitive for cryptographic protocols. Since algorithms of well-known hash functions are almost serial, it seems difficult to take full advantage of recent multi-core processors. This paper proposes a multilane hashing (MLH) mode that achieves both of high parallelism and high security. The MLH mode is designed in such a way that the processing speed is almost linear in the number of processors. Since the MLH mode exploits an existing hash function as a black box, it is applicable to any hash function. The bound on the indifferentiability of the MLH mode from a random oracle is beyond the birthday bound on the output length of an underlying primitive.
- Publication
- IEICE TRANSACTIONS on Fundamentals Vol.E96-A No.12 pp.2434-2442
- Publication Date
- 2013/12/01
- Publicized
- Online ISSN
- 1745-1337
- DOI
- 10.1587/transfun.E96.A.2434
- Type of Manuscript
- Special Section PAPER (Special Section on Information Theory and Its Applications)
- Category
- Information Security
Authors
Hidenori KUWAKADO
Kansai University
Shoichi HIROSE
University of Fukui
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
Hidenori KUWAKADO, Shoichi HIROSE, "Multilane Hashing Mode Suitable for Parallel Processing" in IEICE TRANSACTIONS on Fundamentals,
vol. E96-A, no. 12, pp. 2434-2442, December 2013, doi: 10.1587/transfun.E96.A.2434.
Abstract: A hash function is an important primitive for cryptographic protocols. Since algorithms of well-known hash functions are almost serial, it seems difficult to take full advantage of recent multi-core processors. This paper proposes a multilane hashing (MLH) mode that achieves both of high parallelism and high security. The MLH mode is designed in such a way that the processing speed is almost linear in the number of processors. Since the MLH mode exploits an existing hash function as a black box, it is applicable to any hash function. The bound on the indifferentiability of the MLH mode from a random oracle is beyond the birthday bound on the output length of an underlying primitive.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/transfun.E96.A.2434/_p
Copy
@ARTICLE{e96-a_12_2434,
author={Hidenori KUWAKADO, Shoichi HIROSE, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Multilane Hashing Mode Suitable for Parallel Processing},
year={2013},
volume={E96-A},
number={12},
pages={2434-2442},
abstract={A hash function is an important primitive for cryptographic protocols. Since algorithms of well-known hash functions are almost serial, it seems difficult to take full advantage of recent multi-core processors. This paper proposes a multilane hashing (MLH) mode that achieves both of high parallelism and high security. The MLH mode is designed in such a way that the processing speed is almost linear in the number of processors. Since the MLH mode exploits an existing hash function as a black box, it is applicable to any hash function. The bound on the indifferentiability of the MLH mode from a random oracle is beyond the birthday bound on the output length of an underlying primitive.},
keywords={},
doi={10.1587/transfun.E96.A.2434},
ISSN={1745-1337},
month={December},}
Copy
TY - JOUR
TI - Multilane Hashing Mode Suitable for Parallel Processing
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 2434
EP - 2442
AU - Hidenori KUWAKADO
AU - Shoichi HIROSE
PY - 2013
DO - 10.1587/transfun.E96.A.2434
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E96-A
IS - 12
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - December 2013
AB - A hash function is an important primitive for cryptographic protocols. Since algorithms of well-known hash functions are almost serial, it seems difficult to take full advantage of recent multi-core processors. This paper proposes a multilane hashing (MLH) mode that achieves both of high parallelism and high security. The MLH mode is designed in such a way that the processing speed is almost linear in the number of processors. Since the MLH mode exploits an existing hash function as a black box, it is applicable to any hash function. The bound on the indifferentiability of the MLH mode from a random oracle is beyond the birthday bound on the output length of an underlying primitive.
ER -
English
