Some observations on the optimization of a parallel SHAKE function using Sakura
This work addresses optimization of hash functions for parallel computing, but it appears incremental as it builds on existing Sakura and Keccak methods.
The authors introduced parallel constructions of a SHAKE hash function using Sakura coding with Keccak's permutation, analyzing their parallel running time and processor requirements under specific assumptions about chaining value length.
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.