-
Notifications
You must be signed in to change notification settings - Fork 22
/
utils.go
200 lines (152 loc) · 3.7 KB
/
utils.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
package mars
import (
"math/bits"
"encoding/binary"
)
func ROL32(x, n uint32) uint32 {
return bits.RotateLeft32(x, int(n))
}
func ROR32(x, n uint32) uint32 {
return ROL32(x, 32 - n);
}
// S-box S
func S(n uint32) uint32 {
return sbox[n & 0x1FF]
}
// S-box S0
func S0(n uint32) uint32 {
return sbox[n & 0xFF]
}
// S-box S1
func S1(n uint32) uint32 {
return sbox[(n & 0xFF) + 256]
}
func F_MIX(a, b, c, d *uint32) {
var t uint32
(*b) ^= S0((*a))
t = ROR32((*a), 8)
(*b) += S1(t)
t = ROR32((*a), 16)
(*c) += S0(t)
(*a) = ROR32((*a), 24)
(*d) ^= S1((*a))
}
// Backwards mixing
func B_MIX(a, b, c, d *uint32) {
var t uint32
(*b) ^= S1((*a))
t = ROL32((*a), 8)
(*c) -= S0(t)
t = ROL32((*a), 16)
(*d) -= S1(t)
(*a) = ROL32((*a), 24)
(*d) ^= S0((*a))
}
// Cryptographic core (encryption)
func CORE(a, b, c, d *uint32, k1, k2 uint32) {
var r uint32
var l uint32
var m uint32
m = (*a) + k1
(*a) = ROL32((*a), 13)
r = (*a) * k2
r = ROL32(r, 5)
(*c) += ROL32(m, r & 0x1F)
l = S(m) ^ r
r = ROL32(r, 5)
l ^= r
(*d) ^= r
(*b) += ROL32(l, r & 0x1F)
}
// Cryptographic core (decryption)
func CORE_INV(a, b, c, d *uint32, k1, k2 uint32) {
var r uint32
var l uint32
var m uint32
r = (*a) * k2
(*a) = ROR32((*a), 13)
m = (*a) + k1
r = ROL32(r, 5)
(*c) -= ROL32(m, r & 0x1F)
l = S(m) ^ r
r = ROL32(r, 5)
l ^= r
(*d) ^= r
(*b) -= ROL32(l, r & 0x1F)
}
// Mask generation (Brian Gladman and Shai Halevi's technique)
func MASK_GEN(m *uint32, w uint32) {
(*m) = ^w ^ (w >> 1)
(*m) &= 0x7FFFFFFF
(*m) &= ((*m) >> 1) & ((*m) >> 2)
(*m) &= ((*m) >> 3) & ((*m) >> 6)
if (*m) != 0 {
(*m) <<= 1
(*m) |= ((*m) << 1)
(*m) |= ((*m) << 2)
(*m) |= ((*m) << 4)
(*m) &= 0xFFFFFFFC
}
}
// Endianness option
const littleEndian bool = true
func bytesToUint32(inp []byte) (blk uint32) {
if littleEndian {
blk = binary.LittleEndian.Uint32(inp[0:])
} else {
blk = binary.BigEndian.Uint32(inp[0:])
}
return
}
func uint32ToBytes(blk uint32) [4]byte {
var sav [4]byte
if littleEndian {
binary.LittleEndian.PutUint32(sav[0:], blk)
} else {
binary.BigEndian.PutUint32(sav[0:], blk)
}
return sav
}
func bytesToUint32s(inp []byte) [4]uint32 {
var blk [4]uint32
if littleEndian {
blk[0] = binary.LittleEndian.Uint32(inp[0:])
blk[1] = binary.LittleEndian.Uint32(inp[4:])
blk[2] = binary.LittleEndian.Uint32(inp[8:])
blk[3] = binary.LittleEndian.Uint32(inp[12:])
} else {
blk[0] = binary.BigEndian.Uint32(inp[0:])
blk[1] = binary.BigEndian.Uint32(inp[4:])
blk[2] = binary.BigEndian.Uint32(inp[8:])
blk[3] = binary.BigEndian.Uint32(inp[12:])
}
return blk
}
func uint32sToBytes(blk [4]uint32) [16]byte {
var sav [16]byte
if littleEndian {
binary.LittleEndian.PutUint32(sav[0:], blk[0])
binary.LittleEndian.PutUint32(sav[4:], blk[1])
binary.LittleEndian.PutUint32(sav[8:], blk[2])
binary.LittleEndian.PutUint32(sav[12:], blk[3])
} else {
binary.BigEndian.PutUint32(sav[0:], blk[0])
binary.BigEndian.PutUint32(sav[4:], blk[1])
binary.BigEndian.PutUint32(sav[8:], blk[2])
binary.BigEndian.PutUint32(sav[12:], blk[3])
}
return sav
}
func keyToUint32s(b []byte) []uint32 {
size := len(b) / 4
dst := make([]uint32, size)
for i := 0; i < size; i++ {
j := i * 4
if littleEndian {
dst[i] = binary.LittleEndian.Uint32(b[j:])
} else {
dst[i] = binary.BigEndian.Uint32(b[j:])
}
}
return dst
}