-
Notifications
You must be signed in to change notification settings - Fork 0
/
wolf-cubehash.cl
173 lines (150 loc) · 3.36 KB
/
wolf-cubehash.cl
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
#ifndef WOLF_CUBEHASH_CL
#define WOLF_CUBEHASH_CL
// CubeHash implementation helper functions by Wolf
#define CUBEHASH_FORCED_UNROLL
#define CUBEHASH_UNROLL_VALUE
void CubeHashEvenRound(uint *x)
{
((uint16 *)x)[1] += ((uint16 *)x)[0];
((uint16 *)x)[0] = rotate(((uint16 *)x)[0], 7U);
/*#pragma unroll
for(int i = 0; i < 16; ++i)
{
x[i + 16] += x[i];
x[i] = rotate(x[i], 7U);
}*/
/*#pragma unroll
for(int i = 0; i < 16; ++i)
{
const uchar y = (i < 8) ? 24 : 8;
x[i] ^= x[i + y];
}*/
//#pragma unroll
//for(int i = 0; i < 8; ++i) x[i] ^= x[i + 24];
((uint8 *)x)[0] ^= ((uint8 *)x)[3];
((uint8 *)x)[1] ^= ((uint8 *)x)[2];
//#pragma unroll
//for(int i = 8; i < 16; ++i) x[i] ^= x[i + 8];
/*//#pragma unroll
for(int i = 0; i < 8; ++i)
{
x[i + 26] += x[i];
x[i] = rotate(x[i], 11U);
++i;
x[i + 26] += x[i];
x[i] = rotate(x[i], 11U);
++i;
x[i + 22] += x[i];
x[i] = rotate(x[i], 11U);
++i;
x[i + 22] += x[i];
x[i] = rotate(x[i], 11U);
}
//#pragma unroll
for(int i = 8; i < 15; ++i)
{
x[i + 10] += x[i];
x[i] = rotate(x[i], 11U);
++i;
x[i + 10] += x[i];
x[i] = rotate(x[i], 11U);
++i;
x[i + 6] += x[i];
x[i] = rotate(x[i], 11U);
++i;
x[i + 6] += x[i];
x[i] = rotate(x[i], 11U);
}*/
#ifdef CUBEHASH_FORCED_UNROLL
#pragma unroll CUBEHASH_UNROLL_VALUE
#endif
for(int i = 0; i < 16; ++i)
{
const uchar y = (i < 8) ? 0 : 16;
x[i + 26 - y] += x[i];
x[i] = rotate(x[i], 11U);
++i;
x[i + 26 - y] += x[i];
x[i] = rotate(x[i], 11U);
++i;
x[i + 22 - y] += x[i];
x[i] = rotate(x[i], 11U);;
++i;
x[i + 22 - y] += x[i];
x[i] = rotate(x[i], 11U);
}
//#pragma unroll
/*for(int i = 0; i < 16; ++i)
{
x[i] ^= x[30 - i];
++i;
x[i] ^= x[32 - i];
}*/
#ifdef CUBEHASH_FORCED_UNROLL
#pragma unroll CUBEHASH_UNROLL_VALUE
#endif
for(int i = 0; i < 16; ++i) x[i] ^= (i & 1) ? x[32 - i] : x[30 - i];
}
void CubeHashOddRound(uint *x)
{
//#pragma unroll
//for(int i = 0; i < 16; ++i)
//{
// x[31 - i] += x[i];
// x[i] = rotate(x[i], 7U);
//}
((uint16 *)x)[1].sfedcba9876543210 += ((uint16 *)x)[0];
((uint16 *)x)[0] = rotate(((uint16 *)x)[0], 7U);
/*#pragma unroll
for(int i = 0; i < 8; ++i) x[i] ^= x[23 - i];
//#pragma unroll
for(int i = 8; i < 16; ++i) x[i] ^= x[39 - i];*/
#ifdef CUBEHASH_FORCED_UNROLL
#pragma unroll CUBEHASH_UNROLL_VALUE
#endif
for(int i = 0; i < 16; ++i) x[i] ^= (i < 8) ? x[23 - i] : x[39 - i];
#ifdef CUBEHASH_FORCED_UNROLL
#pragma unroll CUBEHASH_UNROLL_VALUE
#endif
for(int i = 0; i < 16; ++i)
{
const uchar y = (i < 8) ? 0 : 16;
x[21 - i + y] += x[i];
x[i] = rotate(x[i], 11U);
++i;
x[21 - i + y] += x[i];
x[i] = rotate(x[i], 11U);
++i;
x[25 - i + y] += x[i];
x[i] = rotate(x[i], 11U);
++i;
x[25 - i + y] += x[i];
x[i] = rotate(x[i], 11U);
}
//#pragma unroll
/*for(int i = 16; i < 32; ++i)
{
x[i - 15] ^= x[i];
++i;
x[i - 17] ^= x[i];
}*/
// i = 16 - 1, i = 17 - 0, i = 18 - 3, i = 19 - 2
// i = 0 - 1, i = 1 - 0, i = 2 - 3, i = 3 - 3
/*for(int i = 0; i < 16; ++i)
{
x[i + 1] ^= x[i + 16];
++i;
x[i - 1] ^= x[i + 16];
}*/
//for(int i = 0; i < 16; i += 2) x[i + 1] ^= x[i + 16];
//for(int i = 1; i < 16; i += 2) x[i - 1] ^= x[i + 16];
#ifdef CUBEHASH_FORCED_UNROLL
#pragma unroll CUBEHASH_UNROLL_VALUE
#endif
for(int i = 0; i < 16; ++i)
{
const char y = (i & 1) ? -1 : 1;
x[i + y] ^= x[i + 16];
}
}
#endif