Difference between revisions of "Shabal"
From The ECRYPT Hash Function Website
(Fixed the BibTeX) |
m (Added observation on Shabal's permutation) |
||
| Line 18: | Line 18: | ||
== Cryptanalysis == | == Cryptanalysis == | ||
| − | + | ||
| + | {| border="1" cellpadding="4" cellspacing="0" class="wikitable" style="text-align:center" | ||
| + | |- style="background:#efefef;" | ||
| + | | Type of Analysis || Hash Function Part || Hash Size (n) || Parameters/Variants || Compression Function Calls || Memory Requirements || Reference | ||
| + | |- | ||
| + | | | non-randomness || permutation || all || || 2<sup>12</sup> || || [http://131002.net/data/papers/Aum09.pdf Aumasson] | ||
| + | |- | ||
| + | |} | ||
| + | |||
| + | A description of this table is given [http://ehash.iaik.tugraz.at/wiki/Cryptanalysis_Categories#Individual_Hash_Function_Tables here]. | ||
| + | |||
| + | |||
| + | |||
| + | <bibtex> | ||
| + | @misc{shabalAum09, | ||
| + | author = {Jean-Philippe Aumasson}, | ||
| + | title = {On the pseudorandomness of Shabal's keyed permutation}, | ||
| + | url = {http://131002.net/data/papers/Aum09.pdf}, | ||
| + | howpublished = {Available online}, | ||
| + | year = {2009}, | ||
| + | abstract = { | ||
| + | We report observations suggesting that the permutation used in | ||
| + | Shabal does not behave pseudorandomly. This does not affect the | ||
| + | security of Shabal as submitted to the NIST Hash Competition.}, | ||
| + | } | ||
| + | </bibtex> | ||
Revision as of 23:56, 20 January 2009
1 The algorithm
- Author(s): 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, Marion Videau
- Website: http://www.shabal.com/
- NIST submission package: Shabal.zip
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, Marion Videau - Shabal, a Submission to NIST’s Cryptographic Hash Algorithm Competition
- ,2008
- http://ehash.iaik.tugraz.at/uploads/6/6c/Shabal.pdf
BibtexAuthor : 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, Marion Videau
Title : Shabal, a Submission to NIST’s Cryptographic Hash Algorithm Competition
In : -
Address :
Date : 2008
2 Cryptanalysis
| Type of Analysis | Hash Function Part | Hash Size (n) | Parameters/Variants | Compression Function Calls | Memory Requirements | Reference |
| non-randomness | permutation | all | 212 | Aumasson |
A description of this table is given here.
Jean-Philippe Aumasson - On the pseudorandomness of Shabal's keyed permutation
