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
|
using System;
using System.IO;
using Org.BouncyCastle.Utilities;
namespace Org.BouncyCastle.Crypto.Digests
{
/**
* Photon-Beetle, https://www.isical.ac.in/~lightweight/beetle/
* https://csrc.nist.gov/CSRC/media/Projects/lightweight-cryptography/documents/readonlyist-round/updated-spec-doc/photon-beetle-spec-readonly.pdf
* <p>
* Photon-Beetle with reference to C Reference Impl from: https://github.com/PHOTON-Beetle/Software
* </p>
*/
public sealed class PhotonBeetleDigest
: IDigest
{
private byte[] state;
private byte[][] state_2d;
private MemoryStream buffer = new MemoryStream();
private const int INITIAL_RATE_INBYTES = 16;
private int RATE_INBYTES = 4;
private int SQUEEZE_RATE_INBYTES = 16;
private int STATE_INBYTES = 32;
private int TAG_INBYTES = 32;
private int LAST_THREE_BITS_OFFSET = 5;
private int ROUND = 12;
private int D = 8;
private int Dq = 3;
private int Dr = 7;
private int DSquare = 64;
private int S = 4;
private int S_1 = 3;
private byte[][] RC = {//[D][12]
new byte[]{1, 3, 7, 14, 13, 11, 6, 12, 9, 2, 5, 10},
new byte[]{0, 2, 6, 15, 12, 10, 7, 13, 8, 3, 4, 11},
new byte[]{2, 0, 4, 13, 14, 8, 5, 15, 10, 1, 6, 9},
new byte[]{6, 4, 0, 9, 10, 12, 1, 11, 14, 5, 2, 13},
new byte[]{14, 12, 8, 1, 2, 4, 9, 3, 6, 13, 10, 5},
new byte[]{15, 13, 9, 0, 3, 5, 8, 2, 7, 12, 11, 4},
new byte[]{13, 15, 11, 2, 1, 7, 10, 0, 5, 14, 9, 6},
new byte[]{9, 11, 15, 6, 5, 3, 14, 4, 1, 10, 13, 2}
};
private byte[][] MixColMatrix = { //[D][D]
new byte[]{2, 4, 2, 11, 2, 8, 5, 6},
new byte[]{12, 9, 8, 13, 7, 7, 5, 2},
new byte[]{4, 4, 13, 13, 9, 4, 13, 9},
new byte[] {1, 6, 5, 1, 12, 13, 15, 14},
new byte[]{15, 12, 9, 13, 14, 5, 14, 13},
new byte[]{9, 14, 5, 15, 4, 12, 9, 6},
new byte[]{12, 2, 2, 10, 3, 1, 1, 14},
new byte[]{15, 1, 13, 10, 5, 10, 2, 3}
};
private byte[] sbox = { 12, 5, 6, 11, 9, 0, 10, 13, 3, 14, 15, 8, 4, 7, 1, 2 };
public PhotonBeetleDigest()
{
state = new byte[STATE_INBYTES];
state_2d = new byte[D][];
for (int i = 0; i < D; ++i)
{
state_2d[i] = new byte[D];
}
}
public String AlgorithmName => "Photon-Beetle Hash";
public int GetDigestSize() => TAG_INBYTES;
public int GetByteLength()
{
// TODO
throw new NotImplementedException();
}
public void Update(byte input)
{
buffer.WriteByte(input);
}
public void BlockUpdate(byte[] input, int inOff, int inLen)
{
Check.DataLength(input, inOff, inLen, "input buffer too short");
buffer.Write(input, inOff, inLen);
}
#if NETCOREAPP2_1_OR_GREATER || NETSTANDARD2_1_OR_GREATER
public void BlockUpdate(ReadOnlySpan<byte> input)
{
buffer.Write(input);
}
#endif
public int DoFinal(byte[] output, int outOff)
{
Check.OutputLength(output, outOff, 32, "output buffer too short");
byte[] input = buffer.GetBuffer();
int inlen = (int)buffer.Length;
if (inlen == 0)
{
state[STATE_INBYTES - 1] ^= (byte)(1 << LAST_THREE_BITS_OFFSET);
}
else if (inlen <= INITIAL_RATE_INBYTES)
{
Array.Copy(input, 0, state, 0, inlen);
if (inlen < INITIAL_RATE_INBYTES)
{
state[inlen] ^= 0x01; // ozs
}
state[STATE_INBYTES - 1] ^= (byte)((inlen < INITIAL_RATE_INBYTES ? 1 : 2) << LAST_THREE_BITS_OFFSET);
}
else
{
Array.Copy(input, 0, state, 0, INITIAL_RATE_INBYTES);
inlen -= INITIAL_RATE_INBYTES;
int Dlen_inblocks = (inlen + RATE_INBYTES - 1) / RATE_INBYTES;
int i, LastDBlocklen;
for (i = 0; i < Dlen_inblocks - 1; i++)
{
PHOTON_Permutation();
Bytes.XorTo(RATE_INBYTES, input, INITIAL_RATE_INBYTES + i * RATE_INBYTES, state, 0);
}
PHOTON_Permutation();
LastDBlocklen = inlen - i * RATE_INBYTES;
Bytes.XorTo(LastDBlocklen, input, INITIAL_RATE_INBYTES + i * RATE_INBYTES, state, 0);
if (LastDBlocklen < RATE_INBYTES)
{
state[LastDBlocklen] ^= 0x01; // ozs
}
state[STATE_INBYTES - 1] ^= (byte)((inlen % RATE_INBYTES == 0 ? 1 : 2) << LAST_THREE_BITS_OFFSET);
}
PHOTON_Permutation();
Array.Copy(state, 0, output, outOff, SQUEEZE_RATE_INBYTES);
PHOTON_Permutation();
Array.Copy(state, 0, output, outOff + SQUEEZE_RATE_INBYTES, TAG_INBYTES - SQUEEZE_RATE_INBYTES);
return TAG_INBYTES;
}
#if NETCOREAPP2_1_OR_GREATER || NETSTANDARD2_1_OR_GREATER
public int DoFinal(Span<byte> output)
{
byte[] rv = new byte[32];
int rlt = DoFinal(rv, 0);
rv.AsSpan(0, 32).CopyTo(output);
return rlt;
}
#endif
public void Reset()
{
buffer.SetLength(0);
Arrays.Fill(state, (byte)0);
}
private void PHOTON_Permutation()
{
int i, j, k, l;
for (i = 0; i < DSquare; i++)
{
state_2d[i >> Dq][i & Dr] = (byte)(((state[i >> 1] & 0xFF) >> (4 * (i & 1))) & 0xf);
}
for (int round = 0; round < ROUND; round++)
{
//AddKey
for (i = 0; i < D; i++)
{
state_2d[i][0] ^= RC[i][round];
}
//SubCell
for (i = 0; i < D; i++)
{
for (j = 0; j < D; j++)
{
state_2d[i][j] = sbox[state_2d[i][j]];
}
}
//ShiftRow
for (i = 1; i < D; i++)
{
Array.Copy(state_2d[i], 0, state, 0, D);
Array.Copy(state, i, state_2d[i], 0, D - i);
Array.Copy(state, 0, state_2d[i], D - i, i);
}
//MixColumn
for (j = 0; j < D; j++)
{
for (i = 0; i < D; i++)
{
byte sum = 0;
for (k = 0; k < D; k++)
{
int x = MixColMatrix[i][k], ret = 0, b = state_2d[k][j];
for (l = 0; l < S; l++)
{
if (((b >> l) & 1) != 0)
{
ret ^= x;
}
if (((x >> S_1) & 1) != 0)
{
x <<= 1;
x ^= 0x3;
}
else
{
x <<= 1;
}
}
sum ^= (byte)(ret & 15);
}
state[i] = sum;
}
for (i = 0; i < D; i++)
{
state_2d[i][j] = state[i];
}
}
}
for (i = 0; i < DSquare; i += 2)
{
state[i >> 1] = (byte)(((state_2d[i >> Dq][i & Dr] & 0xf)) | ((state_2d[i >> Dq][(i + 1) & Dr] & 0xf) << 4));
}
}
}
}
|
