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
|
package org.bouncycastle.crypto.macs;
import org.bouncycastle.crypto.CipherParameters;
import org.bouncycastle.crypto.DataLengthException;
import org.bouncycastle.crypto.Mac;
import org.bouncycastle.crypto.params.KeyParameter;
import org.bouncycastle.util.Pack;
/**
* Implementation of SipHash as specified in "SipHash: a fast short-input PRF", by Jean-Philippe
* Aumasson and Daniel J. Bernstein (https://131002.net/siphash/siphash.pdf).
* <p>
* "SipHash is a family of PRFs SipHash-c-d where the integer parameters c and d are the number of
* compression rounds and the number of finalization rounds. A compression round is identical to a
* finalization round and this round function is called SipRound. Given a 128-bit key k and a
* (possibly empty) byte string m, SipHash-c-d returns a 64-bit value..."
*/
public class SipHash
implements Mac
{
protected final int c, d;
protected long k0, k1;
protected long v0, v1, v2, v3;
protected long m = 0;
protected int wordPos = 0;
protected int wordCount = 0;
/**
* SipHash-2-4
*/
public SipHash()
{
// use of 'this' confuses the flow analyser on earlier JDKs.
this.c = 2;
this.d = 4;
}
/**
* SipHash-c-d
*
* @param c the number of compression rounds
* @param d the number of finalization rounds
*/
public SipHash(int c, int d)
{
this.c = c;
this.d = d;
}
public String getAlgorithmName()
{
return "SipHash-" + c + "-" + d;
}
public int getMacSize()
{
return 8;
}
public void init(CipherParameters params)
throws IllegalArgumentException
{
if (!(params instanceof KeyParameter))
{
throw new IllegalArgumentException("'params' must be an instance of KeyParameter");
}
KeyParameter keyParameter = (KeyParameter)params;
byte[] key = keyParameter.getKey();
if (key.length != 16)
{
throw new IllegalArgumentException("'params' must be a 128-bit key");
}
this.k0 = Pack.littleEndianToLong(key, 0);
this.k1 = Pack.littleEndianToLong(key, 8);
reset();
}
public void update(byte input)
throws IllegalStateException
{
m >>>= 8;
m |= (input & 0xffL) << 56;
if (++wordPos == 8)
{
processMessageWord();
wordPos = 0;
}
}
public void update(byte[] input, int offset, int length)
throws DataLengthException,
IllegalStateException
{
int i = 0, fullWords = length & ~7;
if (wordPos == 0)
{
for (; i < fullWords; i += 8)
{
m = Pack.littleEndianToLong(input, offset + i);
processMessageWord();
}
for (; i < length; ++i)
{
m >>>= 8;
m |= (input[offset + i] & 0xffL) << 56;
}
wordPos = length - fullWords;
}
else
{
int bits = wordPos << 3;
for (; i < fullWords; i += 8)
{
long n = Pack.littleEndianToLong(input, offset + i);
m = (n << bits) | (m >>> -bits);
processMessageWord();
m = n;
}
for (; i < length; ++i)
{
m >>>= 8;
m |= (input[offset + i] & 0xffL) << 56;
if (++wordPos == 8)
{
processMessageWord();
wordPos = 0;
}
}
}
}
public long doFinal()
throws DataLengthException, IllegalStateException
{
// NOTE: 2 distinct shifts to avoid "64-bit shift" when wordPos == 0
m >>>= ((7 - wordPos) << 3);
m >>>= 8;
m |= (((wordCount << 3) + wordPos) & 0xffL) << 56;
processMessageWord();
v2 ^= 0xffL;
applySipRounds(d);
long result = v0 ^ v1 ^ v2 ^ v3;
reset();
return result;
}
public int doFinal(byte[] out, int outOff)
throws DataLengthException, IllegalStateException
{
long result = doFinal();
Pack.longToLittleEndian(result, out, outOff);
return 8;
}
public void reset()
{
v0 = k0 ^ 0x736f6d6570736575L;
v1 = k1 ^ 0x646f72616e646f6dL;
v2 = k0 ^ 0x6c7967656e657261L;
v3 = k1 ^ 0x7465646279746573L;
m = 0;
wordPos = 0;
wordCount = 0;
}
protected void processMessageWord()
{
++wordCount;
v3 ^= m;
applySipRounds(c);
v0 ^= m;
}
protected void applySipRounds(int n)
{
long r0 = v0, r1 = v1, r2 = v2, r3 = v3;
for (int r = 0; r < n; ++r)
{
r0 += r1;
r2 += r3;
r1 = rotateLeft(r1, 13);
r3 = rotateLeft(r3, 16);
r1 ^= r0;
r3 ^= r2;
r0 = rotateLeft(r0, 32);
r2 += r1;
r0 += r3;
r1 = rotateLeft(r1, 17);
r3 = rotateLeft(r3, 21);
r1 ^= r2;
r3 ^= r0;
r2 = rotateLeft(r2, 32);
}
v0 = r0; v1 = r1; v2 = r2; v3 = r3;
}
protected static long rotateLeft(long x, int n)
{
return (x << n) | (x >>> -n);
}
}
|
