<s>
CubeHash	B-Algorithm
is	O
a	O
cryptographic	B-Algorithm
hash	I-Algorithm
function	I-Algorithm
submitted	O
to	O
the	O
NIST	B-Algorithm
hash	I-Algorithm
function	I-Algorithm
competition	I-Algorithm
by	O
Daniel	O
J	O
.	O
Bernstein	O
.	O
</s>
<s>
CubeHash	B-Algorithm
has	O
a	O
128	O
byte	O
state	O
,	O
uses	O
wide	O
pipe	O
construction	O
,	O
and	O
is	O
ARX	O
based	O
.	O
</s>
<s>
Message	O
blocks	O
are	O
XORed	O
into	O
the	O
initial	O
bits	O
of	O
a	O
128-byte	O
state	O
,	O
which	O
then	O
goes	O
through	O
an	O
r-round	O
bijective	B-Algorithm
transformation	O
between	O
blocks	O
.	O
</s>
<s>
CubeHash	B-Algorithm
advanced	O
to	O
the	O
second	O
round	O
of	O
the	O
competition	O
,	O
but	O
was	O
not	O
chosen	O
as	O
one	O
of	O
the	O
5	O
finalists	O
.	O
</s>
<s>
CubeHash	B-Algorithm
has	O
5	O
parameters	O
,	O
a	O
certain	O
instance	O
is	O
denoted	O
by	O
CubeHashi+	O
r/b	O
+	O
f-h	O
.	O
</s>
<s>
The	O
output	O
hash	B-Algorithm
is	O
now	O
contained	O
in	O
the	O
first	O
h/8	O
bytes	O
of	O
this	O
final	O
state	O
.	O
</s>
<s>
CubeHash	B-Algorithm
round	O
function	O
consists	O
of	O
the	O
following	O
ten	O
steps	O
:	O
</s>
<s>
Xor	B-Application
x[1jklm]	O
into	O
x[0jklm],	O
for	O
each	O
(	O
j	O
,	O
k	O
,	O
l	O
,	O
m	O
)	O
.	O
</s>
<s>
Xor	B-Application
x[1jklm]	O
into	O
x[0jklm],	O
for	O
each	O
(	O
j	O
,	O
k	O
,	O
l	O
,	O
m	O
)	O
.	O
</s>
<s>
The	O
initialization	O
vector	O
is	O
the	O
same	O
for	O
all	O
80+	O
8/1	O
+	O
f-512	O
hashes	B-Algorithm
,	O
and	O
is	O
as	O
follows	O
:	O
</s>
<s>
Hashing	O
the	O
ASCII	B-Protocol
message	O
"	O
Hello	O
"	O
(	O
hex	O
:	O
0x48	O
,	O
0x65	O
,	O
0x6c	O
,	O
0x6c	O
,	O
0x6f	O
)	O
uses	O
6	O
message	O
blocks	O
.	O
</s>
<s>
The	O
512	O
bit	O
hash	B-Algorithm
value	O
is	O
:	O
</s>
<s>
A	O
small	O
change	O
in	O
the	O
message	O
,	O
such	O
as	O
flipping	O
a	O
single	O
bit	O
,	O
will	O
wildly	O
change	O
the	O
hash	B-Algorithm
output	O
,	O
due	O
to	O
the	O
avalanche	O
effect	O
.	O
</s>
<s>
Hashing	O
the	O
message	O
"	O
hello	O
"	O
(	O
which	O
only	O
differs	O
from	O
"	O
Hello	O
"	O
in	O
1	O
bit	O
position	O
)	O
gives	O
the	O
following	O
hash	B-Algorithm
value	O
:	O
</s>
<s>
CubeHash	B-Algorithm
allows	O
for	O
many	O
different	O
parameters	O
to	O
be	O
used	O
to	O
determine	O
the	O
hash	B-Algorithm
output	O
.	O
</s>
<s>
Here	O
are	O
several	O
example	O
hashes	B-Algorithm
of	O
different	O
messages	O
,	O
using	O
different	O
parameters	O
.	O
</s>
<s>
The	O
messages	O
are	O
all	O
in	O
ASCII	B-Protocol
.	O
</s>
<s>
So	O
CubeHash	B-Algorithm
8/1	O
-512	O
is	O
stronger	O
(	O
more	O
secure	O
)	O
than	O
CubeHash	B-Algorithm
1/1	O
-512	O
,	O
and	O
CubeHash	B-Algorithm
1/1	O
-512	O
is	O
stronger	O
than	O
CubeHash	B-Algorithm
1/2	O
-512	O
.	O
</s>
<s>
The	O
weakest	O
possible	O
version	O
of	O
this	O
algorithm	O
is	O
CubeHash	B-Algorithm
1/128	O
-h	O
.	O
</s>
<s>
A	O
more	O
secure	O
version	O
will	O
take	O
longer	O
to	O
compute	O
a	O
hash	B-Algorithm
value	O
than	O
a	O
weakened	O
version	O
.	O
</s>
