Difference between revisions of "Equihash"
(Created page with "Equihash is a memoryhard proofofwork scheme. It solves a computational puzzle, best algorithms for which require certain computational and memory resources. { class="floa...") 
(No difference)

Revision as of 15:38, 15 October 2016
Equihash is a memoryhard proofofwork scheme. It solves a computational puzzle, best algorithms for which require certain computational and memory resources.
High Level View
 Article: "Equihash: asymmetric proofofwork based on the Generalized Birthday problem^{[1]}
 Authors: Alex Biryukov and Dmitry Khovratovich
Equihash is a family of proofofwork schemes with three parameters n, k, and d, which determine the scheme Equihashn/k/d and the time and memory complexity of the puzzle solver for it, and seed S, which makes every puzzle unique and solutions incompatible. The best algorithms for Equihashn/k/d require O(2^{n/(k+1)+d}) time and O(2^{n/(k+1)}) memory, though implementations of this algorithms differ in both metrics, see below.
Strengths
Cryptanalysis
Here, we list the different cryptanalyses against the SPARX ciphers we are aware of, including those by its designers.
Instance  Rounds  Attack  Authors 

SPARX64/128  24  15 rounds (Integral)  Designers^{[2]} 
SPARX128/128  32  22 rounds (Integral)  Designers^{[2]} 
SPARX128/256  40  24 rounds (Integral)  Designers^{[2]} 
Resources
 NDSS'16 paper: To appear
 Eprint version: To appear
 Bibtex entry: To appear
 Presentation slides:
 Reference implementation:
 Optimized implementations: .
References
 ↑ Biryukov, A. and Khovratovich, D. (2016). Equihash: asymmetric proofofwork based on the Generalized Birthday problem. In Network and Distributed System Security Symposium (NDSS) 2016.
 ↑ ^{2.0} ^{2.1} ^{2.2} Cite error: Invalid
<ref>
tag; no text was provided for refs namedDPUVGB16