<s>
The	O
SANDstorm	B-Algorithm
hash	I-Algorithm
is	O
a	O
cryptographic	B-Algorithm
hash	I-Algorithm
function	I-Algorithm
designed	O
in	O
2008	O
by	O
Mark	O
Torgerson	O
,	O
Richard	O
Schroeppel	O
,	O
Tim	O
Draelos	O
,	O
Nathan	O
Dautenhahn	O
,	O
Sean	O
Malone	O
,	O
Andrea	O
Walker	O
,	O
Michael	O
Collins	O
,	O
and	O
Hilarie	O
Orman	O
for	O
the	O
NIST	B-Algorithm
SHA-3	I-Algorithm
competition	I-Algorithm
.	O
</s>
<s>
The	O
SANDstorm	B-Algorithm
hash	I-Algorithm
was	O
accepted	O
into	O
the	O
first	O
round	O
of	O
the	O
NIST	B-Algorithm
hash	I-Algorithm
function	I-Algorithm
competition	I-Algorithm
,	O
but	O
was	O
not	O
accepted	O
into	O
the	O
second	O
round	O
.	O
</s>
<s>
The	O
hash	B-Algorithm
function	I-Algorithm
has	O
an	O
explicit	O
key	O
schedule	O
.	O
</s>
<s>
It	O
uses	O
an	O
8-bit	O
by	O
8-bit	O
S-box	B-Algorithm
.	O
</s>
<s>
The	O
hash	B-Algorithm
function	I-Algorithm
can	O
be	O
parallelized	O
on	O
a	O
large	O
range	O
of	O
platforms	O
using	O
multi-core	B-Architecture
processing	I-Architecture
.	O
</s>
<s>
Both	O
SANDstorm-256	O
and	O
SANDstorm-512	O
run	O
more	O
than	O
twice	O
as	O
slowly	O
as	O
SHA-2	B-Algorithm
as	O
measured	O
by	O
cpb	O
.	O
</s>
<s>
As	O
of	O
2009	O
,	O
no	O
collision	B-Algorithm
attack	I-Algorithm
or	O
preimage	O
attack	O
against	O
SANDstorm	B-Algorithm
is	O
known	O
which	O
is	O
better	O
than	O
the	O
trivial	O
birthday	O
attack	O
or	O
long	O
second	O
preimage	O
attack	O
.	O
</s>
