1 citations · 2 across the 6 of their papers we have counts for
7 papers
Asymptotic Analysis of Plausible Tree Hash Modes for SHA-3
Kevin Atighehchi, Alexis Bonnecaze
Discussions about the choice of a tree hash mode of operation for a standardization have recently been undertaken. It appears that a single tree mode cannot address adequately all…
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,…
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…
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…
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…
On Chudnovsky-Based Arithmetic Algorithms in Finite Fields
Kevin Atighehchi, Stéphane Ballet, Alexis Bonnecaze +1
Thanks to a new construction of the so-called Chudnovsky-Chudnovsky multiplication algorithm, we design efficient algorithms for both the exponentiation and the multiplication in f…
On the Incremental Asymmetric Signatures
Kevin Atighehchi
The purpose of incremental cryptography is to allow the updating of cryptographic forms of documents undergoing modifications, more efficiently than if we had to recompute them fro…