Summary
The 2018 International Symposium on Information Theory and Its Applications　(ISITA2018)
2018
Session Number:Tu-PM-2-2
Session:
Number:Tu-PM-2-2.3
Parallelizable Message Preprocessing for Merkle-Damgard Hash Functions
Hidenori Kuwakado, Shoichi Hirose, Masahiro Mambo,
pp.457-461
Publication Date:2018/10/18
Online ISSN:2188-5079
DOI:10.34385/proc.55.Tu-PM-2-2.3
PDF download
Summary:
Since well-known hash functions sequentially process a message, the time for computing a digest strongly depends on the performance of a single processor. Even if multi-core processors are available, it is difficult to reduce the time. This paper focuses on designing a message preprocessing that can fully utilize multi-core processors. Since our message preprocessing can be efficiently computed by massively parallel processing, it contributes to reduce the time for computing a digest. The experiments using graphics processing units show that our message preprocessing improves the throughput for computing a digest.