1 citations · 2 across the 6 of their papers we have counts for
Showing cs.DCShow all
3 papers · 1 filter
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…
cs.DC2015
Optimization of Tree Modes for Parallel Hash Functions: A Case Study
Kevin Atighehchi, Robert Rolland
This paper focuses on parallel hash functions based on tree modes of operation for an inner Variable-Input-Length function. This inner function can be either a single-block-length…