Difference between revisions of "Abacus"

From The ECRYPT Hash Function Website
m
m (Cryptanalysis)
 
(8 intermediate revisions by 3 users not shown)
Line 17: Line 17:
 
}
 
}
 
</bibtex>
 
</bibtex>
 +
  
 
== Cryptanalysis ==
 
== Cryptanalysis ==
  
* None yet
+
{| 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
 +
|-                   
 +
| style="background:orange" | 2nd preimage || hash ||  ||  || 2<sup>344</sup> || - || [http://web.mit.edu/dwilson/www/hash/abacus_attack.pdf Wilson]
 +
|-                   
 +
| style="background:orange" | collision || hash ||  ||  || 2<sup>172</sup> || - || [http://web.mit.edu/dwilson/www/hash/abacus_attack.pdf Wilson]
 +
|-                   
 +
| style="background:orange" | 2nd preimage || hash ||  ||  || 2<sup>172</sup> || - || [http://lj.streamclub.ru/papers/hash/abacus.pdf Nikolić,Khovratovich]
 +
|-                   
 +
|}                   
 +
 
 +
A description of this table is given [http://ehash.iaik.tugraz.at/wiki/Cryptanalysis_Categories#Individual_Hash_Function_Tables here].
 +
 
 +
 
 +
<bibtex>
 +
@misc{sha3cryptanalysisWilsonAbacus,
 +
author = {David A. Wilson},
 +
title = {Abacus: A second-preimage and collision attack},
 +
url = {http://web.mit.edu/dwilson/www/hash/abacus_attack.pdf},
 +
howpublished = {available online},
 +
year = {2008},
 +
abstract = {A technique for controlling parts of the internal state of the Abacus hash function is described. This technique leads to a second-preimage attack of complexity 2^344 operations and a collision attack of approximately 2^172 operations.},
 +
}
 +
</bibtex>
 +
 
 +
<bibtex>
 +
@misc{sha3cryptanalysisNikolicAbacus,
 +
author = {Ivica Nikolic and Dmitry Khovratovich },
 +
title = {Second preimage attack on Abacus},
 +
url = {http://lj.streamclub.ru/papers/hash/abacus.pdf},
 +
howpublished = {available online},
 +
year = {2008},
 +
abstract = {We present a second preimage attack on Abacus. The attack requires 2^172 computations and negligible memory for all digests.},
 +
}
 +
</bibtex>

Latest revision as of 21:46, 29 December 2008

1 The algorithm

  • Author(s): Neil Sholer
  • NIST submission package: Abacus.zip


Neil Sholer - Abacus: A Candidate for SHA-3

,2008
http://ehash.iaik.tugraz.at/uploads/b/be/Abacus.pdf
Bibtex
Author : Neil Sholer
Title : Abacus: A Candidate for SHA-3
In : -
Address :
Date : 2008


2 Cryptanalysis

Type of Analysis Hash Function Part Hash Size (n) Parameters/Variants Compression Function Calls Memory Requirements Reference
2nd preimage hash 2344 - Wilson
collision hash 2172 - Wilson
2nd preimage hash 2172 - Nikolić,Khovratovich

A description of this table is given here.


David A. Wilson - Abacus: A second-preimage and collision attack

,2008
http://web.mit.edu/dwilson/www/hash/abacus_attack.pdf
Bibtex
Author : David A. Wilson
Title : Abacus: A second-preimage and collision attack
In : -
Address :
Date : 2008

Ivica Nikolic, Dmitry Khovratovich - Second preimage attack on Abacus

,2008
http://lj.streamclub.ru/papers/hash/abacus.pdf
Bibtex
Author : Ivica Nikolic, Dmitry Khovratovich
Title : Second preimage attack on Abacus
In : -
Address :
Date : 2008