SANDstorm
General
DesignersMark Torgerson, Richard Schroeppel, Tim Draelos, Nathan Dautenhahn, Sean Malone, Andrea Walker, Michael Collins, Hilarie Orman,
First published2008
Detail
Digest sizes224, 256, 384, 512
Best public cryptanalysis
None

The SANDstorm hash[1] is a cryptographic hash function designed in 2008 by Mark Torgerson, Richard Schroeppel, Tim Draelos, Nathan Dautenhahn, Sean Malone, Andrea Walker, Michael Collins, and Hilarie Orman for the NIST SHA-3 competition.

The SANDstorm hash was accepted into the first round of the NIST hash function competition, but was not accepted into the second round.[2]

Architecture

The hash function has an explicit key schedule.[3] It uses an 8-bit by 8-bit S-box.[3] The hash function can be parallelized on a large range of platforms using multi-core processing.[4]

Both SANDstorm-256 and SANDstorm-512 run more than twice as slowly as SHA-2 as measured by cpb.[3]

As of 2009, no collision attack or preimage attack against SANDstorm is known which is better than the trivial birthday attack or long second preimage attack.[3]

References

  1. ↑ Torgerson, Mark; Schroeppel, Richard; Draelos, Tim; Dautenhahn, Nathan; Malone, Sean; Walker, Andrea; Collins, Michael; Orman, Hilarie. "The SANDstorm Hash" (PDF). www.sandia.gov. Archived from the original (PDF) on 12 May 2009. Retrieved 20 July 2021.
  2. ↑ Computer Security Division, Information Technology Laboratory (4 January 2017). "SHA-3 Project - Hash Functions | CSRC | CSRC". CSRC | NIST. Retrieved 20 July 2021.
  3. 1 2 3 4 Fleischmann, Ewan; Forler, Christian; Gorski, Michael (2009). "Classification of the SHA-3 Candidates". Drops-Idn/1948.
  4. ↑ Torgerson, Mark Dolan; Draelos, Timothy John; Schroeppel, Richard Crabtree (2009-09-01). "Parallelism of the SANDstorm hash algorithm". OSTI 993877. {{cite journal}}: Cite journal requires |journal= (help)
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.