§ 1. Introduction This paper introduces a new graphing mechanism to allow easy comparison of software performance of the SHA-3 candidates. The new mechanism concisely captures a large amount of performance data without oversimplifying the data. We have integrated this graphing mechanism into our eBASH (ECRYPT Benchmark- ing of All Submitted Hashes) project. New graphs are automatically posted at the top of http://bench.cr.yp.to/results-sha3.html whenever the eBASH performance results are updated. This paper includes snapshots of these graphs, but readers are advised to check the web page for the latest updates. See http://bench.cr.yp.to for more information regarding eBASH. For each function there is also a similar graph online comparing implementations of that function, showing in a concise way which implementations are slow or non-functional. Im- plementors can follow links from http://bench.cr.yp.to/primitives-sha3.html to find these graphs. Of course, users concerned about performance will reject slower implementa- tions in favor of faster implementations, so the main shootout graphs re ect only the fastest implementations.
|Title of host publication||Third SHA-3 Candidate Conference (Washington DC, USA, March 22-23, 2012)|
|Place of Publication||Gaithersburg MD|
|Publisher||National Institute of Standards and Technology (NIST)|
|Publication status||Published - 2012|