@theqrl/dilithium5 0.0.9 → 0.1.0

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
package/src/packing.js DELETED
@@ -1,194 +0,0 @@
1
- const {
2
- K,
3
- L,
4
- N,
5
- OMEGA,
6
- PolyETAPackedBytes,
7
- PolyT0PackedBytes,
8
- PolyT1PackedBytes,
9
- PolyZPackedBytes,
10
- SeedBytes,
11
- } = require('./const.js');
12
- const {
13
- polyEtaPack,
14
- polyEtaUnpack,
15
- polyT0Pack,
16
- polyT0Unpack,
17
- polyT1Pack,
18
- polyT1Unpack,
19
- polyZPack,
20
- polyZUnpack,
21
- } = require('./poly.js');
22
-
23
- function packPk(pkp, rho, t1) {
24
- const pk = pkp;
25
- for (let i = 0; i < SeedBytes; ++i) {
26
- pk[i] = rho[i];
27
- }
28
- for (let i = 0; i < K; ++i) {
29
- polyT1Pack(pk, SeedBytes + i * PolyT1PackedBytes, t1.vec[i]);
30
- }
31
- }
32
-
33
- function unpackPk(rhop, t1, pk) {
34
- const rho = rhop;
35
- for (let i = 0; i < SeedBytes; ++i) {
36
- rho[i] = pk[i];
37
- }
38
-
39
- for (let i = 0; i < K; ++i) {
40
- polyT1Unpack(t1.vec[i], pk, SeedBytes + i * PolyT1PackedBytes);
41
- }
42
- }
43
-
44
- function packSk(skp, rho, tr, key, t0, s1, s2) {
45
- let skOffset = 0;
46
- const sk = skp;
47
- for (let i = 0; i < SeedBytes; ++i) {
48
- sk[i] = rho[i];
49
- }
50
- skOffset += SeedBytes;
51
-
52
- for (let i = 0; i < SeedBytes; ++i) {
53
- sk[skOffset + i] = key[i];
54
- }
55
- skOffset += SeedBytes;
56
-
57
- for (let i = 0; i < SeedBytes; ++i) {
58
- sk[skOffset + i] = tr[i];
59
- }
60
- skOffset += SeedBytes;
61
-
62
- for (let i = 0; i < L; ++i) {
63
- polyEtaPack(sk, skOffset + i * PolyETAPackedBytes, s1.vec[i]);
64
- }
65
- skOffset += L * PolyETAPackedBytes;
66
-
67
- for (let i = 0; i < K; ++i) {
68
- polyEtaPack(sk, skOffset + i * PolyETAPackedBytes, s2.vec[i]);
69
- }
70
- skOffset += K * PolyETAPackedBytes;
71
-
72
- for (let i = 0; i < K; ++i) {
73
- polyT0Pack(sk, skOffset + i * PolyT0PackedBytes, t0.vec[i]);
74
- }
75
- }
76
-
77
- function unpackSk(rhoP, trP, keyP, t0, s1, s2, sk) {
78
- let skOffset = 0;
79
- const rho = rhoP;
80
- const tr = trP;
81
- const key = keyP;
82
- for (let i = 0; i < SeedBytes; ++i) {
83
- rho[i] = sk[skOffset + i];
84
- }
85
- skOffset += SeedBytes;
86
-
87
- for (let i = 0; i < SeedBytes; ++i) {
88
- key[i] = sk[skOffset + i];
89
- }
90
- skOffset += SeedBytes;
91
-
92
- for (let i = 0; i < SeedBytes; ++i) {
93
- tr[i] = sk[skOffset + i];
94
- }
95
- skOffset += SeedBytes;
96
-
97
- for (let i = 0; i < L; ++i) {
98
- polyEtaUnpack(s1.vec[i], sk, skOffset + i * PolyETAPackedBytes);
99
- }
100
- skOffset += L * PolyETAPackedBytes;
101
-
102
- for (let i = 0; i < K; ++i) {
103
- polyEtaUnpack(s2.vec[i], sk, skOffset + i * PolyETAPackedBytes);
104
- }
105
- skOffset += K * PolyETAPackedBytes;
106
-
107
- for (let i = 0; i < K; ++i) {
108
- polyT0Unpack(t0.vec[i], sk, skOffset + i * PolyT0PackedBytes);
109
- }
110
- }
111
-
112
- function packSig(sigP, c, z, h) {
113
- let sigOffset = 0;
114
- const sig = sigP;
115
- for (let i = 0; i < SeedBytes; ++i) {
116
- sig[i] = c[i];
117
- }
118
- sigOffset += SeedBytes;
119
-
120
- for (let i = 0; i < L; ++i) {
121
- polyZPack(sig, sigOffset + i * PolyZPackedBytes, z.vec[i]);
122
- }
123
- sigOffset += L * PolyZPackedBytes;
124
-
125
- for (let i = 0; i < OMEGA + K; ++i) {
126
- sig[sigOffset + i] = 0;
127
- }
128
-
129
- let k = 0;
130
- for (let i = 0; i < K; ++i) {
131
- for (let j = 0; j < N; ++j) {
132
- if (h.vec[i].coeffs[j] !== 0) {
133
- sig[sigOffset + k++] = j;
134
- }
135
- }
136
-
137
- sig[sigOffset + OMEGA + i] = k;
138
- }
139
- }
140
-
141
- function unpackSig(cP, z, hP, sig) {
142
- let sigOffset = 0;
143
- const c = cP;
144
- const h = hP;
145
- for (let i = 0; i < SeedBytes; ++i) {
146
- c[i] = sig[i];
147
- }
148
- sigOffset += SeedBytes;
149
-
150
- for (let i = 0; i < L; ++i) {
151
- polyZUnpack(z.vec[i], sig, sigOffset + i * PolyZPackedBytes);
152
- }
153
- sigOffset += L * PolyZPackedBytes;
154
-
155
- /* Decode h */
156
- let k = 0;
157
- for (let i = 0; i < K; ++i) {
158
- for (let j = 0; j < N; ++j) {
159
- h.vec[i].coeffs[j] = 0;
160
- }
161
-
162
- if (sig[sigOffset + OMEGA + i] < k || sig[sigOffset + OMEGA + i] > OMEGA) {
163
- return 1;
164
- }
165
-
166
- for (let j = k; j < sig[sigOffset + OMEGA + i]; ++j) {
167
- /* Coefficients are ordered for strong unforgeability */
168
- if (j > k && sig[sigOffset + j] <= sig[sigOffset + j - 1]) {
169
- return 1;
170
- }
171
- h.vec[i].coeffs[sig[sigOffset + j]] = 1;
172
- }
173
-
174
- k = sig[sigOffset + OMEGA + i];
175
- }
176
-
177
- /* Extra indices are zero for strong unforgeability */
178
- for (let j = k; j < OMEGA; ++j) {
179
- if (sig[sigOffset + j]) {
180
- return 1;
181
- }
182
- }
183
-
184
- return 0;
185
- }
186
-
187
- module.exports = {
188
- packPk,
189
- unpackPk,
190
- packSk,
191
- unpackSk,
192
- packSig,
193
- unpackSig,
194
- };
package/src/poly.js DELETED
@@ -1,472 +0,0 @@
1
- const {
2
- D,
3
- ETA,
4
- GAMMA1,
5
- N,
6
- PolyUniformETANBlocks,
7
- PolyUniformGamma1NBlocks,
8
- PolyUniformNBlocks,
9
- Q,
10
- SeedBytes,
11
- Shake256Rate,
12
- Stream128BlockBytes,
13
- Stream256BlockBytes,
14
- TAU,
15
- } = require('./const.js');
16
-
17
- const {
18
- KeccakState,
19
- shake128SqueezeBlocks,
20
- shake256Absorb,
21
- shake256Finalize,
22
- shake256Init,
23
- shake256SqueezeBlocks,
24
- } = require('./fips202.js');
25
-
26
- const { dilithiumShake128StreamInit, dilithiumShake256StreamInit } = require('./symmetric-shake.js');
27
- const { invNTTToMont, ntt } = require('./ntt.js');
28
- const { cAddQ, montgomeryReduce, reduce32 } = require('./reduce.js');
29
- const { decompose, makeHint, power2round, useHint } = require('./rounding.js');
30
-
31
- class Poly {
32
- constructor() {
33
- this.coeffs = new Int32Array(N);
34
- }
35
-
36
- copy(poly) {
37
- for (let i = N - 1; i >= 0; i--) {
38
- this.coeffs[i] = poly.coeffs[i];
39
- }
40
- }
41
- }
42
-
43
- function polyReduce(aP) {
44
- const a = aP;
45
- for (let i = 0; i < N; ++i) a.coeffs[i] = reduce32(a.coeffs[i]);
46
- }
47
-
48
- function polyCAddQ(aP) {
49
- const a = aP;
50
- for (let i = 0; i < N; ++i) a.coeffs[i] = cAddQ(a.coeffs[i]);
51
- }
52
-
53
- function polyAdd(cP, a, b) {
54
- const c = cP;
55
- for (let i = 0; i < N; ++i) c.coeffs[i] = a.coeffs[i] + b.coeffs[i];
56
- }
57
-
58
- function polySub(cP, a, b) {
59
- const c = cP;
60
- for (let i = 0; i < N; ++i) c.coeffs[i] = a.coeffs[i] - b.coeffs[i];
61
- }
62
-
63
- function polyShiftL(aP) {
64
- const a = aP;
65
- for (let i = 0; i < N; ++i) a.coeffs[i] <<= D;
66
- }
67
-
68
- function polyNTT(a) {
69
- ntt(a.coeffs);
70
- }
71
-
72
- function polyInvNTTToMont(a) {
73
- invNTTToMont(a.coeffs);
74
- }
75
-
76
- function polyPointWiseMontgomery(cP, a, b) {
77
- const c = cP;
78
- for (let i = 0; i < N; ++i) c.coeffs[i] = Number(montgomeryReduce(BigInt(a.coeffs[i]) * BigInt(b.coeffs[i])));
79
- }
80
-
81
- function polyPower2round(a1p, a0, a) {
82
- const a1 = a1p;
83
- for (let i = 0; i < N; ++i) a1.coeffs[i] = power2round(a0.coeffs, i, a.coeffs[i]);
84
- }
85
-
86
- function polyDecompose(a1p, a0, a) {
87
- const a1 = a1p;
88
- for (let i = 0; i < N; ++i) a1.coeffs[i] = decompose(a0.coeffs, i, a.coeffs[i]);
89
- }
90
-
91
- function polyMakeHint(hp, a0, a1) {
92
- let s = 0;
93
- const h = hp;
94
- for (let i = 0; i < N; ++i) {
95
- h.coeffs[i] = makeHint(a0.coeffs[i], a1.coeffs[i]);
96
- s += h.coeffs[i];
97
- }
98
-
99
- return s;
100
- }
101
-
102
- function polyUseHint(bp, a, h) {
103
- const b = bp;
104
- for (let i = 0; i < N; ++i) {
105
- b.coeffs[i] = useHint(a.coeffs[i], h.coeffs[i]);
106
- }
107
- }
108
-
109
- function polyChkNorm(a, b) {
110
- if (b > Math.floor((Q - 1) / 8)) {
111
- return 1;
112
- }
113
-
114
- for (let i = 0; i < N; i++) {
115
- let t = a.coeffs[i] >> 31;
116
- t = a.coeffs[i] - (t & (2 * a.coeffs[i]));
117
-
118
- if (t >= b) {
119
- return 1;
120
- }
121
- }
122
-
123
- return 0;
124
- }
125
-
126
- function rejUniform(ap, aOffset, len, buf, bufLen) {
127
- let ctr = 0;
128
- let pos = 0;
129
- const a = ap;
130
- while (ctr < len && pos + 3 <= bufLen) {
131
- let t = buf[pos++];
132
- t |= buf[pos++] << 8;
133
- t |= buf[pos++] << 16;
134
- t &= 0x7fffff;
135
-
136
- if (t < Q) {
137
- a[aOffset + ctr++] = t;
138
- }
139
- }
140
-
141
- return ctr;
142
- }
143
-
144
- function polyUniform(a, seed, nonce) {
145
- let off = 0;
146
- let bufLen = PolyUniformNBlocks * Stream128BlockBytes;
147
- const buf = new Uint8Array(PolyUniformNBlocks * Stream128BlockBytes + 2);
148
-
149
- const state = new KeccakState();
150
- dilithiumShake128StreamInit(state, seed, nonce);
151
- shake128SqueezeBlocks(buf, off, PolyUniformNBlocks, state);
152
-
153
- let ctr = rejUniform(a.coeffs, 0, N, buf, bufLen);
154
-
155
- while (ctr < N) {
156
- off = bufLen % 3;
157
- for (let i = 0; i < off; ++i) buf[i] = buf[bufLen - off + i];
158
-
159
- shake128SqueezeBlocks(buf, off, 1, state);
160
- bufLen = Stream128BlockBytes + off;
161
- ctr += rejUniform(a.coeffs, ctr, N - ctr, buf, bufLen);
162
- }
163
- }
164
-
165
- function rejEta(aP, aOffset, len, buf, bufLen) {
166
- let ctr;
167
- let pos;
168
- let t0;
169
- let t1;
170
- const a = aP;
171
- ctr = 0;
172
- pos = 0;
173
- while (ctr < len && pos < bufLen) {
174
- t0 = buf[pos] & 0x0f;
175
- t1 = buf[pos++] >> 4;
176
-
177
- if (t0 < 15) {
178
- t0 -= ((205 * t0) >> 10) * 5;
179
- a[aOffset + ctr++] = 2 - t0;
180
- }
181
- if (t1 < 15 && ctr < len) {
182
- t1 -= ((205 * t1) >> 10) * 5;
183
- a[aOffset + ctr++] = 2 - t1;
184
- }
185
- }
186
-
187
- return ctr;
188
- }
189
-
190
- function polyUniformEta(a, seed, nonce) {
191
- let ctr;
192
- const bufLen = PolyUniformETANBlocks * Stream256BlockBytes;
193
- const buf = new Uint8Array(bufLen);
194
-
195
- const state = new KeccakState();
196
- dilithiumShake256StreamInit(state, seed, nonce);
197
- shake256SqueezeBlocks(buf, 0, PolyUniformETANBlocks, state);
198
-
199
- ctr = rejEta(a.coeffs, 0, N, buf, bufLen);
200
- while (ctr < N) {
201
- shake256SqueezeBlocks(buf, 0, 1, state);
202
- ctr += rejEta(a.coeffs, ctr, N - ctr, buf, Stream256BlockBytes);
203
- }
204
- }
205
-
206
- function polyZUnpack(rP, a, aOffset) {
207
- const r = rP;
208
- for (let i = 0; i < N / 2; ++i) {
209
- r.coeffs[2 * i] = a[aOffset + 5 * i];
210
- r.coeffs[2 * i] |= a[aOffset + 5 * i + 1] << 8;
211
- r.coeffs[2 * i] |= a[aOffset + 5 * i + 2] << 16;
212
- r.coeffs[2 * i] &= 0xfffff;
213
-
214
- r.coeffs[2 * i + 1] = a[aOffset + 5 * i + 2] >> 4;
215
- r.coeffs[2 * i + 1] |= a[aOffset + 5 * i + 3] << 4;
216
- r.coeffs[2 * i + 1] |= a[aOffset + 5 * i + 4] << 12;
217
- r.coeffs[2 * i] &= 0xfffff;
218
-
219
- r.coeffs[2 * i] = GAMMA1 - r.coeffs[2 * i];
220
- r.coeffs[2 * i + 1] = GAMMA1 - r.coeffs[2 * i + 1];
221
- }
222
- }
223
-
224
- function polyUniformGamma1(a, seed, nonce) {
225
- const buf = new Uint8Array(PolyUniformGamma1NBlocks * Stream256BlockBytes);
226
-
227
- const state = new KeccakState();
228
- dilithiumShake256StreamInit(state, seed, nonce);
229
- shake256SqueezeBlocks(buf, 0, PolyUniformGamma1NBlocks, state);
230
- polyZUnpack(a, buf, 0);
231
- }
232
-
233
- function polyChallenge(cP, seed) {
234
- let b;
235
- let pos;
236
- const c = cP;
237
- const buf = new Uint8Array(Shake256Rate);
238
-
239
- const state = new KeccakState();
240
- shake256Init(state);
241
- shake256Absorb(state, seed.slice(0, SeedBytes));
242
- shake256Finalize(state);
243
- shake256SqueezeBlocks(buf, 0, 1, state);
244
-
245
- let signs = 0n;
246
- for (let i = 0; i < 8; ++i) {
247
- signs = BigInt.asUintN(64, signs | (BigInt(buf[i]) << BigInt(8 * i)));
248
- }
249
- pos = 8;
250
-
251
- for (let i = 0; i < N; ++i) {
252
- c.coeffs[i] = 0;
253
- }
254
- for (let i = N - TAU; i < N; ++i) {
255
- do {
256
- if (pos >= Shake256Rate) {
257
- shake256SqueezeBlocks(buf, 0, 1, state);
258
- pos = 0;
259
- }
260
-
261
- b = buf[pos++];
262
- } while (b > i);
263
-
264
- c.coeffs[i] = c.coeffs[b];
265
- c.coeffs[b] = Number(1n - 2n * (signs & 1n));
266
- signs >>= 1n;
267
- }
268
- }
269
-
270
- function polyEtaPack(rP, rOffset, a) {
271
- const t = new Uint8Array(8);
272
- const r = rP;
273
- for (let i = 0; i < N / 8; ++i) {
274
- t[0] = ETA - a.coeffs[8 * i];
275
- t[1] = ETA - a.coeffs[8 * i + 1];
276
- t[2] = ETA - a.coeffs[8 * i + 2];
277
- t[3] = ETA - a.coeffs[8 * i + 3];
278
- t[4] = ETA - a.coeffs[8 * i + 4];
279
- t[5] = ETA - a.coeffs[8 * i + 5];
280
- t[6] = ETA - a.coeffs[8 * i + 6];
281
- t[7] = ETA - a.coeffs[8 * i + 7];
282
-
283
- r[rOffset + 3 * i] = (t[0] >> 0) | (t[1] << 3) | (t[2] << 6);
284
- r[rOffset + 3 * i + 1] = (t[2] >> 2) | (t[3] << 1) | (t[4] << 4) | (t[5] << 7);
285
- r[rOffset + 3 * i + 2] = (t[5] >> 1) | (t[6] << 2) | (t[7] << 5);
286
- }
287
- }
288
-
289
- function polyEtaUnpack(rP, a, aOffset) {
290
- const r = rP;
291
- for (let i = 0; i < N / 8; ++i) {
292
- r.coeffs[8 * i] = (a[aOffset + 3 * i] >> 0) & 7;
293
- r.coeffs[8 * i + 1] = (a[aOffset + 3 * i] >> 3) & 7;
294
- r.coeffs[8 * i + 2] = ((a[aOffset + 3 * i] >> 6) | (a[aOffset + 3 * i + 1] << 2)) & 7;
295
- r.coeffs[8 * i + 3] = (a[aOffset + 3 * i + 1] >> 1) & 7;
296
- r.coeffs[8 * i + 4] = (a[aOffset + 3 * i + 1] >> 4) & 7;
297
- r.coeffs[8 * i + 5] = ((a[aOffset + 3 * i + 1] >> 7) | (a[aOffset + 3 * i + 2] << 1)) & 7;
298
- r.coeffs[8 * i + 6] = (a[aOffset + 3 * i + 2] >> 2) & 7;
299
- r.coeffs[8 * i + 7] = (a[aOffset + 3 * i + 2] >> 5) & 7;
300
-
301
- r.coeffs[8 * i] = ETA - r.coeffs[8 * i];
302
- r.coeffs[8 * i + 1] = ETA - r.coeffs[8 * i + 1];
303
- r.coeffs[8 * i + 2] = ETA - r.coeffs[8 * i + 2];
304
- r.coeffs[8 * i + 3] = ETA - r.coeffs[8 * i + 3];
305
- r.coeffs[8 * i + 4] = ETA - r.coeffs[8 * i + 4];
306
- r.coeffs[8 * i + 5] = ETA - r.coeffs[8 * i + 5];
307
- r.coeffs[8 * i + 6] = ETA - r.coeffs[8 * i + 6];
308
- r.coeffs[8 * i + 7] = ETA - r.coeffs[8 * i + 7];
309
- }
310
- }
311
-
312
- function polyT1Pack(rP, rOffset, a) {
313
- const r = rP;
314
- for (let i = 0; i < N / 4; ++i) {
315
- r[rOffset + 5 * i] = a.coeffs[4 * i] >> 0;
316
- r[rOffset + 5 * i + 1] = (a.coeffs[4 * i] >> 8) | (a.coeffs[4 * i + 1] << 2);
317
- r[rOffset + 5 * i + 2] = (a.coeffs[4 * i + 1] >> 6) | (a.coeffs[4 * i + 2] << 4);
318
- r[rOffset + 5 * i + 3] = (a.coeffs[4 * i + 2] >> 4) | (a.coeffs[4 * i + 3] << 6);
319
- r[rOffset + 5 * i + 4] = a.coeffs[4 * i + 3] >> 2;
320
- }
321
- }
322
-
323
- function polyT1Unpack(rP, a, aOffset) {
324
- const r = rP;
325
- for (let i = 0; i < N / 4; ++i) {
326
- r.coeffs[4 * i] = ((a[aOffset + 5 * i] >> 0) | (a[aOffset + 5 * i + 1] << 8)) & 0x3ff;
327
- r.coeffs[4 * i + 1] = ((a[aOffset + 5 * i + 1] >> 2) | (a[aOffset + 5 * i + 2] << 6)) & 0x3ff;
328
- r.coeffs[4 * i + 2] = ((a[aOffset + 5 * i + 2] >> 4) | (a[aOffset + 5 * i + 3] << 4)) & 0x3ff;
329
- r.coeffs[4 * i + 3] = ((a[aOffset + 5 * i + 3] >> 6) | (a[aOffset + 5 * i + 4] << 2)) & 0x3ff;
330
- }
331
- }
332
-
333
- function polyT0Pack(rP, rOffset, a) {
334
- const t = new Uint32Array(8);
335
- const r = rP;
336
- for (let i = 0; i < N / 8; ++i) {
337
- t[0] = (1 << (D - 1)) - a.coeffs[8 * i];
338
- t[1] = (1 << (D - 1)) - a.coeffs[8 * i + 1];
339
- t[2] = (1 << (D - 1)) - a.coeffs[8 * i + 2];
340
- t[3] = (1 << (D - 1)) - a.coeffs[8 * i + 3];
341
- t[4] = (1 << (D - 1)) - a.coeffs[8 * i + 4];
342
- t[5] = (1 << (D - 1)) - a.coeffs[8 * i + 5];
343
- t[6] = (1 << (D - 1)) - a.coeffs[8 * i + 6];
344
- t[7] = (1 << (D - 1)) - a.coeffs[8 * i + 7];
345
-
346
- r[rOffset + 13 * i] = t[0]; // eslint-disable-line prefer-destructuring
347
- r[rOffset + 13 * i + 1] = t[0] >> 8;
348
- r[rOffset + 13 * i + 1] |= t[1] << 5;
349
- r[rOffset + 13 * i + 2] = t[1] >> 3;
350
- r[rOffset + 13 * i + 3] = t[1] >> 11;
351
- r[rOffset + 13 * i + 3] |= t[2] << 2;
352
- r[rOffset + 13 * i + 4] = t[2] >> 6;
353
- r[rOffset + 13 * i + 4] |= t[3] << 7;
354
- r[rOffset + 13 * i + 5] = t[3] >> 1;
355
- r[rOffset + 13 * i + 6] = t[3] >> 9;
356
- r[rOffset + 13 * i + 6] |= t[4] << 4;
357
- r[rOffset + 13 * i + 7] = t[4] >> 4;
358
- r[rOffset + 13 * i + 8] = t[4] >> 12;
359
- r[rOffset + 13 * i + 8] |= t[5] << 1;
360
- r[rOffset + 13 * i + 9] = t[5] >> 7;
361
- r[rOffset + 13 * i + 9] |= t[6] << 6;
362
- r[rOffset + 13 * i + 10] = t[6] >> 2;
363
- r[rOffset + 13 * i + 11] = t[6] >> 10;
364
- r[rOffset + 13 * i + 11] |= t[7] << 3;
365
- r[rOffset + 13 * i + 12] = t[7] >> 5;
366
- }
367
- }
368
-
369
- function polyT0Unpack(rP, a, aOffset) {
370
- const r = rP;
371
- for (let i = 0; i < N / 8; ++i) {
372
- r.coeffs[8 * i] = a[aOffset + 13 * i];
373
- r.coeffs[8 * i] |= a[aOffset + 13 * i + 1] << 8;
374
- r.coeffs[8 * i] &= 0x1fff;
375
-
376
- r.coeffs[8 * i + 1] = a[aOffset + 13 * i + 1] >> 5;
377
- r.coeffs[8 * i + 1] |= a[aOffset + 13 * i + 2] << 3;
378
- r.coeffs[8 * i + 1] |= a[aOffset + 13 * i + 3] << 11;
379
- r.coeffs[8 * i + 1] &= 0x1fff;
380
-
381
- r.coeffs[8 * i + 2] = a[aOffset + 13 * i + 3] >> 2;
382
- r.coeffs[8 * i + 2] |= a[aOffset + 13 * i + 4] << 6;
383
- r.coeffs[8 * i + 2] &= 0x1fff;
384
-
385
- r.coeffs[8 * i + 3] = a[aOffset + 13 * i + 4] >> 7;
386
- r.coeffs[8 * i + 3] |= a[aOffset + 13 * i + 5] << 1;
387
- r.coeffs[8 * i + 3] |= a[aOffset + 13 * i + 6] << 9;
388
- r.coeffs[8 * i + 3] &= 0x1fff;
389
-
390
- r.coeffs[8 * i + 4] = a[aOffset + 13 * i + 6] >> 4;
391
- r.coeffs[8 * i + 4] |= a[aOffset + 13 * i + 7] << 4;
392
- r.coeffs[8 * i + 4] |= a[aOffset + 13 * i + 8] << 12;
393
- r.coeffs[8 * i + 4] &= 0x1fff;
394
-
395
- r.coeffs[8 * i + 5] = a[aOffset + 13 * i + 8] >> 1;
396
- r.coeffs[8 * i + 5] |= a[aOffset + 13 * i + 9] << 7;
397
- r.coeffs[8 * i + 5] &= 0x1fff;
398
-
399
- r.coeffs[8 * i + 6] = a[aOffset + 13 * i + 9] >> 6;
400
- r.coeffs[8 * i + 6] |= a[aOffset + 13 * i + 10] << 2;
401
- r.coeffs[8 * i + 6] |= a[aOffset + 13 * i + 11] << 10;
402
- r.coeffs[8 * i + 6] &= 0x1fff;
403
-
404
- r.coeffs[8 * i + 7] = a[aOffset + 13 * i + 11] >> 3;
405
- r.coeffs[8 * i + 7] |= a[aOffset + 13 * i + 12] << 5;
406
- r.coeffs[8 * i + 7] &= 0x1fff;
407
-
408
- r.coeffs[8 * i] = (1 << (D - 1)) - r.coeffs[8 * i];
409
- r.coeffs[8 * i + 1] = (1 << (D - 1)) - r.coeffs[8 * i + 1];
410
- r.coeffs[8 * i + 2] = (1 << (D - 1)) - r.coeffs[8 * i + 2];
411
- r.coeffs[8 * i + 3] = (1 << (D - 1)) - r.coeffs[8 * i + 3];
412
- r.coeffs[8 * i + 4] = (1 << (D - 1)) - r.coeffs[8 * i + 4];
413
- r.coeffs[8 * i + 5] = (1 << (D - 1)) - r.coeffs[8 * i + 5];
414
- r.coeffs[8 * i + 6] = (1 << (D - 1)) - r.coeffs[8 * i + 6];
415
- r.coeffs[8 * i + 7] = (1 << (D - 1)) - r.coeffs[8 * i + 7];
416
- }
417
- }
418
-
419
- function polyZPack(rP, rOffset, a) {
420
- const t = new Uint32Array(4);
421
- const r = rP;
422
- for (let i = 0; i < N / 2; ++i) {
423
- t[0] = GAMMA1 - a.coeffs[2 * i];
424
- t[1] = GAMMA1 - a.coeffs[2 * i + 1];
425
-
426
- r[rOffset + 5 * i] = t[0]; // eslint-disable-line prefer-destructuring
427
- r[rOffset + 5 * i + 1] = t[0] >> 8;
428
- r[rOffset + 5 * i + 2] = t[0] >> 16;
429
- r[rOffset + 5 * i + 2] |= t[1] << 4;
430
- r[rOffset + 5 * i + 3] = t[1] >> 4;
431
- r[rOffset + 5 * i + 4] = t[1] >> 12;
432
- }
433
- }
434
-
435
- function polyW1Pack(rP, rOffset, a) {
436
- const r = rP;
437
- for (let i = 0; i < N / 2; ++i) {
438
- r[rOffset + i] = a.coeffs[2 * i] | (a.coeffs[2 * i + 1] << 4);
439
- }
440
- }
441
-
442
- module.exports = {
443
- polyW1Pack,
444
- polyZPack,
445
- polyT0Unpack,
446
- polyT0Pack,
447
- polyT1Unpack,
448
- polyT1Pack,
449
- polyEtaPack,
450
- polyEtaUnpack,
451
- polyChallenge,
452
- polyUniformGamma1,
453
- polyZUnpack,
454
- polyUniformEta,
455
- rejEta,
456
- polyUniform,
457
- rejUniform,
458
- polyChkNorm,
459
- polyUseHint,
460
- polyMakeHint,
461
- polyDecompose,
462
- polyPower2round,
463
- polyPointWiseMontgomery,
464
- polyInvNTTToMont,
465
- polyNTT,
466
- polyShiftL,
467
- polyAdd,
468
- polySub,
469
- polyCAddQ,
470
- polyReduce,
471
- Poly,
472
- };