-
Notifications
You must be signed in to change notification settings - Fork 11
/
jh_gen.go
464 lines (414 loc) · 17.4 KB
/
jh_gen.go
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
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
// Code generated by cpp. DO NOT EDIT.
// +
// Package jh implements JH-256 algorithm.
//
// This Go implementation is a port of the original C implementation which is
// included in Monero as follows:
// src/crypto/jh.c
// src/crypto/jh.h
//
// Most comments in the original file are copied as well.
package jh // import "ekyu.moe/cryptonight/jh"
import (
"encoding/binary"
"hash"
"unsafe"
)
// This field is for macro definitions.
// We define it in a literal string so that it can trick gofmt(1).
//
// It should be empty after they are expanded by cpp(1).
const _ = `
`
// For memset
var zeroBuf64Byte [64]byte
type state struct {
hashbitlen int // the message digest size
databitlen uint64 // the message size in bits
datasizeInBuffer uint64 // the size of the message remained in buffer; assumed to be multiple of 8bits except for the last partial block at the end of the message
x [8][2]uint64 // the 1024-bit state, ( x[i][0] || x[i][1] ) is the ith row of the state in the pseudocod
buffer [64]byte // the 512-bit message block to be hashed
}
func Sum256(b []byte) []byte {
h := New256()
h.Write(b)
return h.Sum(nil)
}
func New256() hash.Hash {
return &state{hashbitlen: 256, x: jh256H0}
}
func (s *state) Reset() {
s.hashbitlen = 256
s.databitlen = 0
s.datasizeInBuffer = 0
s.x = jh256H0
}
func (s *state) Size() int { return 32 }
func (s *state) BlockSize() int { return 64 }
// hash each 512-bit message block, except the last partial block
func (s *state) Write(data []byte) (n int, err error) {
index := uint64(0) // the starting address of the data to be compressed
databitlen := uint64(len(data)) * 8
s.databitlen += databitlen
// if there is remaining data in the buffer, fill it to a full message block first
// we assume that the size of the data in the buffer is the multiple of 8 bits if it is not at the end of a message
// There is data in the buffer, but the incoming data is insufficient for a full block
if s.datasizeInBuffer > 0 && s.datasizeInBuffer+databitlen < 512 {
if databitlen&7 == 0 {
copy(s.buffer[s.datasizeInBuffer>>3:], data[:64-(s.datasizeInBuffer>>3)])
} else {
copy(s.buffer[s.datasizeInBuffer>>3:], data[:64-(s.datasizeInBuffer>>3)+1])
}
s.datasizeInBuffer += databitlen
databitlen = 0
}
// There is data in the buffer, and the incoming data is sufficient for a full block
if s.datasizeInBuffer > 0 && s.datasizeInBuffer+databitlen >= 512 {
copy(s.buffer[s.datasizeInBuffer>>3:], data[:64-(s.datasizeInBuffer>>3)])
index = 64 - (s.datasizeInBuffer >> 3)
databitlen -= 512 - s.datasizeInBuffer
s.f8()
s.datasizeInBuffer = 0
}
// hash the remaining full message blocks
for databitlen >= 512 {
copy(s.buffer[:], data[index:index+64])
s.f8()
index += 64
databitlen -= 512
}
// store the partial block into buffer, assume that -- if part of the last byte is not part of the message, then that part consists of bits*/
if databitlen > 0 {
if databitlen&7 == 0 {
copy(s.buffer[:((databitlen&0x1ff)>>3)], data[index:])
} else {
copy(s.buffer[:((databitlen&0x1ff)>>3)+1], data[index:])
}
s.datasizeInBuffer = databitlen
}
return len(data), nil
}
// Sum pads the message, process the padded block(s), truncate the hash value H to obtain the message digest
func (s *state) Sum(b []byte) []byte {
var i uint64
if s.databitlen&0x1ff == 0 {
// pad the message when databitlen is multiple of 512 bits, then process the padded block
s.buffer = zeroBuf64Byte
s.buffer[0] = 0x80
s.buffer[63] = uint8(s.databitlen)
s.buffer[62] = uint8(s.databitlen >> 8)
s.buffer[61] = uint8(s.databitlen >> 16)
s.buffer[60] = uint8(s.databitlen >> 24)
s.buffer[59] = uint8(s.databitlen >> 32)
s.buffer[58] = uint8(s.databitlen >> 40)
s.buffer[57] = uint8(s.databitlen >> 48)
s.buffer[56] = uint8(s.databitlen >> 56)
s.f8()
} else {
// set the rest of the bytes in the buffer to 0
if s.datasizeInBuffer&7 == 0 {
for i = (s.databitlen & 0x1ff) >> 3; i < 64; i++ {
s.buffer[i] = 0
}
} else {
for i = ((s.databitlen & 0x1ff) >> 3) + 1; i < 64; i++ {
s.buffer[i] = 0
}
}
// pad and process the partial block when databitlen is not multiple of 512 bits, then hash the padded blocks
s.buffer[(s.databitlen&0x1ff)>>3] |= 1 << (7 - (s.databitlen & 7))
s.f8()
s.buffer = zeroBuf64Byte
s.buffer[63] = uint8(s.databitlen)
s.buffer[62] = uint8(s.databitlen >> 8)
s.buffer[61] = uint8(s.databitlen >> 16)
s.buffer[60] = uint8(s.databitlen >> 24)
s.buffer[59] = uint8(s.databitlen >> 32)
s.buffer[58] = uint8(s.databitlen >> 40)
s.buffer[57] = uint8(s.databitlen >> 48)
s.buffer[56] = uint8(s.databitlen >> 56)
s.f8()
}
return append(b, (*[32]byte)(unsafe.Pointer(&s.x[6][0]))[:]...)
}
// The compression function F8.
func (s *state) f8() {
var i uint64
// xor the 512-bit message with the fist half of the 1024-bit hash state
for i = 0; i < 8; i++ {
s.x[i>>1][i&1] ^= binary.LittleEndian.Uint64(s.buffer[8*i:])
}
// the bijective function E8
s.e8()
// xor the 512-bit message with the second half of the 1024-bit hash state
for i = 0; i < 8; i++ {
s.x[(8+i)>>1][(8+i)&1] ^= binary.LittleEndian.Uint64(s.buffer[8*i:])
}
}
// The bijective function E8, in bitslice form.
func (s *state) e8() {
var i, roundnumber, temp0, temp1 uint64
for roundnumber = 0; roundnumber < 42; roundnumber += 7 {
// round 7*roundnumber+0: Sbox, MDS and Swapping layers
for i = 0; i < 2; i++ {
s.x[6][i] = ^(s.x[6][i])
s.x[7][i] = ^(s.x[7][i])
s.x[0][i] ^= ((^(s.x[4][i])) & (e8BitsliceRoundconstant[roundnumber+0][i]))
s.x[1][i] ^= ((^(s.x[5][i])) & (e8BitsliceRoundconstant[roundnumber+0][i+2]))
temp0 = (e8BitsliceRoundconstant[roundnumber+0][i]) ^ ((s.x[0][i]) & (s.x[2][i]))
temp1 = (e8BitsliceRoundconstant[roundnumber+0][i+2]) ^ ((s.x[1][i]) & (s.x[3][i]))
s.x[0][i] ^= ((s.x[4][i]) & (s.x[6][i]))
s.x[1][i] ^= ((s.x[5][i]) & (s.x[7][i]))
s.x[6][i] ^= ((^(s.x[2][i])) & (s.x[4][i]))
s.x[7][i] ^= ((^(s.x[3][i])) & (s.x[5][i]))
s.x[2][i] ^= ((s.x[0][i]) & (s.x[4][i]))
s.x[3][i] ^= ((s.x[1][i]) & (s.x[5][i]))
s.x[4][i] ^= ((s.x[0][i]) & (^(s.x[6][i])))
s.x[5][i] ^= ((s.x[1][i]) & (^(s.x[7][i])))
s.x[0][i] ^= ((s.x[2][i]) | (s.x[6][i]))
s.x[1][i] ^= ((s.x[3][i]) | (s.x[7][i]))
s.x[6][i] ^= ((s.x[2][i]) & (s.x[4][i]))
s.x[7][i] ^= ((s.x[3][i]) & (s.x[5][i]))
s.x[2][i] ^= (temp0 & (s.x[0][i]))
s.x[3][i] ^= (temp1 & (s.x[1][i]))
s.x[4][i] ^= temp0
s.x[5][i] ^= temp1
(s.x[1][i]) ^= (s.x[2][i])
(s.x[3][i]) ^= (s.x[4][i])
(s.x[5][i]) ^= (s.x[0][i]) ^ (s.x[6][i])
(s.x[7][i]) ^= (s.x[0][i])
(s.x[0][i]) ^= (s.x[3][i])
(s.x[2][i]) ^= (s.x[5][i])
(s.x[4][i]) ^= (s.x[1][i]) ^ (s.x[7][i])
(s.x[6][i]) ^= (s.x[1][i])
(s.x[1][i]) = ((((s.x[1][i]) & 0x5555555555555555) << 1) | (((s.x[1][i]) & 0xaaaaaaaaaaaaaaaa) >> 1))
(s.x[3][i]) = ((((s.x[3][i]) & 0x5555555555555555) << 1) | (((s.x[3][i]) & 0xaaaaaaaaaaaaaaaa) >> 1))
(s.x[5][i]) = ((((s.x[5][i]) & 0x5555555555555555) << 1) | (((s.x[5][i]) & 0xaaaaaaaaaaaaaaaa) >> 1))
(s.x[7][i]) = ((((s.x[7][i]) & 0x5555555555555555) << 1) | (((s.x[7][i]) & 0xaaaaaaaaaaaaaaaa) >> 1))
}
// round 7*roundnumber+1: Sbox, MDS and Swapping layers
for i = 0; i < 2; i++ {
s.x[6][i] = ^(s.x[6][i])
s.x[7][i] = ^(s.x[7][i])
s.x[0][i] ^= ((^(s.x[4][i])) & (e8BitsliceRoundconstant[roundnumber+1][i]))
s.x[1][i] ^= ((^(s.x[5][i])) & (e8BitsliceRoundconstant[roundnumber+1][i+2]))
temp0 = (e8BitsliceRoundconstant[roundnumber+1][i]) ^ ((s.x[0][i]) & (s.x[2][i]))
temp1 = (e8BitsliceRoundconstant[roundnumber+1][i+2]) ^ ((s.x[1][i]) & (s.x[3][i]))
s.x[0][i] ^= ((s.x[4][i]) & (s.x[6][i]))
s.x[1][i] ^= ((s.x[5][i]) & (s.x[7][i]))
s.x[6][i] ^= ((^(s.x[2][i])) & (s.x[4][i]))
s.x[7][i] ^= ((^(s.x[3][i])) & (s.x[5][i]))
s.x[2][i] ^= ((s.x[0][i]) & (s.x[4][i]))
s.x[3][i] ^= ((s.x[1][i]) & (s.x[5][i]))
s.x[4][i] ^= ((s.x[0][i]) & (^(s.x[6][i])))
s.x[5][i] ^= ((s.x[1][i]) & (^(s.x[7][i])))
s.x[0][i] ^= ((s.x[2][i]) | (s.x[6][i]))
s.x[1][i] ^= ((s.x[3][i]) | (s.x[7][i]))
s.x[6][i] ^= ((s.x[2][i]) & (s.x[4][i]))
s.x[7][i] ^= ((s.x[3][i]) & (s.x[5][i]))
s.x[2][i] ^= (temp0 & (s.x[0][i]))
s.x[3][i] ^= (temp1 & (s.x[1][i]))
s.x[4][i] ^= temp0
s.x[5][i] ^= temp1
(s.x[1][i]) ^= (s.x[2][i])
(s.x[3][i]) ^= (s.x[4][i])
(s.x[5][i]) ^= (s.x[0][i]) ^ (s.x[6][i])
(s.x[7][i]) ^= (s.x[0][i])
(s.x[0][i]) ^= (s.x[3][i])
(s.x[2][i]) ^= (s.x[5][i])
(s.x[4][i]) ^= (s.x[1][i]) ^ (s.x[7][i])
(s.x[6][i]) ^= (s.x[1][i])
(s.x[1][i]) = ((((s.x[1][i]) & 0x3333333333333333) << 2) | (((s.x[1][i]) & 0xcccccccccccccccc) >> 2))
(s.x[3][i]) = ((((s.x[3][i]) & 0x3333333333333333) << 2) | (((s.x[3][i]) & 0xcccccccccccccccc) >> 2))
(s.x[5][i]) = ((((s.x[5][i]) & 0x3333333333333333) << 2) | (((s.x[5][i]) & 0xcccccccccccccccc) >> 2))
(s.x[7][i]) = ((((s.x[7][i]) & 0x3333333333333333) << 2) | (((s.x[7][i]) & 0xcccccccccccccccc) >> 2))
}
// round 7*roundnumber+2: Sbox, MDS and Swapping layers
for i = 0; i < 2; i++ {
s.x[6][i] = ^(s.x[6][i])
s.x[7][i] = ^(s.x[7][i])
s.x[0][i] ^= ((^(s.x[4][i])) & (e8BitsliceRoundconstant[roundnumber+2][i]))
s.x[1][i] ^= ((^(s.x[5][i])) & (e8BitsliceRoundconstant[roundnumber+2][i+2]))
temp0 = (e8BitsliceRoundconstant[roundnumber+2][i]) ^ ((s.x[0][i]) & (s.x[2][i]))
temp1 = (e8BitsliceRoundconstant[roundnumber+2][i+2]) ^ ((s.x[1][i]) & (s.x[3][i]))
s.x[0][i] ^= ((s.x[4][i]) & (s.x[6][i]))
s.x[1][i] ^= ((s.x[5][i]) & (s.x[7][i]))
s.x[6][i] ^= ((^(s.x[2][i])) & (s.x[4][i]))
s.x[7][i] ^= ((^(s.x[3][i])) & (s.x[5][i]))
s.x[2][i] ^= ((s.x[0][i]) & (s.x[4][i]))
s.x[3][i] ^= ((s.x[1][i]) & (s.x[5][i]))
s.x[4][i] ^= ((s.x[0][i]) & (^(s.x[6][i])))
s.x[5][i] ^= ((s.x[1][i]) & (^(s.x[7][i])))
s.x[0][i] ^= ((s.x[2][i]) | (s.x[6][i]))
s.x[1][i] ^= ((s.x[3][i]) | (s.x[7][i]))
s.x[6][i] ^= ((s.x[2][i]) & (s.x[4][i]))
s.x[7][i] ^= ((s.x[3][i]) & (s.x[5][i]))
s.x[2][i] ^= (temp0 & (s.x[0][i]))
s.x[3][i] ^= (temp1 & (s.x[1][i]))
s.x[4][i] ^= temp0
s.x[5][i] ^= temp1
(s.x[1][i]) ^= (s.x[2][i])
(s.x[3][i]) ^= (s.x[4][i])
(s.x[5][i]) ^= (s.x[0][i]) ^ (s.x[6][i])
(s.x[7][i]) ^= (s.x[0][i])
(s.x[0][i]) ^= (s.x[3][i])
(s.x[2][i]) ^= (s.x[5][i])
(s.x[4][i]) ^= (s.x[1][i]) ^ (s.x[7][i])
(s.x[6][i]) ^= (s.x[1][i])
(s.x[1][i]) = ((((s.x[1][i]) & 0x0f0f0f0f0f0f0f0f) << 4) | (((s.x[1][i]) & 0xf0f0f0f0f0f0f0f0) >> 4))
(s.x[3][i]) = ((((s.x[3][i]) & 0x0f0f0f0f0f0f0f0f) << 4) | (((s.x[3][i]) & 0xf0f0f0f0f0f0f0f0) >> 4))
(s.x[5][i]) = ((((s.x[5][i]) & 0x0f0f0f0f0f0f0f0f) << 4) | (((s.x[5][i]) & 0xf0f0f0f0f0f0f0f0) >> 4))
(s.x[7][i]) = ((((s.x[7][i]) & 0x0f0f0f0f0f0f0f0f) << 4) | (((s.x[7][i]) & 0xf0f0f0f0f0f0f0f0) >> 4))
}
// round 7*roundnumber+3: Sbox, MDS and Swapping layers
for i = 0; i < 2; i++ {
s.x[6][i] = ^(s.x[6][i])
s.x[7][i] = ^(s.x[7][i])
s.x[0][i] ^= ((^(s.x[4][i])) & (e8BitsliceRoundconstant[roundnumber+3][i]))
s.x[1][i] ^= ((^(s.x[5][i])) & (e8BitsliceRoundconstant[roundnumber+3][i+2]))
temp0 = (e8BitsliceRoundconstant[roundnumber+3][i]) ^ ((s.x[0][i]) & (s.x[2][i]))
temp1 = (e8BitsliceRoundconstant[roundnumber+3][i+2]) ^ ((s.x[1][i]) & (s.x[3][i]))
s.x[0][i] ^= ((s.x[4][i]) & (s.x[6][i]))
s.x[1][i] ^= ((s.x[5][i]) & (s.x[7][i]))
s.x[6][i] ^= ((^(s.x[2][i])) & (s.x[4][i]))
s.x[7][i] ^= ((^(s.x[3][i])) & (s.x[5][i]))
s.x[2][i] ^= ((s.x[0][i]) & (s.x[4][i]))
s.x[3][i] ^= ((s.x[1][i]) & (s.x[5][i]))
s.x[4][i] ^= ((s.x[0][i]) & (^(s.x[6][i])))
s.x[5][i] ^= ((s.x[1][i]) & (^(s.x[7][i])))
s.x[0][i] ^= ((s.x[2][i]) | (s.x[6][i]))
s.x[1][i] ^= ((s.x[3][i]) | (s.x[7][i]))
s.x[6][i] ^= ((s.x[2][i]) & (s.x[4][i]))
s.x[7][i] ^= ((s.x[3][i]) & (s.x[5][i]))
s.x[2][i] ^= (temp0 & (s.x[0][i]))
s.x[3][i] ^= (temp1 & (s.x[1][i]))
s.x[4][i] ^= temp0
s.x[5][i] ^= temp1
(s.x[1][i]) ^= (s.x[2][i])
(s.x[3][i]) ^= (s.x[4][i])
(s.x[5][i]) ^= (s.x[0][i]) ^ (s.x[6][i])
(s.x[7][i]) ^= (s.x[0][i])
(s.x[0][i]) ^= (s.x[3][i])
(s.x[2][i]) ^= (s.x[5][i])
(s.x[4][i]) ^= (s.x[1][i]) ^ (s.x[7][i])
(s.x[6][i]) ^= (s.x[1][i])
(s.x[1][i]) = ((((s.x[1][i]) & 0x00ff00ff00ff00ff) << 8) | (((s.x[1][i]) & 0xff00ff00ff00ff00) >> 8))
(s.x[3][i]) = ((((s.x[3][i]) & 0x00ff00ff00ff00ff) << 8) | (((s.x[3][i]) & 0xff00ff00ff00ff00) >> 8))
(s.x[5][i]) = ((((s.x[5][i]) & 0x00ff00ff00ff00ff) << 8) | (((s.x[5][i]) & 0xff00ff00ff00ff00) >> 8))
(s.x[7][i]) = ((((s.x[7][i]) & 0x00ff00ff00ff00ff) << 8) | (((s.x[7][i]) & 0xff00ff00ff00ff00) >> 8))
}
// round 7*roundnumber+4: Sbox, MDS and Swapping layers
for i = 0; i < 2; i++ {
s.x[6][i] = ^(s.x[6][i])
s.x[7][i] = ^(s.x[7][i])
s.x[0][i] ^= ((^(s.x[4][i])) & (e8BitsliceRoundconstant[roundnumber+4][i]))
s.x[1][i] ^= ((^(s.x[5][i])) & (e8BitsliceRoundconstant[roundnumber+4][i+2]))
temp0 = (e8BitsliceRoundconstant[roundnumber+4][i]) ^ ((s.x[0][i]) & (s.x[2][i]))
temp1 = (e8BitsliceRoundconstant[roundnumber+4][i+2]) ^ ((s.x[1][i]) & (s.x[3][i]))
s.x[0][i] ^= ((s.x[4][i]) & (s.x[6][i]))
s.x[1][i] ^= ((s.x[5][i]) & (s.x[7][i]))
s.x[6][i] ^= ((^(s.x[2][i])) & (s.x[4][i]))
s.x[7][i] ^= ((^(s.x[3][i])) & (s.x[5][i]))
s.x[2][i] ^= ((s.x[0][i]) & (s.x[4][i]))
s.x[3][i] ^= ((s.x[1][i]) & (s.x[5][i]))
s.x[4][i] ^= ((s.x[0][i]) & (^(s.x[6][i])))
s.x[5][i] ^= ((s.x[1][i]) & (^(s.x[7][i])))
s.x[0][i] ^= ((s.x[2][i]) | (s.x[6][i]))
s.x[1][i] ^= ((s.x[3][i]) | (s.x[7][i]))
s.x[6][i] ^= ((s.x[2][i]) & (s.x[4][i]))
s.x[7][i] ^= ((s.x[3][i]) & (s.x[5][i]))
s.x[2][i] ^= (temp0 & (s.x[0][i]))
s.x[3][i] ^= (temp1 & (s.x[1][i]))
s.x[4][i] ^= temp0
s.x[5][i] ^= temp1
(s.x[1][i]) ^= (s.x[2][i])
(s.x[3][i]) ^= (s.x[4][i])
(s.x[5][i]) ^= (s.x[0][i]) ^ (s.x[6][i])
(s.x[7][i]) ^= (s.x[0][i])
(s.x[0][i]) ^= (s.x[3][i])
(s.x[2][i]) ^= (s.x[5][i])
(s.x[4][i]) ^= (s.x[1][i]) ^ (s.x[7][i])
(s.x[6][i]) ^= (s.x[1][i])
(s.x[1][i]) = ((((s.x[1][i]) & 0x0000ffff0000ffff) << 16) | (((s.x[1][i]) & 0xffff0000ffff0000) >> 16))
(s.x[3][i]) = ((((s.x[3][i]) & 0x0000ffff0000ffff) << 16) | (((s.x[3][i]) & 0xffff0000ffff0000) >> 16))
(s.x[5][i]) = ((((s.x[5][i]) & 0x0000ffff0000ffff) << 16) | (((s.x[5][i]) & 0xffff0000ffff0000) >> 16))
(s.x[7][i]) = ((((s.x[7][i]) & 0x0000ffff0000ffff) << 16) | (((s.x[7][i]) & 0xffff0000ffff0000) >> 16))
}
// round 7*roundnumber+5: Sbox, MDS and Swapping layers
for i = 0; i < 2; i++ {
s.x[6][i] = ^(s.x[6][i])
s.x[7][i] = ^(s.x[7][i])
s.x[0][i] ^= ((^(s.x[4][i])) & (e8BitsliceRoundconstant[roundnumber+5][i]))
s.x[1][i] ^= ((^(s.x[5][i])) & (e8BitsliceRoundconstant[roundnumber+5][i+2]))
temp0 = (e8BitsliceRoundconstant[roundnumber+5][i]) ^ ((s.x[0][i]) & (s.x[2][i]))
temp1 = (e8BitsliceRoundconstant[roundnumber+5][i+2]) ^ ((s.x[1][i]) & (s.x[3][i]))
s.x[0][i] ^= ((s.x[4][i]) & (s.x[6][i]))
s.x[1][i] ^= ((s.x[5][i]) & (s.x[7][i]))
s.x[6][i] ^= ((^(s.x[2][i])) & (s.x[4][i]))
s.x[7][i] ^= ((^(s.x[3][i])) & (s.x[5][i]))
s.x[2][i] ^= ((s.x[0][i]) & (s.x[4][i]))
s.x[3][i] ^= ((s.x[1][i]) & (s.x[5][i]))
s.x[4][i] ^= ((s.x[0][i]) & (^(s.x[6][i])))
s.x[5][i] ^= ((s.x[1][i]) & (^(s.x[7][i])))
s.x[0][i] ^= ((s.x[2][i]) | (s.x[6][i]))
s.x[1][i] ^= ((s.x[3][i]) | (s.x[7][i]))
s.x[6][i] ^= ((s.x[2][i]) & (s.x[4][i]))
s.x[7][i] ^= ((s.x[3][i]) & (s.x[5][i]))
s.x[2][i] ^= (temp0 & (s.x[0][i]))
s.x[3][i] ^= (temp1 & (s.x[1][i]))
s.x[4][i] ^= temp0
s.x[5][i] ^= temp1
(s.x[1][i]) ^= (s.x[2][i])
(s.x[3][i]) ^= (s.x[4][i])
(s.x[5][i]) ^= (s.x[0][i]) ^ (s.x[6][i])
(s.x[7][i]) ^= (s.x[0][i])
(s.x[0][i]) ^= (s.x[3][i])
(s.x[2][i]) ^= (s.x[5][i])
(s.x[4][i]) ^= (s.x[1][i]) ^ (s.x[7][i])
(s.x[6][i]) ^= (s.x[1][i])
(s.x[1][i]) = (((s.x[1][i]) << 32) | ((s.x[1][i]) >> 32))
(s.x[3][i]) = (((s.x[3][i]) << 32) | ((s.x[3][i]) >> 32))
(s.x[5][i]) = (((s.x[5][i]) << 32) | ((s.x[5][i]) >> 32))
(s.x[7][i]) = (((s.x[7][i]) << 32) | ((s.x[7][i]) >> 32))
}
// round 7*roundnumber+6: Sbox and MDS layers
for i = 0; i < 2; i++ {
s.x[6][i] = ^(s.x[6][i])
s.x[7][i] = ^(s.x[7][i])
s.x[0][i] ^= ((^(s.x[4][i])) & (e8BitsliceRoundconstant[roundnumber+6][i]))
s.x[1][i] ^= ((^(s.x[5][i])) & (e8BitsliceRoundconstant[roundnumber+6][i+2]))
temp0 = (e8BitsliceRoundconstant[roundnumber+6][i]) ^ ((s.x[0][i]) & (s.x[2][i]))
temp1 = (e8BitsliceRoundconstant[roundnumber+6][i+2]) ^ ((s.x[1][i]) & (s.x[3][i]))
s.x[0][i] ^= ((s.x[4][i]) & (s.x[6][i]))
s.x[1][i] ^= ((s.x[5][i]) & (s.x[7][i]))
s.x[6][i] ^= ((^(s.x[2][i])) & (s.x[4][i]))
s.x[7][i] ^= ((^(s.x[3][i])) & (s.x[5][i]))
s.x[2][i] ^= ((s.x[0][i]) & (s.x[4][i]))
s.x[3][i] ^= ((s.x[1][i]) & (s.x[5][i]))
s.x[4][i] ^= ((s.x[0][i]) & (^(s.x[6][i])))
s.x[5][i] ^= ((s.x[1][i]) & (^(s.x[7][i])))
s.x[0][i] ^= ((s.x[2][i]) | (s.x[6][i]))
s.x[1][i] ^= ((s.x[3][i]) | (s.x[7][i]))
s.x[6][i] ^= ((s.x[2][i]) & (s.x[4][i]))
s.x[7][i] ^= ((s.x[3][i]) & (s.x[5][i]))
s.x[2][i] ^= (temp0 & (s.x[0][i]))
s.x[3][i] ^= (temp1 & (s.x[1][i]))
s.x[4][i] ^= temp0
s.x[5][i] ^= temp1
(s.x[1][i]) ^= (s.x[2][i])
(s.x[3][i]) ^= (s.x[4][i])
(s.x[5][i]) ^= (s.x[0][i]) ^ (s.x[6][i])
(s.x[7][i]) ^= (s.x[0][i])
(s.x[0][i]) ^= (s.x[3][i])
(s.x[2][i]) ^= (s.x[5][i])
(s.x[4][i]) ^= (s.x[1][i]) ^ (s.x[7][i])
(s.x[6][i]) ^= (s.x[1][i])
}
// round 7*roundnumber+6: swapping layer
for i = 1; i < 8; i = i + 2 {
temp0 = s.x[i][0]
s.x[i][0] = s.x[i][1]
s.x[i][1] = temp0
}
}
}