@li0ard/dstu 0.1.7 → 0.1.8

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/README.md CHANGED
@@ -28,10 +28,12 @@ npm i @li0ard/dstu
28
28
  - ECIES encryption schema over Twisted Edwards curves (DSTU 9041:2020)
29
29
  - DSTU 9311:2024 cipher (republished DSTU GOST 28147:2009)
30
30
  - GOST 34.311-95 hash function over DSTU 9311:2024
31
+ - Supports HMAC
31
32
 
32
33
  ## Supported cipher modes
33
34
 
34
35
  - Cipher Block Chaining mode (CBC)
36
+ - Counter with CBC-MAC (CCM) mode
35
37
  - Cipher Feedback mode (CFB)
36
38
  - Counter mode (CTR)
37
39
  - Electronic Codebook mode (ECB)
@@ -39,7 +41,7 @@ npm i @li0ard/dstu
39
41
  - Message Authentication Code mode (MAC and GMAC)
40
42
  - Output Feedback mode (OFB)
41
43
  - Key wrapping (KW)
42
- - Supports [`Dstu7624Wrap`](https://zakon.rada.gov.ua/laws/show/z0108-13)
44
+ - Supports [`Dstu7624Wrap`/`GOST28147Wrap`](https://zakon.rada.gov.ua/laws/show/z0108-13)
43
45
  - XEX Tweakable Block Ciphertext Stealing (XTS)
44
46
 
45
47
  ## Supported curves
@@ -28,6 +28,8 @@ export interface DSTUParameters extends DSTUShortParameters {
28
28
  Gx: string;
29
29
  /** Base point `Y` coordinate */
30
30
  Gy: string;
31
+ /** Curve OID's */
32
+ oids?: string[];
31
33
  }
32
34
  /** DSTU 4145-2002 163 bit curve */
33
35
  export declare const DSTU_163: DSTUParameters;
package/dstu4145/const.js CHANGED
@@ -1,3 +1,15 @@
1
+ const generateOids_pb = (index) => [
2
+ `1.2.804.2.1.1.1.1.3.1.1.2.${index}`, // DSTU 4145 with GOST 34.311-95
3
+ `1.2.804.2.1.1.1.1.3.6.1.1.2.${index}`, // DSTU 4145 with Kupyna-256
4
+ `1.2.804.2.1.1.1.1.3.6.2.1.2.${index}`, // DSTU 4145 with Kupyna-384
5
+ `1.2.804.2.1.1.1.1.3.6.3.1.2.${index}`, // DSTU 4145 with Kupyna-512
6
+ ];
7
+ const generateOids_onb = (index) => [
8
+ `1.2.804.2.1.1.1.1.3.1.2.2.${index}`, // DSTU 4145 with GOST 34.311-95
9
+ `1.2.804.2.1.1.1.1.3.6.1.2.2.${index}`, // DSTU 4145 with Kupyna-256
10
+ `1.2.804.2.1.1.1.1.3.6.2.2.2.${index}`, // DSTU 4145 with Kupyna-384
11
+ `1.2.804.2.1.1.1.1.3.6.3.2.2.${index}` // DSTU 4145 with Kupyna-512
12
+ ];
1
13
  /** DSTU 4145-2002 163 bit curve */
2
14
  export const DSTU_163 = {
3
15
  a: 1,
@@ -7,7 +19,8 @@ export const DSTU_163 = {
7
19
  Gx: "02E2F85F5DD74CE983A5C4237229DAF8A3F35823BE",
8
20
  Gy: "03826F008A8C51D7B95284D9D03FF0E00CE2CD723A",
9
21
  m: 163,
10
- ks: [7, 6, 3]
22
+ ks: [7, 6, 3],
23
+ oids: generateOids_pb("0")
11
24
  };
12
25
  /** DSTU 4145-2002 163 bit curve (for testing) */
13
26
  export const DSTU_163_TEST = {
@@ -29,7 +42,8 @@ export const DSTU_167 = {
29
42
  Gx: "7A1F6653786A68192803910A3D30B2A2018B21CD54",
30
43
  Gy: "5F49EB26781C0EC6B8909156D98ED435E45FD59918",
31
44
  m: 167,
32
- ks: [6]
45
+ ks: [6],
46
+ oids: generateOids_pb("1")
33
47
  };
34
48
  /** DSTU 4145-2002 173 bit curve */
35
49
  export const DSTU_173 = {
@@ -40,7 +54,8 @@ export const DSTU_173 = {
40
54
  Gx: "04D41A619BCC6EADF0448FA22FAD567A9181D37389CA",
41
55
  Gy: "10B51CC12849B234C75E6DD2028BF7FF5C1CE0D991A1",
42
56
  m: 173,
43
- ks: [10, 2, 1]
57
+ ks: [10, 2, 1],
58
+ oids: generateOids_pb("2")
44
59
  };
45
60
  const ONB_173 = {
46
61
  matrix: "005659AA54E60F1C270590C01035040F062A360C21319547C8881C2536348844A8858A454B743CD022420C9039670200586546551C325F18F148D1C0D38A4169BA20C00245CD97492A38ED5072E38E873E16A84C18A5E7C8064F2E20254023404E98323E521978E30151950B15EC4C30C44114895237125DD8D3A18D04294030090864A61298544FFC5831D1A14E901011B0CC68B402921741623005B0244715204A3DBC68C98426D08F385028354A33E6511610077A3CD034A64B08476B9EC87873A20F0652876A48A033E007024760E05C41154301011A2D384150F4C1468153A30ABD20A2E1C50223304C650865A28D884C74C244017480CC96490E16E1D8340294831D2414E12195640A012611D6B0B882C2C98253448E1421A4A01393192922A9E9C448120B190CAC6470230414873C3842E9D014844D162E10941848E4C78E1B3D253E1532C260C8895255F8DC4144810F050B150EEDA933850D8D2520366DE191E39324141A8AC468E262D0804751B8F8F8F30155922635A4241034E7D2195697000000000000000000000000",
@@ -57,7 +72,8 @@ export const DSTU_173_ONB = {
57
72
  Gy: "005A43D5EE1F400349CF35150C74F119A39145F0CB08",
58
73
  m: 173,
59
74
  ks: [10, 2, 1],
60
- onb: ONB_173
75
+ onb: ONB_173,
76
+ oids: generateOids_onb("0")
61
77
  };
62
78
  /** DSTU 4145-2002 173 bit curve (ONB, for testing) */
63
79
  export const DSTU_173_ONB_TEST = {
@@ -80,7 +96,8 @@ export const DSTU_179 = {
80
96
  Gx: "06BA06FE51464B2BD26DC57F48819BA9954667022C7D03",
81
97
  Gy: "025FBC363582DCEC065080CA8287AAFF09788A66DC3A9E",
82
98
  m: 179,
83
- ks: [4, 2, 1]
99
+ ks: [4, 2, 1],
100
+ oids: generateOids_pb("3")
84
101
  };
85
102
  /** DSTU 4145-2002 179 bit curve (ONB) */
86
103
  export const DSTU_179_ONB = {
@@ -96,7 +113,8 @@ export const DSTU_179_ONB = {
96
113
  matrix: "00620D1132C2500E332DEE346960A0D4274A6FD84C89248193020A0656C1F124698D8F281AF424F1D3605525523F22713975C04E82251B8CF44863E3D00B3F223E015145058E1B526C5075DA12618E0746633C5870F4410C842C314C08D861E3D288572E8EE000A4E44A86334F709C208425C90B509642309041204C94500E9820A9D3A2D5814D4CF020D8C2E211192F1DA850283549559B496DDEB849256994941E0330C1B85243500E574E58A498F3C5D1854532F63C8092820C0639557E70E88400129D1510149D000463101A1A18BC00A11427D584350444ED019341100A332A5A39C86347D311421A42FDC9E3A2D0924C3778940800201609583A6888A854C55397511B32A9292200110921355E9D2914C888094C88D0E8B01224C4053E62140D4883E5D21F43485CE1A153460B0A270FCA8079B222509644378A0418B203D6214B41FACCB0B0805184478DE454E89240930F514A0641F96265CC8C46203A283015674A01540B207D58A4258C0A3D4D5881EA5300848453153671A8C385D31D56A62630E023454D8C443C8894904504000000000000",
97
114
  root1: "61459B574DD5042A1F24458913913559A0E436E811FA0200",
98
115
  root2: "2DABB4A422BFA53E33FB9276C3E05A0E4F6F7A373CBE0600"
99
- }
116
+ },
117
+ oids: generateOids_onb("1")
100
118
  };
101
119
  /** DSTU 4145-2002 191 bit curve */
102
120
  export const DSTU_191 = {
@@ -107,7 +125,8 @@ export const DSTU_191 = {
107
125
  Gx: "714114B762F2FF4A7912A6D2AC58B9B5C2FCFE76DAEB7129",
108
126
  Gy: "29C41E568B77C617EFE5902F11DB96FA9613CD8D03DB08DA",
109
127
  m: 191,
110
- ks: [9]
128
+ ks: [9],
129
+ oids: generateOids_pb("4")
111
130
  };
112
131
  /** DSTU 4145-2002 191 bit curve (ONB) */
113
132
  export const DSTU_191_ONB = {
@@ -123,7 +142,8 @@ export const DSTU_191_ONB = {
123
142
  matrix: "007AD9AA05A4D59442374A64B0222400805E417851F921C24D854C9412C91922A00A09201776190A24058C0C3462B068E844A8060A4B6F422CF8D4C3911A3346FED4D1B380D41A2C3C50A518C4211213181564299AD4010504530CFCB89135075384311C36C5F0B2A4C78A5147D268F9D2020F8C4C1E620D88A3A3C985568274694065835313431B588531132514834A74F6B4A133A14F1D506C5A2858F461CB0B231342EDF1C387928458441039C951C394885995FA50D0E3E2539651671A815195454D185180A01489E040920C551B029D599586510C482C9420F850E0CE91462ED6A049E56947065C025E05A93562170E5633003528F380888938360E0DDA6401928F2E20121C5851C0D1165176CA4890F30456095C016C55E1E58A96852521483DF2A4E2CA004418E08C9842439709424E4EC1C171428A835563227DD1B4E80E05365A18E5F192E011121E043A75387589C6832737720D7985814A0E5A6F4AF950A2000F17450430A5E0244990985485725DD141C2D521263F66696AF3828F9D39452691B9D400CA093233A240B0F4A714A83C2092B0E8622089010407B82051E121D10E58566E09F1750B000000",
124
143
  root1: "2B54ACCD849AD972B18FA0B5162FA9DBBF3FA51AF512FE58",
125
144
  root2: "1FCF56EBC3149F0107368DC9BE706078A534C0521E141632"
126
- }
145
+ },
146
+ oids: generateOids_onb("2")
127
147
  };
128
148
  /** DSTU 4145-2002 233 bit curve */
129
149
  export const DSTU_233 = {
@@ -134,7 +154,8 @@ export const DSTU_233 = {
134
154
  Gx: "3FCDA526B6CDF83BA1118DF35B3C31761D3545F32728D003EEB25EFE96",
135
155
  Gy: "9CA8B57A934C54DEEDA9E54A7BBAD95E3B2E91C54D32BE0B9DF96D8D35",
136
156
  m: 233,
137
- ks: [9, 4, 1]
157
+ ks: [9, 4, 1],
158
+ oids: generateOids_pb("5")
138
159
  };
139
160
  /** DSTU 4145-2002 233 bit curve (ONB) */
140
161
  export const DSTU_233_ONB = {
@@ -150,7 +171,8 @@ export const DSTU_233_ONB = {
150
171
  matrix: "00CE5DB366A21824171496DD6903C44A8D52430A8139A5451828573ED04461D461128A0000CE9D30172951894A199EDDD2F304D09C0C04A6EDD165AB8C025514C6B9E16527938C1402242D32B1A1DC8B474DC668E9F6EAD7A7576A82C1F224C60D166533F6D471B6A056924A1EA6417166269725444846805805474D825F638401E396A6C7012520642960F6A6D304302CBC85CA52035C184E42724460E1E0948D6E3F82ADF1F5265518521282DCB0D320990A4131CC58A895881AAE0E18B2093876C29AA272158891618260101A6D298E718864A19A255A24FC1C19B2E3DB962F4C1AA9C074E6098C681AE4903844A48A9119049EED9246878B131D2EC60551A66917033D5DA215F85364CA08596B54795AD64BDC95293F3EC10116CB15826D8D0441B175A95985470986C1F295A554A76FA808AD58C2808E813C3B0A35F136CC94985E34DA500947A40F8D2B45E2B0F121629B875B67A405CAF382D8164784BC1C60B520D7075A210EF1E853400E153F56C01922A563D31D713640B1E126A5558823060C71C12364540B091036390805249C292C5578F1493600D385401B8A39218727C70454A2BE34C8340819A36C01AE493267AC9A06447F66C591F201498F59AC9288C015451BA545178CC10054821A344A036270B8A408521972CC52B5E08463D4031C0F2240107543D38A3A5E742969B62A161947695A2DE9C2638E11687C64604036091B0A74D80000000000",
151
172
  root1: "ABBFC55B841C74F461EC5DC0D81A2013C2A69BF19F97AAB01B70D2498F010000",
152
173
  root2: "214C08346A28283EB5F281C5D8604E518202C240A9121EFA89FD28E6CD000000"
153
- }
174
+ },
175
+ oids: generateOids_onb("3")
154
176
  };
155
177
  /** DSTU 4145-2002 257 bit curve */
156
178
  export const DSTU_257 = {
@@ -161,7 +183,8 @@ export const DSTU_257 = {
161
183
  Gx: "002A29EF207D0E9B6C55CD260B306C7E007AC491CA1B10C62334A9E8DCD8D20FB7",
162
184
  Gy: "010686D41FF744D4449FCCF6D8EEA03102E6812C93A9D60B978B702CF156D814EF",
163
185
  m: 257,
164
- ks: [12]
186
+ ks: [12],
187
+ oids: generateOids_pb("6")
165
188
  };
166
189
  /** DSTU 4145-2002 307 bit curve */
167
190
  export const DSTU_307 = {
@@ -172,7 +195,8 @@ export const DSTU_307 = {
172
195
  Gx: "0216EE8B189D291A0224984C1E92F1D16BF75CCD825A087A239B276D3167743C52C02D6E7232AA",
173
196
  Gy: "05D9306BACD22B7FAEB09D2E049C6E2866C5D1677762A8F2F2DC9A11C7F7BE8340AB2237C7F2A0",
174
197
  m: 307,
175
- ks: [8, 4, 2]
198
+ ks: [8, 4, 2],
199
+ oids: generateOids_pb("7")
176
200
  };
177
201
  /** DSTU 4145-2002 367 bit curve */
178
202
  export const DSTU_367 = {
@@ -183,7 +207,8 @@ export const DSTU_367 = {
183
207
  Gx: "324A6EDDD512F08C49A99AE0D3F961197A76413E7BE81A400CA681E09639B5FE12E59A109F78BF4A373541B3B9A1",
184
208
  Gy: "01AB597A5B4477F59E39539007C7F977D1A567B92B043A49C6B61984C3FE3481AAF454CD41BA1F051626442B3C10",
185
209
  m: 367,
186
- ks: [21]
210
+ ks: [21],
211
+ oids: generateOids_pb("8")
187
212
  };
188
213
  /** DSTU 4145-2002 431 bit curve */
189
214
  export const DSTU_431 = {
@@ -194,7 +219,8 @@ export const DSTU_431 = {
194
219
  Gx: "1A62BA79D98133A16BBAE7ED9A8E03C32E0824D57AEF72F88986874E5AAE49C27BED49A2A95058068426C2171E99FD3B43C5947C857D",
195
220
  Gy: "70B5E1E14031C1F70BBEFE96BDDE66F451754B4CA5F48DA241F331AA396B8D1839A855C1769B1EA14BA53308B5E2723724E090E02DB9",
196
221
  m: 431,
197
- ks: [5, 3, 1]
222
+ ks: [5, 3, 1],
223
+ oids: generateOids_pb("9")
198
224
  };
199
225
  /** DSTU 4145-2002 431 bit curve (ONB) */
200
226
  export const DSTU_431_ONB = {
@@ -210,5 +236,6 @@ export const DSTU_431_ONB = {
210
236
  matrix: "005A33F2B708E339C564D9394018655904A0396A7ED9F747AD3CAD0D0157E91648F310BD37721DAA8CA25EB7CF7B8568E8E94AA7995CA638DB9374C22FA5AF9F8E9122F422E1847503CE32081AE69C32D50FC61A2101420D0BB657E7D61AD9255B1C8F3DB4AE0CED8DCA89C9602D4DAA474EF306CFBA72DA1048462833B3500C2A60CBAFB09799B4588223DA51D38E77340CAA314CD7EABED15BE3F1E038A0B150BB0B303E51DD2E71084145A820F17B4932B28A9E4ADAB2AA476D0FD18155325CCAC2B0ADB55CF5E5B9D6074B8568C38A5930C98762B5A29CBEA5506908EBAD4E2B26A299760026906AAA9C8283BB89A3C0BB67192F330D26110E2108309F89D80A96ABCBBAF296615323531222394A03DAE6456EB859A9A665396A6DCF0F9273686D89EB31F0B7AC4C17161AE5A1580CA815BBEE71598BB01C905C40CA111932CE16C12CE1F2403B34A0807462FC2D585DD69C136431BC9A7CDA292935546778C66265E717067905445BC9DA22E50742221EB3432DE11D94BA6DD32440A462930DBC43378E7114201D23D6191529A0FB85F4DAAA7E7AE179E6C614A8CA9336F31DC7EDD79FD10ED312D821C1EDC12733C88A489DD07103470234FE5B1466F5E28BC92C35E1CB811EB06D7566AA8A5BB4E94AC028406FA60788A6383A5D06FBC803876A16987C9E1A9D980A694C2C06A45E10D60B5FA8364B2091B91BE574D0C510CC5DFA6A31328C61A3A29E845141AA3168A278711867E7E13C3F17F2410B7607D606BD3A3B5B2E6568A9A7AE570B9394DB52A616546F22DED9B9AB9506CC3B79BE8298A10E10A3E164529328CB8D19CBF7707D8A5C08A531611D9E31B947497229AFB7945274AA82E8C0B7356EEA4002016CB2BEE52431990CAAAF3DCA9596986826654C0380EA020068FD8F35BA7E607E262078A3730AA6B8529282ACD04508B1554013A9C98DF43C7DBEA85A806AED6549AE3EAA62CBF786572C88C0C4ADD2F6C325979121077FC4A645161E7CA79C95C1A9840689C36D0BAE488AA0A7C4CBA772B6C1DB2CE0238D0C18A303AAA834BFB934096B1339A7E5C75970625E9B2A8D4281862E420BFA1BF68809480E5033B37BB0ACBB8B32CA750855C9592436256E16098B69CA83C425C426B119E8338ECC3E331C38BAEA259D6C7A046F4DDBF12DBC4C114CDBFC39C433A2BC03716A72BBC6DD08271E4E5A3C460C328541561882388C55691A829C9A1EE2EC8DF2DF4853941841BC66C60785EDC60E42DC62E1089432443521176CEFAECCAF58057968209AAFA87DA612BBF2E2310184F04EEB508649F191D452D63D6A2CC66CC6BAFD0A26F28906691069181C5E8937C131DA8DEA003672DD0800000000000000",
211
237
  root1: "595A5822496675B56C7EAE7E537D60F655C784A9B84DDEADE42431B1C324AE818AC7DCBC0E7370E69A16C3268FF66E2F332DD2A013450000",
212
238
  root2: "27FA953C557581AD37A991EB2FB46B7C65DBE2B2CA021FEFAD6AD3EAFB73C14E1A528B8E5C778705B9DFEA18D6F76D125175130A020A0000"
213
- }
239
+ },
240
+ oids: generateOids_onb("4")
214
241
  };
@@ -1,6 +1,7 @@
1
1
  import type { DSTUShortParameters } from "../const.js";
2
+ import type { TArg, TRet } from "@noble/hashes/utils.js";
2
3
  /** Uncompress point without creating full API curve */
3
- export declare const expandPoint: (xBytes: Uint8Array, params: DSTUShortParameters) => {
4
- x: Uint8Array;
5
- y: Uint8Array;
4
+ export declare const expandPoint: (xBytes: TArg<Uint8Array>, params: DSTUShortParameters) => {
5
+ x: TRet<Uint8Array>;
6
+ y: TRet<Uint8Array>;
6
7
  };
@@ -1,5 +1,4 @@
1
- import { init_onb_parameters } from "./onb.js";
2
- import { createField } from "./math.js";
1
+ import { createField, init_onb_parameters } from "../gf2m/index.js";
3
2
  /** Uncompress point without creating full API curve */
4
3
  export const expandPoint = (xBytes, params) => {
5
4
  const { m, ks, a, onb } = params;
@@ -1,8 +1,7 @@
1
1
  import { concatBytes } from "@noble/hashes/utils.js";
2
2
  import BN from "bn.js";
3
3
  import { bitLength, getWindowSize, windowNaf } from "./wnaf.js";
4
- import { init_onb_parameters } from "./onb.js";
5
- import { createField } from "./math.js";
4
+ import { createField, init_onb_parameters } from "../gf2m/index.js";
6
5
  export const binaryWeierstrass = (parameters) => {
7
6
  const field = createField(parameters.m, parameters.ks);
8
7
  const onb = parameters.onb ? init_onb_parameters(parameters) : undefined;
@@ -20,3 +20,4 @@ export declare const createField: (m: number, ks: number[]) => Readonly<{
20
20
  fromHexStringOrBytes: (v: string | Uint8Array) => BN;
21
21
  toBytes: (x: BN, length?: number) => TRet<Uint8Array>;
22
22
  }>;
23
+ export * from "./onb.js";
@@ -0,0 +1,87 @@
1
+ import BN from "bn.js";
2
+ import { be2LEw, bn2LE, invWords, le2BN, modWords, mulWords, SQR_PRECOMP, WORD_BITS } from "./utils.js";
3
+ /** Compute curve modulo */
4
+ export const computeMod = (m, ks) => {
5
+ const modulo = new BN(0);
6
+ modulo.setn(m, 1);
7
+ modulo.setn(0, 1);
8
+ for (const i of ks)
9
+ modulo.setn(i, 1);
10
+ return modulo;
11
+ };
12
+ /** Create `GF(2^m)` field */
13
+ export const createField = (m, ks) => {
14
+ const modulo = computeMod(m, ks), wordsPerElement = Math.ceil(m / WORD_BITS), wordsForModWord = Math.floor(m / WORD_BITS) + 1;
15
+ const polyBits = Int32Array.from([m, ...[...ks].sort((a, b) => b - a), 0]), polyWordsForInv = bn2LE(modulo, wordsForModWord);
16
+ const modw = (a) => le2BN(modWords(a, polyBits).subarray(0, wordsPerElement));
17
+ const mod = (f) => {
18
+ const bl = f.bitLength();
19
+ if (bl <= m)
20
+ return f.clone();
21
+ return modw(bn2LE(f, Math.ceil(bl / WORD_BITS)));
22
+ };
23
+ const mul = (x, v) => x.eq(v)
24
+ ? sqr(x)
25
+ : modw(mulWords(bn2LE(x), bn2LE(v)));
26
+ const div = (x, v) => mul(x, invert(v));
27
+ const sqr = (x) => {
28
+ const bytes = x.toArray();
29
+ const out = new Uint8Array(bytes.length * 2);
30
+ for (let i = 0; i < bytes.length; i++) {
31
+ const v = SQR_PRECOMP[bytes[i]];
32
+ out[2 * i] = (v >> 8) & 0xff;
33
+ out[2 * i + 1] = v & 0xff;
34
+ }
35
+ return modw(be2LEw(out));
36
+ };
37
+ const testBit = (x, i) => x.testn(i) ? 1 : 0;
38
+ const invBit = (x, i) => x.setn(i, !x.testn(i));
39
+ const sqrt = (x) => {
40
+ let r = mod(x);
41
+ for (let i = 0; i < m - 1; i++)
42
+ r = sqr(r);
43
+ return r;
44
+ };
45
+ const trace = (x) => {
46
+ let t = x;
47
+ for (let i = 1; i < m; i++)
48
+ t = sqr(t).ixor(x);
49
+ return testBit(t, 0);
50
+ };
51
+ const traceOnb = (x) => {
52
+ let t = 0;
53
+ for (let i = 0; i < m; i++)
54
+ t ^= testBit(x, i);
55
+ return t;
56
+ };
57
+ const htrace = (x) => {
58
+ let ht = x;
59
+ for (let i = 1; i <= Math.floor((m - 1) / 2); i++)
60
+ ht = sqr(sqr(ht)).ixor(x);
61
+ return ht;
62
+ };
63
+ const invert = (f) => {
64
+ const reducedWords = modWords(bn2LE(f), polyBits), words = new Uint32Array(wordsForModWord);
65
+ words.set(reducedWords.subarray(0, Math.min(reducedWords.length, wordsForModWord)));
66
+ return le2BN(invWords(words, polyWordsForInv).subarray(0, wordsPerElement));
67
+ };
68
+ const solve_quad = (v) => {
69
+ const a = mod(v), z = htrace(a);
70
+ if (sqr(z).ixor(z).cmp(a) == 0)
71
+ return mod(z);
72
+ throw new Error("squad eq fail: no square root exists");
73
+ };
74
+ const hashToField = (hash) => {
75
+ const h = new BN(hash);
76
+ return h.imaskn(Math.min(m, h.bitLength()));
77
+ };
78
+ const fromHexStringOrBytes = (v) => new BN(v, 16);
79
+ const toBytes = (x, length) => new Uint8Array(x.toArray("be", length));
80
+ return Object.freeze({
81
+ MODULO: modulo, LENGTH: Math.ceil(m / 8),
82
+ mod, mul, div, sqr, sqrt, invert,
83
+ solve_quad, trace, traceOnb, hashToField, invBit,
84
+ fromHexStringOrBytes, toBytes
85
+ });
86
+ };
87
+ export * from "./onb.js";
@@ -1,6 +1,6 @@
1
1
  import BN from "bn.js";
2
2
  import { hexToBytes } from "@noble/hashes/utils.js";
3
- import { createField } from "./math.js";
3
+ import { createField } from "./index.js";
4
4
  const decompress_matrix = (compress_mulp, mulp) => {
5
5
  const mlen = Math.ceil(compress_mulp.bitLength() / 9);
6
6
  if (mlen === 0)
@@ -0,0 +1,10 @@
1
+ import type { TArg, TRet } from "@noble/hashes/utils.js";
2
+ import BN from "bn.js";
3
+ export declare const SQR_PRECOMP: Uint16Array<ArrayBuffer>;
4
+ export declare const WORD_BITS = 32;
5
+ export declare const bn2LE: (x: BN, numWords?: number) => TRet<Uint32Array>;
6
+ export declare const le2BN: (arr: TArg<Uint32Array>) => BN;
7
+ export declare const be2LEw: (bytes: TArg<Uint8Array>) => TRet<Uint32Array>;
8
+ export declare const mulWords: (a: TArg<Uint32Array>, b: TArg<Uint32Array>) => TRet<Uint32Array>;
9
+ export declare const modWords: (a: TArg<Uint32Array>, poly: TArg<Int32Array>) => TRet<Uint32Array>;
10
+ export declare const invWords: (a: TArg<Uint32Array>, poly: TArg<Uint32Array>) => TRet<Uint32Array>;
@@ -0,0 +1,258 @@
1
+ import BN from "bn.js";
2
+ export const SQR_PRECOMP = new Uint16Array([
3
+ 0x0000, 0x0001, 0x0004, 0x0005, 0x0010, 0x0011, 0x0014, 0x0015,
4
+ 0x0040, 0x0041, 0x0044, 0x0045, 0x0050, 0x0051, 0x0054, 0x0055,
5
+ 0x0100, 0x0101, 0x0104, 0x0105, 0x0110, 0x0111, 0x0114, 0x0115,
6
+ 0x0140, 0x0141, 0x0144, 0x0145, 0x0150, 0x0151, 0x0154, 0x0155,
7
+ 0x0400, 0x0401, 0x0404, 0x0405, 0x0410, 0x0411, 0x0414, 0x0415,
8
+ 0x0440, 0x0441, 0x0444, 0x0445, 0x0450, 0x0451, 0x0454, 0x0455,
9
+ 0x0500, 0x0501, 0x0504, 0x0505, 0x0510, 0x0511, 0x0514, 0x0515,
10
+ 0x0540, 0x0541, 0x0544, 0x0545, 0x0550, 0x0551, 0x0554, 0x0555,
11
+ 0x1000, 0x1001, 0x1004, 0x1005, 0x1010, 0x1011, 0x1014, 0x1015,
12
+ 0x1040, 0x1041, 0x1044, 0x1045, 0x1050, 0x1051, 0x1054, 0x1055,
13
+ 0x1100, 0x1101, 0x1104, 0x1105, 0x1110, 0x1111, 0x1114, 0x1115,
14
+ 0x1140, 0x1141, 0x1144, 0x1145, 0x1150, 0x1151, 0x1154, 0x1155,
15
+ 0x1400, 0x1401, 0x1404, 0x1405, 0x1410, 0x1411, 0x1414, 0x1415,
16
+ 0x1440, 0x1441, 0x1444, 0x1445, 0x1450, 0x1451, 0x1454, 0x1455,
17
+ 0x1500, 0x1501, 0x1504, 0x1505, 0x1510, 0x1511, 0x1514, 0x1515,
18
+ 0x1540, 0x1541, 0x1544, 0x1545, 0x1550, 0x1551, 0x1554, 0x1555,
19
+ 0x4000, 0x4001, 0x4004, 0x4005, 0x4010, 0x4011, 0x4014, 0x4015,
20
+ 0x4040, 0x4041, 0x4044, 0x4045, 0x4050, 0x4051, 0x4054, 0x4055,
21
+ 0x4100, 0x4101, 0x4104, 0x4105, 0x4110, 0x4111, 0x4114, 0x4115,
22
+ 0x4140, 0x4141, 0x4144, 0x4145, 0x4150, 0x4151, 0x4154, 0x4155,
23
+ 0x4400, 0x4401, 0x4404, 0x4405, 0x4410, 0x4411, 0x4414, 0x4415,
24
+ 0x4440, 0x4441, 0x4444, 0x4445, 0x4450, 0x4451, 0x4454, 0x4455,
25
+ 0x4500, 0x4501, 0x4504, 0x4505, 0x4510, 0x4511, 0x4514, 0x4515,
26
+ 0x4540, 0x4541, 0x4544, 0x4545, 0x4550, 0x4551, 0x4554, 0x4555,
27
+ 0x5000, 0x5001, 0x5004, 0x5005, 0x5010, 0x5011, 0x5014, 0x5015,
28
+ 0x5040, 0x5041, 0x5044, 0x5045, 0x5050, 0x5051, 0x5054, 0x5055,
29
+ 0x5100, 0x5101, 0x5104, 0x5105, 0x5110, 0x5111, 0x5114, 0x5115,
30
+ 0x5140, 0x5141, 0x5144, 0x5145, 0x5150, 0x5151, 0x5154, 0x5155,
31
+ 0x5400, 0x5401, 0x5404, 0x5405, 0x5410, 0x5411, 0x5414, 0x5415,
32
+ 0x5440, 0x5441, 0x5444, 0x5445, 0x5450, 0x5451, 0x5454, 0x5455,
33
+ 0x5500, 0x5501, 0x5504, 0x5505, 0x5510, 0x5511, 0x5514, 0x5515,
34
+ 0x5540, 0x5541, 0x5544, 0x5545, 0x5550, 0x5551, 0x5554, 0x5555
35
+ ]);
36
+ export const WORD_BITS = 32;
37
+ const numWordsFor = (x) => Math.max(1, Math.ceil(Math.max(x.bitLength(), 1) / WORD_BITS));
38
+ export const bn2LE = (x, numWords = numWordsFor(x)) => {
39
+ const arr = new Uint32Array(numWords);
40
+ const bytes = x.toArray("le");
41
+ for (let i = 0; i < bytes.length; i++)
42
+ arr[i >> 2] |= bytes[i] << ((i & 3) * 8);
43
+ return arr;
44
+ };
45
+ export const le2BN = (arr) => {
46
+ const bytes = new Uint8Array(arr.length * 4);
47
+ for (let i = 0; i < arr.length; i++) {
48
+ const w = arr[i];
49
+ bytes[i * 4] = w & 0xff;
50
+ bytes[i * 4 + 1] = (w >>> 8) & 0xff;
51
+ bytes[i * 4 + 2] = (w >>> 16) & 0xff;
52
+ bytes[i * 4 + 3] = (w >>> 24) & 0xff;
53
+ }
54
+ return new BN(bytes, "le");
55
+ };
56
+ export const be2LEw = (bytes) => {
57
+ const n = bytes.length, arr = new Uint32Array(Math.max(1, Math.ceil(n / 4)));
58
+ for (let i = 0; i < n; i++) {
59
+ const b = bytes[n - 1 - i];
60
+ arr[i >> 2] |= b << ((i & 3) * 8);
61
+ }
62
+ return arr;
63
+ };
64
+ const wBitLen = (words) => {
65
+ let nz = words.length - 1;
66
+ while (nz >= 0 && words[nz] === 0)
67
+ nz--;
68
+ if (nz < 0)
69
+ return 0;
70
+ let x = words[nz], r = 1, t;
71
+ if ((t = x >>> 16) !== 0) {
72
+ x = t;
73
+ r += 16;
74
+ }
75
+ if ((t = x >> 8) !== 0) {
76
+ x = t;
77
+ r += 8;
78
+ }
79
+ if ((t = x >> 4) !== 0) {
80
+ x = t;
81
+ r += 4;
82
+ }
83
+ if ((t = x >> 2) !== 0) {
84
+ x = t;
85
+ r += 2;
86
+ }
87
+ if ((t = x >> 1) !== 0) {
88
+ x = t;
89
+ r += 1;
90
+ }
91
+ return r + nz * WORD_BITS;
92
+ };
93
+ const mul_1x1 = (offset, a, b, dst) => {
94
+ const a1 = a & 0x3fffffff, a2 = a1 << 1, a4 = a2 << 1, tab = [0, a1, a2, a1 ^ a2, a4, a1 ^ a4, a2 ^ a4, a1 ^ a2 ^ a4];
95
+ let s = tab[b & 0x7], l = s;
96
+ s = tab[(b >>> 3) & 0x7];
97
+ l ^= s << 3;
98
+ let h = s >>> 29;
99
+ s = tab[(b >>> 6) & 0x7];
100
+ l ^= s << 6;
101
+ h ^= s >>> 26;
102
+ s = tab[(b >>> 9) & 0x7];
103
+ l ^= s << 9;
104
+ h ^= s >>> 23;
105
+ s = tab[(b >>> 12) & 0x7];
106
+ l ^= s << 12;
107
+ h ^= s >>> 20;
108
+ s = tab[(b >>> 15) & 0x7];
109
+ l ^= s << 15;
110
+ h ^= s >>> 17;
111
+ s = tab[(b >>> 18) & 0x7];
112
+ l ^= s << 18;
113
+ h ^= s >>> 14;
114
+ s = tab[(b >>> 21) & 0x7];
115
+ l ^= s << 21;
116
+ h ^= s >>> 11;
117
+ s = tab[(b >>> 24) & 0x7];
118
+ l ^= s << 24;
119
+ h ^= s >>> 8;
120
+ s = tab[(b >>> 27) & 0x7];
121
+ l ^= s << 27;
122
+ h ^= s >>> 5;
123
+ s = tab[b >>> 30];
124
+ l ^= s << 30;
125
+ h ^= s >>> 2;
126
+ const t2b = a >>> 30;
127
+ if (t2b & 1) {
128
+ l ^= b << 30;
129
+ h ^= b >>> 2;
130
+ }
131
+ if (t2b & 2) {
132
+ l ^= b << 31;
133
+ h ^= b >>> 1;
134
+ }
135
+ dst[offset + 1] = h;
136
+ dst[offset] = l;
137
+ };
138
+ const mul_2x2 = (a1, a0, b1, b0, dst) => {
139
+ mul_1x1(2, a1, b1, dst);
140
+ mul_1x1(0, a0, b0, dst);
141
+ mul_1x1(4, a0 ^ a1, b0 ^ b1, dst);
142
+ dst[2] ^= dst[5] ^ dst[1] ^ dst[3];
143
+ dst[1] = dst[3] ^ dst[2] ^ dst[0] ^ dst[4] ^ dst[5];
144
+ dst[4] = 0;
145
+ dst[5] = 0;
146
+ };
147
+ export const mulWords = (a, b) => {
148
+ const out = new Uint32Array(a.length + b.length), x22 = new Uint32Array(6);
149
+ for (let j = 0; j < b.length; j += 2) {
150
+ const y0 = b[j], y1 = j + 1 === b.length ? 0 : b[j + 1];
151
+ if (y0 === 0 && y1 === 0)
152
+ continue;
153
+ for (let i = 0; i < a.length; i += 2) {
154
+ const x0 = a[i], x1 = i + 1 === a.length ? 0 : a[i + 1];
155
+ if (x0 === 0 && x1 === 0)
156
+ continue;
157
+ mul_2x2(x1, x0, y1, y0, x22);
158
+ out[j + i] ^= x22[0];
159
+ out[j + i + 1] ^= x22[1];
160
+ out[j + i + 2] ^= x22[2];
161
+ out[j + i + 3] ^= x22[3];
162
+ }
163
+ }
164
+ return out;
165
+ };
166
+ export const modWords = (a, poly) => {
167
+ const dN = Math.floor(poly[0] / WORD_BITS), len = Math.max(a.length, dN + 1), res = new Uint32Array(len);
168
+ res.set(a);
169
+ let j = len - 1;
170
+ while (j > dN) {
171
+ const zz = res[j];
172
+ if (zz === 0) {
173
+ j--;
174
+ continue;
175
+ }
176
+ res[j] = 0;
177
+ for (let k = 1; poly[k]; k++) {
178
+ let n = poly[0] - poly[k];
179
+ const d0 = n % WORD_BITS;
180
+ n = Math.floor(n / WORD_BITS);
181
+ res[j - n] ^= zz >>> d0;
182
+ if (d0)
183
+ res[j - n - 1] ^= zz << (WORD_BITS - d0);
184
+ }
185
+ const d0m = poly[0] % WORD_BITS;
186
+ res[j - dN] ^= zz >>> d0m;
187
+ if (d0m)
188
+ res[j - dN - 1] ^= zz << (WORD_BITS - d0m);
189
+ }
190
+ while (j === dN) {
191
+ const d0 = poly[0] % WORD_BITS, zz = res[dN] >>> d0;
192
+ if (zz === 0)
193
+ break;
194
+ const d1 = WORD_BITS - d0;
195
+ res[dN] = d0 ? (res[dN] << d1) >>> d1 : 0;
196
+ res[0] ^= zz;
197
+ for (let k = 1; poly[k]; k++) {
198
+ const n = Math.floor(poly[k] / WORD_BITS), dd0 = poly[k] % WORD_BITS, dd1 = WORD_BITS - dd0;
199
+ res[n] ^= zz << dd0;
200
+ const carry = zz >>> dd1;
201
+ if (dd0 && carry)
202
+ res[n + 1] ^= carry;
203
+ }
204
+ }
205
+ return res;
206
+ };
207
+ export const invWords = (a, poly) => {
208
+ const len = a.length;
209
+ let uu = new Uint32Array(len), vv = new Uint32Array(len), bb = new Uint32Array(len), cc = new Uint32Array(len);
210
+ bb[0] = 1;
211
+ uu.set(a);
212
+ vv.set(poly);
213
+ let ubits = wBitLen(uu), vbits = wBitLen(vv);
214
+ if (ubits === 0)
215
+ throw new Error("Element is 0, there's no inverse");
216
+ let iter = 100000;
217
+ while (true) {
218
+ if (--iter <= 0)
219
+ throw new Error("Failed to converge");
220
+ while (ubits && !(uu[0] & 1)) {
221
+ let u0 = uu[0], b0 = bb[0];
222
+ const mask = (b0 & 1) ? 0xffffffff : 0;
223
+ b0 ^= poly[0] & mask;
224
+ let idx = 0;
225
+ for (; idx < len - 1; idx++) {
226
+ const u1 = uu[idx + 1];
227
+ uu[idx] = (u0 >>> 1) | (u1 << 31);
228
+ u0 = u1;
229
+ const b1 = bb[idx + 1] ^ (poly[idx + 1] & mask);
230
+ bb[idx] = (b0 >>> 1) | (b1 << 31);
231
+ b0 = b1;
232
+ }
233
+ uu[idx] = u0 >>> 1;
234
+ bb[idx] = b0 >>> 1;
235
+ ubits--;
236
+ }
237
+ if (ubits <= 32 && uu[0] === 1)
238
+ break;
239
+ if (ubits < vbits) {
240
+ let t = ubits;
241
+ ubits = vbits;
242
+ vbits = t;
243
+ let tw = uu;
244
+ uu = vv;
245
+ vv = tw;
246
+ tw = bb;
247
+ bb = cc;
248
+ cc = tw;
249
+ }
250
+ for (let idx = 0; idx < len; idx++) {
251
+ uu[idx] ^= vv[idx];
252
+ bb[idx] ^= cc[idx];
253
+ }
254
+ if (ubits === vbits)
255
+ ubits = wBitLen(uu);
256
+ }
257
+ return bb;
258
+ };
@@ -17,6 +17,27 @@ export declare const dstu4145: (parameters: DSTUParameters) => Readonly<{
17
17
  signatureByteLength: number;
18
18
  }>;
19
19
  }>;
20
+ /**
21
+ * Create DSTU 4145-2002 signer (Little-Endian)
22
+ *
23
+ * **NOTE:** Parameters MUST be in Big-Endian
24
+ */
25
+ export declare const dstu4145_le: (parameters: DSTUParameters) => Readonly<{
26
+ getPublicKey: (secretKey: TArg<Uint8Array>, isCompressed?: boolean) => TRet<Uint8Array>;
27
+ getSharedSecret: (secretKeyA: TArg<Uint8Array>, publicKeyB: TArg<Uint8Array>, withCofactor?: boolean) => TRet<Uint8Array>;
28
+ sign: (secretKey: TArg<Uint8Array>, digest: TArg<Uint8Array>, rand?: TArg<Uint8Array>) => TRet<Uint8Array>;
29
+ verify: (publicKey: TArg<Uint8Array>, digest: TArg<Uint8Array>, signature: TArg<Uint8Array>) => boolean;
30
+ keygen: (isCompressed?: boolean) => {
31
+ secretKey: TRet<Uint8Array>;
32
+ publicKey: TRet<Uint8Array>;
33
+ };
34
+ lengths: Readonly<{
35
+ fieldByteLength: number;
36
+ pointByteLength: number;
37
+ scalarByteLength: number;
38
+ signatureByteLength: number;
39
+ }>;
40
+ }>;
20
41
  export * from "./const.js";
21
42
  export * from "./ec/expand.js";
22
43
  /** DSTU 4145-2002 163 bit curve */
@@ -138,6 +159,23 @@ export declare const dstu257: Readonly<{
138
159
  signatureByteLength: number;
139
160
  }>;
140
161
  }>;
162
+ /** DSTU 4145-2002 257 bit curve (LE) */
163
+ export declare const dstu257_le: Readonly<{
164
+ getPublicKey: (secretKey: TArg<Uint8Array>, isCompressed?: boolean) => TRet<Uint8Array>;
165
+ getSharedSecret: (secretKeyA: TArg<Uint8Array>, publicKeyB: TArg<Uint8Array>, withCofactor?: boolean) => TRet<Uint8Array>;
166
+ sign: (secretKey: TArg<Uint8Array>, digest: TArg<Uint8Array>, rand?: TArg<Uint8Array>) => TRet<Uint8Array>;
167
+ verify: (publicKey: TArg<Uint8Array>, digest: TArg<Uint8Array>, signature: TArg<Uint8Array>) => boolean;
168
+ keygen: (isCompressed?: boolean) => {
169
+ secretKey: TRet<Uint8Array>;
170
+ publicKey: TRet<Uint8Array>;
171
+ };
172
+ lengths: Readonly<{
173
+ fieldByteLength: number;
174
+ pointByteLength: number;
175
+ scalarByteLength: number;
176
+ signatureByteLength: number;
177
+ }>;
178
+ }>;
141
179
  /** DSTU 4145-2002 307 bit curve */
142
180
  export declare const dstu307: Readonly<{
143
181
  getPublicKey: (secretKey: TArg<Uint8Array>, isCompressed?: boolean) => TRet<Uint8Array>;
@@ -189,3 +227,20 @@ export declare const dstu431: Readonly<{
189
227
  signatureByteLength: number;
190
228
  }>;
191
229
  }>;
230
+ /** DSTU 4145-2002 431 bit curve (LE) */
231
+ export declare const dstu431_le: Readonly<{
232
+ getPublicKey: (secretKey: TArg<Uint8Array>, isCompressed?: boolean) => TRet<Uint8Array>;
233
+ getSharedSecret: (secretKeyA: TArg<Uint8Array>, publicKeyB: TArg<Uint8Array>, withCofactor?: boolean) => TRet<Uint8Array>;
234
+ sign: (secretKey: TArg<Uint8Array>, digest: TArg<Uint8Array>, rand?: TArg<Uint8Array>) => TRet<Uint8Array>;
235
+ verify: (publicKey: TArg<Uint8Array>, digest: TArg<Uint8Array>, signature: TArg<Uint8Array>) => boolean;
236
+ keygen: (isCompressed?: boolean) => {
237
+ secretKey: TRet<Uint8Array>;
238
+ publicKey: TRet<Uint8Array>;
239
+ };
240
+ lengths: Readonly<{
241
+ fieldByteLength: number;
242
+ pointByteLength: number;
243
+ scalarByteLength: number;
244
+ signatureByteLength: number;
245
+ }>;
246
+ }>;