AN EFFICIENT PARALLEL ALGORITHM FOR SKEIN HASH FUNCTIONS

摘要

Recently, cryptanalysts have found collisions on the MD4,rnMD5, and SHA-0 algorithms; moreover, a method for findingrnSHA1 collisions with less than the expected calculusrncomplexity has been published. The NIST [1] has thus decidedrnto develop a new hash algorithm, so called SHA-3,rnwhich will be developed through a public competition [3].rnFrom the set of accepted proposals for the further steps ofrnthe competition, we have decided to explore the design ofrnan efficient parallel algorithm for the Skein [12] hash functionrnfamily. The main reason for designing such an algorithmrnis to obtain optimal performances when dealing withrncritical applications which require efficiently tuned implementationsrnon multi-core target processors. This preliminaryrnwork presents one of the first parallel implementationrnand associated performance evaluation of Skein availablernin the literature. To parallelize Skein we have used the treernhash mode in which we create one virtual thread for eachrnnode of the tree.