Shabal
A submission to NIST's Cryptographic Hash Algorithm Competition-
Shabal is selected for the second round of SHA-3 competition
Posted on July 27th, 2009 No commentsNIST has selected the Second Round Candidates of the SHA-3 Competition and Shabal continues the competition! 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 »
-
Shabal reviewed by students of Ronald L. Rivest
Posted on April 9th, 2009 No commentsProfessor Rivest was given a homework assignment to review some of the submissions to the NIST SHA-3 Hash Function Competition with respect to the arguments made by the submitters about the security of their proposals. Read the rest of this entry »
-
Shabal’s slides are available
Posted on February 25th, 2009 No commentsAnne Canteaut will present Shabal at the first SHA-3 candidate conference on Friday, February 27, 2009. Read the rest of this entry »
-
Shabal will be at “The First SHA-3 Candidate Conference”
Posted on January 14th, 2009 No commentsNIST has published the program of “The First SHA-3 Candidate Conference” (html, PDF). Read the rest of this entry »
-
Shabal is selected for the first round
Posted on December 10th, 2008 No commentsNIST have published the list of 51 algorithms selected for the first round of competition. And Shabal is…
-
First SHA-3 conference
Posted on December 10th, 2008 No commentsNIST has posted informations about the first SHA-3 conference.
-
Shabal is submitted!
Posted on October 28th, 2008 No commentsShabal is a cryptographic hash function submitted by the France funded research project Saphir to NIST’s international competition on hash functions.


Recent Comments