Some observations on the optimization of a parallel SHAKE function using Sakura
Cryptography and Security
2016-08-16 v3 Distributed, Parallel, and Cluster Computing
Abstract
Some parallel constructions of a SHAKE hash function using Sakura coding are introduced, whose basic operation is the Keccak's permutation. For each proposed tree-based algorithm, observations are made on both its parallel running time (depth) and the required number of processors to reach it. This preliminary work makes the assumption that the tree-level chaining value length is equal to the capacity of the underlying sponge construction, as recommended in the Sakura paper.
Cite
@article{arxiv.1608.00492,
title = {Some observations on the optimization of a parallel SHAKE function using Sakura},
author = {Kevin Atighehchi},
journal= {arXiv preprint arXiv:1608.00492},
year = {2016}
}
Comments
Addition of some comments (and an illustration) in Section 3.1