@li0ard/dstu 0.0.1 → 0.1.1
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/LICENSE +21 -0
- package/README.md +52 -45
- package/const.d.ts +14 -0
- package/const.js +1084 -0
- package/dstu4145/const.d.ts +59 -0
- package/dstu4145/const.js +197 -0
- package/dstu4145/ec/expand.d.ts +6 -0
- package/dstu4145/ec/expand.js +129 -0
- package/dstu4145/ec/index.d.ts +823 -0
- package/dstu4145/ec/index.js +301 -0
- package/dstu4145/ec/onb.d.ts +6 -0
- package/dstu4145/ec/onb.js +100 -0
- package/dstu4145/ec/wnaf.d.ts +4 -0
- package/dstu4145/ec/wnaf.js +63 -0
- package/dstu4145/index.d.ts +180 -0
- package/dstu4145/index.js +93 -0
- package/index.d.ts +6 -0
- package/index.js +6 -0
- package/kalyna/index.d.ts +51 -0
- package/kalyna/index.js +210 -0
- package/kupyna/index.d.ts +162 -0
- package/kupyna/index.js +233 -0
- package/kupyna/kmac.d.ts +46 -0
- package/kupyna/kmac.js +124 -0
- package/modes/cbc.d.ts +5 -0
- package/modes/cbc.js +34 -0
- package/modes/cfb.d.ts +5 -0
- package/modes/cfb.js +72 -0
- package/modes/ctr.d.ts +5 -0
- package/modes/ctr.js +24 -0
- package/modes/ecb.d.ts +4 -0
- package/modes/ecb.js +17 -0
- package/modes/gcm.d.ts +5 -0
- package/modes/gcm.js +20 -0
- package/modes/index.d.ts +7 -0
- package/modes/index.js +7 -0
- package/modes/mac.d.ts +6 -0
- package/modes/mac.js +65 -0
- package/modes/ofb.d.ts +5 -0
- package/modes/ofb.js +20 -0
- package/package.json +49 -7
- package/padding.d.ts +3 -0
- package/padding.js +22 -0
- package/strumok/index.d.ts +21 -0
- package/strumok/index.js +352 -0
- package/types.d.ts +41 -0
- package/types.js +1 -0
- package/utils.d.ts +14 -0
- package/utils.js +81 -0
package/utils.js
ADDED
|
@@ -0,0 +1,81 @@
|
|
|
1
|
+
import { bytesToHex, copyBytes, hexToBytes } from "@noble/hashes/utils.js";
|
|
2
|
+
export const xorBytes = (a, b) => {
|
|
3
|
+
const mlen = Math.min(a.length, b.length);
|
|
4
|
+
const result = new Uint8Array(mlen);
|
|
5
|
+
for (let i = 0; i < mlen; i++)
|
|
6
|
+
result[i] = a[i] ^ b[i];
|
|
7
|
+
return result;
|
|
8
|
+
};
|
|
9
|
+
export const bytesToUint64sBE = (b) => {
|
|
10
|
+
const size = Math.floor(b.length / 8);
|
|
11
|
+
const result = new BigUint64Array(size);
|
|
12
|
+
for (let i = 0; i < size; i++)
|
|
13
|
+
result[i] = bytesToNumberBE(b.subarray(i * 8, i * 8 + 8));
|
|
14
|
+
return result;
|
|
15
|
+
};
|
|
16
|
+
export const uint64sToBytesBE = (w) => {
|
|
17
|
+
const result = new Uint8Array(w.length * 8);
|
|
18
|
+
for (let i = 0; i < w.length; i++)
|
|
19
|
+
result.set(numberToBytesBE(w[i], 8), i * 8);
|
|
20
|
+
return result;
|
|
21
|
+
};
|
|
22
|
+
export const bytesToUint64sLE = (b) => {
|
|
23
|
+
const size = Math.floor(b.length / 8);
|
|
24
|
+
const result = new BigUint64Array(size);
|
|
25
|
+
for (let i = 0; i < size; i++)
|
|
26
|
+
result[i] = bytesToNumberLE(b.subarray(i * 8, i * 8 + 8));
|
|
27
|
+
return result;
|
|
28
|
+
};
|
|
29
|
+
export const uint64sToBytesLE = (w) => {
|
|
30
|
+
const result = new Uint8Array(w.length * 8);
|
|
31
|
+
for (let i = 0; i < w.length; i++)
|
|
32
|
+
result.set(numberToBytesLE(w[i], 8), i * 8);
|
|
33
|
+
return result;
|
|
34
|
+
};
|
|
35
|
+
export const hexToNumber = (hex) => {
|
|
36
|
+
if (typeof hex !== 'string')
|
|
37
|
+
throw new Error('hex string expected, got ' + typeof hex);
|
|
38
|
+
return hex === '' ? 0n : BigInt('0x' + hex);
|
|
39
|
+
};
|
|
40
|
+
export const bytesToNumberBE = (bytes) => hexToNumber(bytesToHex(bytes));
|
|
41
|
+
export const numberToBytesBE = (n, len) => {
|
|
42
|
+
let num = n.toString(16).padStart(len * 2, '0');
|
|
43
|
+
while (num.length % 2 != 0)
|
|
44
|
+
num = "0" + num;
|
|
45
|
+
return hexToBytes(num);
|
|
46
|
+
};
|
|
47
|
+
export const bytesToNumberLE = (bytes) => hexToNumber(bytesToHex(copyBytes(bytes).reverse()));
|
|
48
|
+
export const numberToBytesLE = (n, len) => numberToBytesBE(n, len).reverse();
|
|
49
|
+
export const byte = (a) => Number(a & 0xffn);
|
|
50
|
+
export const gf2mMul = (blockSize, a, b) => {
|
|
51
|
+
const temp = new Uint8Array(a);
|
|
52
|
+
const result = new Uint8Array(blockSize);
|
|
53
|
+
const reductionBytes = [[0x87], [0x25, 0x04], [0x25, 0x01]][Math.log2(blockSize) - 4];
|
|
54
|
+
for (let i = 0; i < blockSize * 8; i++) {
|
|
55
|
+
const byteIndex = Math.floor(i / 8);
|
|
56
|
+
const bitIndex = i % 8;
|
|
57
|
+
if (byteIndex < b.length && (b[byteIndex] & (1 << bitIndex)))
|
|
58
|
+
for (let j = 0; j < blockSize; j++)
|
|
59
|
+
result[j] ^= temp[j];
|
|
60
|
+
let carry = 0;
|
|
61
|
+
for (let j = 0; j < blockSize; j++) {
|
|
62
|
+
const nextCarry = (temp[j] & 0x80) ? 1 : 0;
|
|
63
|
+
temp[j] = ((temp[j] << 1) & 0xFF) | carry;
|
|
64
|
+
carry = nextCarry;
|
|
65
|
+
}
|
|
66
|
+
if (carry) {
|
|
67
|
+
for (let j = 0; j < reductionBytes.length; j++)
|
|
68
|
+
if (j < blockSize)
|
|
69
|
+
temp[j] ^= reductionBytes[j];
|
|
70
|
+
}
|
|
71
|
+
}
|
|
72
|
+
return result;
|
|
73
|
+
};
|
|
74
|
+
export const equalBytes = (a, b) => {
|
|
75
|
+
if (a.length !== b.length)
|
|
76
|
+
return false;
|
|
77
|
+
let diff = 0;
|
|
78
|
+
for (let i = 0; i < a.length; i++)
|
|
79
|
+
diff |= a[i] ^ b[i];
|
|
80
|
+
return diff === 0;
|
|
81
|
+
};
|