1 citations · 2 across the 6 of their papers we have counts for
Showing 2016Show all
3 papers · 1 filter
cs.CR2016
Some observations on the optimization of a parallel SHAKE function using Sakura
Kevin Atighehchi
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,…
cs.DC2016
Optimal Tree Hash Modes: the Case of Trees Having their Leaves at All the Levels
Kevin Atighehchi
A recent work shows how we can optimize a tree based mode of operation for a hash function where the sizes of input message blocks and digest are the same, subject to the constrain…
cs.DC2016★ 1 cited
Note on Optimal Trees for Parallel Hash Functions
Kevin Atighehchi
A recent work shows how we can optimize a tree based mode of operation for a rate 1 hash function. In particular, an algorithm and a theorem are presented for selecting a good tree…