About Shabal
Shabal is a cryptographic hash function submitted by the France funded research project Saphir to NIST's international competition on hash functions.
The authors of Shabal are Emmanuel Bresson, Anne Canteaut, Benoît Chevallier-Mames, Christophe Clavier, Thomas Fuhr, Aline Gouget, Thomas Icart, Jean-François Misarsky, María Naya-Plasencia, Pascal Paillier, Thomas Pornin, Jean-René Reinhard, Céline Thuillet and Marion Videau.
-
Internal Distinguishers in Indifferentiable Hashing: The Shabal Case
Posted on July 28th, 2010 No commentsWe show the first indifferentiability proof of a hash construction C F which does not make the assumption that the inner primitive F is ideal, but allows the existence (up to certain bounds that we explicit) of statistical distinguishers on F. Read the rest of this entry »
-
Unfolding Method for Shabal on Virtex-5 FPGAs: Concrete Results
Posted on July 28th, 2010 No commentsIn this paper, we focus on an optimized implementation of the Shabal candidate. We improve the state-of-the-art using the unfolding method. Read the rest of this entry »
-
The list of the accepted papers for the Second SHA-3 Candidate Conference is now available
Posted on July 1st, 2010 No commentsTwo papers are about Shabal : Read the rest of this entry »
-
Indifferentiability with Distinguishers: Why Shabal Does Not Require Ideal Ciphers
Posted on May 6th, 2009 No commentsShabal is based on a new provably secure mode of operation. Some related-key distinguishers for the underlying keyed permutation have been exhibited recently by Aumasson et al. and Knudsen et al., but with no visible impact on the security of Shabal. This paper then aims at extensively studying such distinguishers for the keyed permutation used in Shabal, and at clarifying the impact that they exert on the security of the full hash function. Read the rest of this entry »
Recent Comments