SANDstorm hash
{{Short description|Cryptographic hash function}}
{{Infobox cryptographic hash function
| name = SANDstorm
| image =
| caption =
| designers = Mark Torgerson, Richard Schroeppel, Tim Draelos, Nathan Dautenhahn, Sean Malone, Andrea Walker, Michael Collins, Hilarie Orman,
| publish date = 2008
| series =
| derived from =
| derived to =
| related to =
| certification =
| digest size = 224, 256, 384, 512 bits
| structure =
| rounds =
| cryptanalysis = None
}}
The SANDstorm hash{{Cite web|last1=Torgerson|first1=Mark|last2=Schroeppel|first2=Richard|last3=Draelos|first3=Tim|last4=Dautenhahn|first4=Nathan|last5=Malone|first5=Sean|last6=Walker|first6=Andrea|last7=Collins|first7=Michael|last8=Orman|first8=Hilarie|title=The SANDstorm Hash|url=https://www.sandia.gov/scada/documents/SANDstorm_Submission_2008_10_30.pdf|url-status=dead|archive-url=https://web.archive.org/web/20090512125345/https://www.sandia.gov/scada/documents/SANDstorm_Submission_2008_10_30.pdf|archive-date=12 May 2009|access-date=20 July 2021|website=www.sandia.gov|language=en}} 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.{{Cite web|last=Computer Security Division|first=Information Technology Laboratory|date=4 January 2017|title=SHA-3 Project - Hash Functions {{!}} CSRC {{!}} CSRC|url=https://csrc.nist.gov/projects/hash-functions/sha-3-project|access-date=20 July 2021|website=CSRC {{!}} NIST|language=EN-US}}
Architecture
The hash function has an explicit key schedule.{{Cite journal|last1=Fleischmann|first1=Ewan|last2=Forler|first2=Christian|last3=Gorski|first3=Michael|date=2009|title=Classification of the SHA-3 Candidates|url=https://drops.dagstuhl.de/volltexte/2009/1948/|journal=Drops-Idn/1948}} It uses an 8-bit by 8-bit S-box. The hash function can be parallelized on a large range of platforms{{Which|date=July 2021}} using multi-core processing.{{Cite journal|last1=Torgerson|first1=Mark Dolan|last2=Draelos|first2=Timothy John|last3=Schroeppel|first3=Richard Crabtree|date=2009-09-01|title=Parallelism of the SANDstorm hash algorithm.|osti=993877|url=https://www.osti.gov/biblio/993877-parallelism-sandstorm-hash-algorithm|language=English}}
Both SANDstorm-256 and SANDstorm-512 run more than twice as slowly as SHA-2 as measured by cpb.{{Clarify|date=July 2021|reason=What is "cpb"?}}
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.
References
External links
- [http://www.sandia.gov/scada/documents/SANDstorm_Submission_2008_10_30.pdf SANDstorm Algorithm Specification]
- [http://csrc.nist.gov/groups/ST/hash/sha-3/Round1/documents/SANDstorm.zip SANDStorm Submission Package]
{{Cryptography navbox | hash}}
{{DEFAULTSORT:Sandstorm Hash}}