2009/01/01 by Ewan Fleischmann, Fleischmann, Ewan, Christian Forler +3
Computer Science · Engineering · #Cryptographic Implementations and Security #Coding theory and cryptography #graph theory and CDMA systems
paper · doi:10.4230/dagsemproc.09031.5
In this note we give an overview on the current state of the SHA-3 candidates. First, we classify all publicly known candidates and, second, we outline and summarize the performance data as given in the candidates documentation for 64-bit and 32-bit implementations. We define performance classes and classify the hash algorithms. Note, that this article will be updated as soon as new candidates arrive or new cryptanalytic results get published. Comments to the authors of this article are welcome.