Compact Implementations of LSH
Lists
Only you see this
Abstract
In ICISC’14, a new hash function family named LSH was released. The algorithm is secure against all critical hash function attacks and has simple ARX architecture with multiple data sets, which are computed in same operation. This nice features are well suited on modern parallel computer architectures such as SIMD (Single Instruction Multiple Data). The software efficiency of LSH is four times faster than SHA-3 and 1.5–2.3 times faster than other SHA-3 finalists over modern SIMD architectures. In this paper, we introduce the implementations of LSH hash functions for low-end embedded processors. The results show that LSH function are efficient enough to perform the operation over resource challenging processors so far.
BibTeX
@inproceedings{park2015compact,
author = {Taehwan Park and Hwajeong Seo and Zhe Liu and Jongseok Choi and Howon Kim},
title = {{Compact Implementations of LSH}},
booktitle = {WISA},
year = {2015},
doi = {10.1007/978-3-319-31875-2\_4},
}Loading related content...