7171

GPU Parallel Statistical and Cube Test Analysis of the SHA-3 Finalist Candidate Hash Functions

Alan Kaminsky
Department of Computer Science, Rochester Institute of Technology
Rochester Institute of Technology, TechReport, 2011

@article{kaminsky2012gpu,

   title={GPU Parallel Statistical and Cube Test Analysis of the SHA-3 Finalist Candidate Hash Functions},

   author={Kaminsky, Alan},

   year={2011}

}

Download Download (PDF)   View View   Source Source   Source codes Source codes

Package:

1694

views

The 256-bit versions of the SHA-3 finalist candidate hash functions – BLAKE, Grostl, JH, Keccak, and Skein – were subjected to statistical tests to attempt to disprove the hypothesis that the output bits are uniformly distributed, independent, binary random variables. The hash functions were also subjected to cube tests to attempt to disprove the hypothesis that the superpoly bits are uniformly distributed, independent, binary random variables. The hash functions and test programs were implemented to run in parallel on a 448-core GPU supercomputer; the cube tests in particular require massive amounts of computation and are ideally suited for parallel implementation. Nonrandom behavior was observed at the 0.01 significance level in the BLAKE, JH, Keccak, and Skein hash functions. Nonrandom behavior was not observed at the 0.01 significance level in the Grostl hash function.
Rating: 2.5. From 1 vote.
Please wait...

* * *

* * *

HGPU group © 2010-2017 hgpu.org

All rights belong to the respective authors

Contact us: