Nat.cs 40 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900901902903904905906907908909910911912913914915916917918919920921922923924925926927928929930931932933934935936937938939940941942943944945946947948949950951952953954955956957958959960961962963964965966967968969970971972973974975976977978979980981982983984985986987988989990991992993994995996997998999100010011002100310041005100610071008100910101011101210131014101510161017101810191020102110221023102410251026102710281029103010311032103310341035103610371038103910401041104210431044104510461047104810491050105110521053105410551056105710581059106010611062106310641065106610671068106910701071107210731074107510761077107810791080108110821083108410851086108710881089109010911092109310941095109610971098109911001101110211031104110511061107110811091110111111121113111411151116111711181119112011211122112311241125112611271128112911301131113211331134113511361137113811391140114111421143114411451146114711481149115011511152115311541155115611571158115911601161116211631164116511661167116811691170117111721173117411751176117711781179118011811182118311841185118611871188118911901191119211931194119511961197119811991200120112021203120412051206120712081209121012111212121312141215121612171218121912201221122212231224122512261227122812291230123112321233123412351236123712381239124012411242124312441245124612471248124912501251125212531254125512561257125812591260126112621263126412651266126712681269127012711272127312741275127612771278127912801281128212831284128512861287128812891290129112921293129412951296129712981299130013011302130313041305130613071308130913101311131213131314131513161317131813191320132113221323132413251326132713281329133013311332133313341335133613371338133913401341134213431344134513461347134813491350135113521353135413551356135713581359136013611362136313641365136613671368136913701371137213731374137513761377137813791380138113821383138413851386138713881389139013911392139313941395139613971398139914001401140214031404140514061407140814091410141114121413141414151416141714181419142014211422
  1. #if !BESTHTTP_DISABLE_ALTERNATE_SSL && (!UNITY_WEBGL || UNITY_EDITOR)
  2. #pragma warning disable
  3. using System;
  4. using System.Diagnostics;
  5. using BestHTTP.SecureProtocol.Org.BouncyCastle.Crypto.Utilities;
  6. namespace BestHTTP.SecureProtocol.Org.BouncyCastle.Math.Raw
  7. {
  8. internal abstract class Nat
  9. {
  10. private const ulong M = 0xFFFFFFFFUL;
  11. public static uint Add(int len, uint[] x, uint[] y, uint[] z)
  12. {
  13. ulong c = 0;
  14. for (int i = 0; i < len; ++i)
  15. {
  16. c += (ulong)x[i] + y[i];
  17. z[i] = (uint)c;
  18. c >>= 32;
  19. }
  20. return (uint)c;
  21. }
  22. public static uint Add33At(int len, uint x, uint[] z, int zPos)
  23. {
  24. Debug.Assert(zPos <= (len - 2));
  25. ulong c = (ulong)z[zPos + 0] + x;
  26. z[zPos + 0] = (uint)c;
  27. c >>= 32;
  28. c += (ulong)z[zPos + 1] + 1;
  29. z[zPos + 1] = (uint)c;
  30. c >>= 32;
  31. return c == 0 ? 0 : IncAt(len, z, zPos + 2);
  32. }
  33. public static uint Add33At(int len, uint x, uint[] z, int zOff, int zPos)
  34. {
  35. Debug.Assert(zPos <= (len - 2));
  36. ulong c = (ulong)z[zOff + zPos] + x;
  37. z[zOff + zPos] = (uint)c;
  38. c >>= 32;
  39. c += (ulong)z[zOff + zPos + 1] + 1;
  40. z[zOff + zPos + 1] = (uint)c;
  41. c >>= 32;
  42. return c == 0 ? 0 : IncAt(len, z, zOff, zPos + 2);
  43. }
  44. public static uint Add33To(int len, uint x, uint[] z)
  45. {
  46. ulong c = (ulong)z[0] + x;
  47. z[0] = (uint)c;
  48. c >>= 32;
  49. c += (ulong)z[1] + 1;
  50. z[1] = (uint)c;
  51. c >>= 32;
  52. return c == 0 ? 0 : IncAt(len, z, 2);
  53. }
  54. public static uint Add33To(int len, uint x, uint[] z, int zOff)
  55. {
  56. ulong c = (ulong)z[zOff + 0] + x;
  57. z[zOff + 0] = (uint)c;
  58. c >>= 32;
  59. c += (ulong)z[zOff + 1] + 1;
  60. z[zOff + 1] = (uint)c;
  61. c >>= 32;
  62. return c == 0 ? 0 : IncAt(len, z, zOff, 2);
  63. }
  64. public static uint AddBothTo(int len, uint[] x, uint[] y, uint[] z)
  65. {
  66. ulong c = 0;
  67. for (int i = 0; i < len; ++i)
  68. {
  69. c += (ulong)x[i] + y[i] + z[i];
  70. z[i] = (uint)c;
  71. c >>= 32;
  72. }
  73. return (uint)c;
  74. }
  75. public static uint AddBothTo(int len, uint[] x, int xOff, uint[] y, int yOff, uint[] z, int zOff)
  76. {
  77. ulong c = 0;
  78. for (int i = 0; i < len; ++i)
  79. {
  80. c += (ulong)x[xOff + i] + y[yOff + i] + z[zOff + i];
  81. z[zOff + i] = (uint)c;
  82. c >>= 32;
  83. }
  84. return (uint)c;
  85. }
  86. public static uint AddDWordAt(int len, ulong x, uint[] z, int zPos)
  87. {
  88. Debug.Assert(zPos <= (len - 2));
  89. ulong c = (ulong)z[zPos + 0] + (x & M);
  90. z[zPos + 0] = (uint)c;
  91. c >>= 32;
  92. c += (ulong)z[zPos + 1] + (x >> 32);
  93. z[zPos + 1] = (uint)c;
  94. c >>= 32;
  95. return c == 0 ? 0 : IncAt(len, z, zPos + 2);
  96. }
  97. public static uint AddDWordAt(int len, ulong x, uint[] z, int zOff, int zPos)
  98. {
  99. Debug.Assert(zPos <= (len - 2));
  100. ulong c = (ulong)z[zOff + zPos] + (x & M);
  101. z[zOff + zPos] = (uint)c;
  102. c >>= 32;
  103. c += (ulong)z[zOff + zPos + 1] + (x >> 32);
  104. z[zOff + zPos + 1] = (uint)c;
  105. c >>= 32;
  106. return c == 0 ? 0 : IncAt(len, z, zOff, zPos + 2);
  107. }
  108. public static uint AddDWordTo(int len, ulong x, uint[] z)
  109. {
  110. ulong c = (ulong)z[0] + (x & M);
  111. z[0] = (uint)c;
  112. c >>= 32;
  113. c += (ulong)z[1] + (x >> 32);
  114. z[1] = (uint)c;
  115. c >>= 32;
  116. return c == 0 ? 0 : IncAt(len, z, 2);
  117. }
  118. public static uint AddDWordTo(int len, ulong x, uint[] z, int zOff)
  119. {
  120. ulong c = (ulong)z[zOff + 0] + (x & M);
  121. z[zOff + 0] = (uint)c;
  122. c >>= 32;
  123. c += (ulong)z[zOff + 1] + (x >> 32);
  124. z[zOff + 1] = (uint)c;
  125. c >>= 32;
  126. return c == 0 ? 0 : IncAt(len, z, zOff, 2);
  127. }
  128. public static uint AddTo(int len, uint[] x, uint[] z)
  129. {
  130. ulong c = 0;
  131. for (int i = 0; i < len; ++i)
  132. {
  133. c += (ulong)x[i] + z[i];
  134. z[i] = (uint)c;
  135. c >>= 32;
  136. }
  137. return (uint)c;
  138. }
  139. public static uint AddTo(int len, uint[] x, int xOff, uint[] z, int zOff)
  140. {
  141. ulong c = 0;
  142. for (int i = 0; i < len; ++i)
  143. {
  144. c += (ulong)x[xOff + i] + z[zOff + i];
  145. z[zOff + i] = (uint)c;
  146. c >>= 32;
  147. }
  148. return (uint)c;
  149. }
  150. public static uint AddTo(int len, uint[] x, int xOff, uint[] z, int zOff, uint cIn)
  151. {
  152. ulong c = cIn;
  153. for (int i = 0; i < len; ++i)
  154. {
  155. c += (ulong)x[xOff + i] + z[zOff + i];
  156. z[zOff + i] = (uint)c;
  157. c >>= 32;
  158. }
  159. return (uint)c;
  160. }
  161. public static uint AddToEachOther(int len, uint[] u, int uOff, uint[] v, int vOff)
  162. {
  163. ulong c = 0;
  164. for (int i = 0; i < len; ++i)
  165. {
  166. c += (ulong)u[uOff + i] + v[vOff + i];
  167. u[uOff + i] = (uint)c;
  168. v[vOff + i] = (uint)c;
  169. c >>= 32;
  170. }
  171. return (uint)c;
  172. }
  173. public static uint AddWordAt(int len, uint x, uint[] z, int zPos)
  174. {
  175. Debug.Assert(zPos <= (len - 1));
  176. ulong c = (ulong)x + z[zPos];
  177. z[zPos] = (uint)c;
  178. c >>= 32;
  179. return c == 0 ? 0 : IncAt(len, z, zPos + 1);
  180. }
  181. public static uint AddWordAt(int len, uint x, uint[] z, int zOff, int zPos)
  182. {
  183. Debug.Assert(zPos <= (len - 1));
  184. ulong c = (ulong)x + z[zOff + zPos];
  185. z[zOff + zPos] = (uint)c;
  186. c >>= 32;
  187. return c == 0 ? 0 : IncAt(len, z, zOff, zPos + 1);
  188. }
  189. public static uint AddWordTo(int len, uint x, uint[] z)
  190. {
  191. ulong c = (ulong)x + z[0];
  192. z[0] = (uint)c;
  193. c >>= 32;
  194. return c == 0 ? 0 : IncAt(len, z, 1);
  195. }
  196. public static uint AddWordTo(int len, uint x, uint[] z, int zOff)
  197. {
  198. ulong c = (ulong)x + z[zOff];
  199. z[zOff] = (uint)c;
  200. c >>= 32;
  201. return c == 0 ? 0 : IncAt(len, z, zOff, 1);
  202. }
  203. public static uint CAdd(int len, int mask, uint[] x, uint[] y, uint[] z)
  204. {
  205. uint MASK = (uint)-(mask & 1);
  206. ulong c = 0;
  207. for (int i = 0; i < len; ++i)
  208. {
  209. c += (ulong)x[i] + (y[i] & MASK);
  210. z[i] = (uint)c;
  211. c >>= 32;
  212. }
  213. return (uint)c;
  214. }
  215. public static void CMov(int len, int mask, uint[] x, int xOff, uint[] z, int zOff)
  216. {
  217. uint MASK = (uint)-(mask & 1);
  218. for (int i = 0; i < len; ++i)
  219. {
  220. uint z_i = z[zOff + i], diff = z_i ^ x[xOff + i];
  221. z_i ^= (diff & MASK);
  222. z[zOff + i] = z_i;
  223. }
  224. //uint half = 0x55555555U, rest = half << (-(int)MASK);
  225. //for (int i = 0; i < len; ++i)
  226. //{
  227. // uint z_i = z[zOff + i], diff = z_i ^ x[xOff + i];
  228. // z_i ^= (diff & half);
  229. // z_i ^= (diff & rest);
  230. // z[zOff + i] = z_i;
  231. //}
  232. }
  233. public static void CMov(int len, int mask, int[] x, int xOff, int[] z, int zOff)
  234. {
  235. mask = -(mask & 1);
  236. for (int i = 0; i < len; ++i)
  237. {
  238. int z_i = z[zOff + i], diff = z_i ^ x[xOff + i];
  239. z_i ^= (diff & mask);
  240. z[zOff + i] = z_i;
  241. }
  242. //int half = 0x55555555, rest = half << (-mask);
  243. //for (int i = 0; i < len; ++i)
  244. //{
  245. // int z_i = z[zOff + i], diff = z_i ^ x[xOff + i];
  246. // z_i ^= (diff & half);
  247. // z_i ^= (diff & rest);
  248. // z[zOff + i] = z_i;
  249. //}
  250. }
  251. public static int Compare(int len, uint[] x, uint[] y)
  252. {
  253. for (int i = len - 1; i >= 0; --i)
  254. {
  255. uint x_i = x[i];
  256. uint y_i = y[i];
  257. if (x_i < y_i)
  258. return -1;
  259. if (x_i > y_i)
  260. return 1;
  261. }
  262. return 0;
  263. }
  264. public static int Compare(int len, uint[] x, int xOff, uint[] y, int yOff)
  265. {
  266. for (int i = len - 1; i >= 0; --i)
  267. {
  268. uint x_i = x[xOff + i];
  269. uint y_i = y[yOff + i];
  270. if (x_i < y_i)
  271. return -1;
  272. if (x_i > y_i)
  273. return 1;
  274. }
  275. return 0;
  276. }
  277. public static void Copy(int len, uint[] x, uint[] z)
  278. {
  279. Array.Copy(x, 0, z, 0, len);
  280. }
  281. public static uint[] Copy(int len, uint[] x)
  282. {
  283. uint[] z = new uint[len];
  284. Array.Copy(x, 0, z, 0, len);
  285. return z;
  286. }
  287. public static void Copy(int len, uint[] x, int xOff, uint[] z, int zOff)
  288. {
  289. Array.Copy(x, xOff, z, zOff, len);
  290. }
  291. public static ulong[] Copy64(int len, ulong[] x)
  292. {
  293. ulong[] z = new ulong[len];
  294. Array.Copy(x, 0, z, 0, len);
  295. return z;
  296. }
  297. public static void Copy64(int len, ulong[] x, ulong[] z)
  298. {
  299. Array.Copy(x, 0, z, 0, len);
  300. }
  301. public static void Copy64(int len, ulong[] x, int xOff, ulong[] z, int zOff)
  302. {
  303. Array.Copy(x, xOff, z, zOff, len);
  304. }
  305. public static uint[] Create(int len)
  306. {
  307. return new uint[len];
  308. }
  309. public static ulong[] Create64(int len)
  310. {
  311. return new ulong[len];
  312. }
  313. public static int CSub(int len, int mask, uint[] x, uint[] y, uint[] z)
  314. {
  315. long MASK = (uint)-(mask & 1);
  316. long c = 0;
  317. for (int i = 0; i < len; ++i)
  318. {
  319. c += (long)x[i] - (y[i] & MASK);
  320. z[i] = (uint)c;
  321. c >>= 32;
  322. }
  323. return (int)c;
  324. }
  325. public static int CSub(int len, int mask, uint[] x, int xOff, uint[] y, int yOff, uint[] z, int zOff)
  326. {
  327. long MASK = (uint)-(mask & 1);
  328. long c = 0;
  329. for (int i = 0; i < len; ++i)
  330. {
  331. c += (long)x[xOff + i] - (y[yOff + i] & MASK);
  332. z[zOff + i] = (uint)c;
  333. c >>= 32;
  334. }
  335. return (int)c;
  336. }
  337. public static int Dec(int len, uint[] z)
  338. {
  339. for (int i = 0; i < len; ++i)
  340. {
  341. if (--z[i] != uint.MaxValue)
  342. {
  343. return 0;
  344. }
  345. }
  346. return -1;
  347. }
  348. public static int Dec(int len, uint[] x, uint[] z)
  349. {
  350. int i = 0;
  351. while (i < len)
  352. {
  353. uint c = x[i] - 1;
  354. z[i] = c;
  355. ++i;
  356. if (c != uint.MaxValue)
  357. {
  358. while (i < len)
  359. {
  360. z[i] = x[i];
  361. ++i;
  362. }
  363. return 0;
  364. }
  365. }
  366. return -1;
  367. }
  368. public static int DecAt(int len, uint[] z, int zPos)
  369. {
  370. Debug.Assert(zPos <= len);
  371. for (int i = zPos; i < len; ++i)
  372. {
  373. if (--z[i] != uint.MaxValue)
  374. {
  375. return 0;
  376. }
  377. }
  378. return -1;
  379. }
  380. public static int DecAt(int len, uint[] z, int zOff, int zPos)
  381. {
  382. Debug.Assert(zPos <= len);
  383. for (int i = zPos; i < len; ++i)
  384. {
  385. if (--z[zOff + i] != uint.MaxValue)
  386. {
  387. return 0;
  388. }
  389. }
  390. return -1;
  391. }
  392. public static bool Eq(int len, uint[] x, uint[] y)
  393. {
  394. for (int i = len - 1; i >= 0; --i)
  395. {
  396. if (x[i] != y[i])
  397. {
  398. return false;
  399. }
  400. }
  401. return true;
  402. }
  403. public static uint EqualTo(int len, uint[] x, uint y)
  404. {
  405. uint d = x[0] ^ y;
  406. for (int i = 1; i < len; ++i)
  407. {
  408. d |= x[i];
  409. }
  410. d = (d >> 1) | (d & 1);
  411. return (uint)(((int)d - 1) >> 31);
  412. }
  413. public static uint EqualTo(int len, uint[] x, int xOff, uint y)
  414. {
  415. uint d = x[xOff] ^ y;
  416. for (int i = 1; i < len; ++i)
  417. {
  418. d |= x[xOff + i];
  419. }
  420. d = (d >> 1) | (d & 1);
  421. return (uint)(((int)d - 1) >> 31);
  422. }
  423. public static uint EqualTo(int len, uint[] x, uint[] y)
  424. {
  425. uint d = 0;
  426. for (int i = 0; i < len; ++i)
  427. {
  428. d |= x[i] ^ y[i];
  429. }
  430. d = (d >> 1) | (d & 1);
  431. return (uint)(((int)d - 1) >> 31);
  432. }
  433. public static uint EqualTo(int len, uint[] x, int xOff, uint[] y, int yOff)
  434. {
  435. uint d = 0;
  436. for (int i = 0; i < len; ++i)
  437. {
  438. d |= x[xOff + i] ^ y[yOff + i];
  439. }
  440. d = (d >> 1) | (d & 1);
  441. return (uint)(((int)d - 1) >> 31);
  442. }
  443. public static uint EqualToZero(int len, uint[] x)
  444. {
  445. uint d = 0;
  446. for (int i = 0; i < len; ++i)
  447. {
  448. d |= x[i];
  449. }
  450. d = (d >> 1) | (d & 1);
  451. return (uint)(((int)d - 1) >> 31);
  452. }
  453. public static uint EqualToZero(int len, uint[] x, int xOff)
  454. {
  455. uint d = 0;
  456. for (int i = 0; i < len; ++i)
  457. {
  458. d |= x[xOff + i];
  459. }
  460. d = (d >> 1) | (d & 1);
  461. return (uint)(((int)d - 1) >> 31);
  462. }
  463. public static uint[] FromBigInteger(int bits, BigInteger x)
  464. {
  465. if (bits < 1)
  466. throw new ArgumentException();
  467. if (x.SignValue < 0 || x.BitLength > bits)
  468. throw new ArgumentException();
  469. int len = (bits + 31) >> 5;
  470. Debug.Assert(len > 0);
  471. uint[] z = Create(len);
  472. // NOTE: Use a fixed number of loop iterations
  473. z[0] = (uint)x.IntValue;
  474. for (int i = 1; i < len; ++i)
  475. {
  476. x = x.ShiftRight(32);
  477. z[i] = (uint)x.IntValue;
  478. }
  479. return z;
  480. }
  481. public static ulong[] FromBigInteger64(int bits, BigInteger x)
  482. {
  483. if (bits < 1)
  484. throw new ArgumentException();
  485. if (x.SignValue < 0 || x.BitLength > bits)
  486. throw new ArgumentException();
  487. int len = (bits + 63) >> 6;
  488. Debug.Assert(len > 0);
  489. ulong[] z = Create64(len);
  490. // NOTE: Use a fixed number of loop iterations
  491. z[0] = (ulong)x.LongValue;
  492. for (int i = 1; i < len; ++i)
  493. {
  494. x = x.ShiftRight(64);
  495. z[i] = (ulong)x.LongValue;
  496. }
  497. return z;
  498. }
  499. public static uint GetBit(uint[] x, int bit)
  500. {
  501. if (bit == 0)
  502. {
  503. return x[0] & 1;
  504. }
  505. int w = bit >> 5;
  506. if (w < 0 || w >= x.Length)
  507. {
  508. return 0;
  509. }
  510. int b = bit & 31;
  511. return (x[w] >> b) & 1;
  512. }
  513. public static bool Gte(int len, uint[] x, uint[] y)
  514. {
  515. for (int i = len - 1; i >= 0; --i)
  516. {
  517. uint x_i = x[i], y_i = y[i];
  518. if (x_i < y_i)
  519. return false;
  520. if (x_i > y_i)
  521. return true;
  522. }
  523. return true;
  524. }
  525. public static uint Inc(int len, uint[] z)
  526. {
  527. for (int i = 0; i < len; ++i)
  528. {
  529. if (++z[i] != uint.MinValue)
  530. {
  531. return 0;
  532. }
  533. }
  534. return 1;
  535. }
  536. public static uint Inc(int len, uint[] x, uint[] z)
  537. {
  538. int i = 0;
  539. while (i < len)
  540. {
  541. uint c = x[i] + 1;
  542. z[i] = c;
  543. ++i;
  544. if (c != 0)
  545. {
  546. while (i < len)
  547. {
  548. z[i] = x[i];
  549. ++i;
  550. }
  551. return 0;
  552. }
  553. }
  554. return 1;
  555. }
  556. public static uint IncAt(int len, uint[] z, int zPos)
  557. {
  558. Debug.Assert(zPos <= len);
  559. for (int i = zPos; i < len; ++i)
  560. {
  561. if (++z[i] != uint.MinValue)
  562. {
  563. return 0;
  564. }
  565. }
  566. return 1;
  567. }
  568. public static uint IncAt(int len, uint[] z, int zOff, int zPos)
  569. {
  570. Debug.Assert(zPos <= len);
  571. for (int i = zPos; i < len; ++i)
  572. {
  573. if (++z[zOff + i] != uint.MinValue)
  574. {
  575. return 0;
  576. }
  577. }
  578. return 1;
  579. }
  580. public static bool IsOne(int len, uint[] x)
  581. {
  582. if (x[0] != 1)
  583. {
  584. return false;
  585. }
  586. for (int i = 1; i < len; ++i)
  587. {
  588. if (x[i] != 0)
  589. {
  590. return false;
  591. }
  592. }
  593. return true;
  594. }
  595. public static bool IsZero(int len, uint[] x)
  596. {
  597. if (x[0] != 0)
  598. {
  599. return false;
  600. }
  601. for (int i = 1; i < len; ++i)
  602. {
  603. if (x[i] != 0)
  604. {
  605. return false;
  606. }
  607. }
  608. return true;
  609. }
  610. public static int LessThan(int len, uint[] x, uint[] y)
  611. {
  612. long c = 0;
  613. for (int i = 0; i < len; ++i)
  614. {
  615. c += (long)x[i] - y[i];
  616. c >>= 32;
  617. }
  618. Debug.Assert(c == 0L || c == -1L);
  619. return (int)c;
  620. }
  621. public static int LessThan(int len, uint[] x, int xOff, uint[] y, int yOff)
  622. {
  623. long c = 0;
  624. for (int i = 0; i < len; ++i)
  625. {
  626. c += (long)x[xOff + i] - y[yOff + i];
  627. c >>= 32;
  628. }
  629. Debug.Assert(c == 0L || c == -1L);
  630. return (int)c;
  631. }
  632. public static void Mul(int len, uint[] x, uint[] y, uint[] zz)
  633. {
  634. zz[len] = MulWord(len, x[0], y, zz);
  635. for (int i = 1; i < len; ++i)
  636. {
  637. zz[i + len] = MulWordAddTo(len, x[i], y, 0, zz, i);
  638. }
  639. }
  640. public static void Mul(int len, uint[] x, int xOff, uint[] y, int yOff, uint[] zz, int zzOff)
  641. {
  642. zz[zzOff + len] = MulWord(len, x[xOff], y, yOff, zz, zzOff);
  643. for (int i = 1; i < len; ++i)
  644. {
  645. zz[zzOff + i + len] = MulWordAddTo(len, x[xOff + i], y, yOff, zz, zzOff + i);
  646. }
  647. }
  648. public static void Mul(uint[] x, int xOff, int xLen, uint[] y, int yOff, int yLen, uint[] zz, int zzOff)
  649. {
  650. zz[zzOff + yLen] = MulWord(yLen, x[xOff], y, yOff, zz, zzOff);
  651. for (int i = 1; i < xLen; ++i)
  652. {
  653. zz[zzOff + i + yLen] = MulWordAddTo(yLen, x[xOff + i], y, yOff, zz, zzOff + i);
  654. }
  655. }
  656. public static uint MulAddTo(int len, uint[] x, uint[] y, uint[] zz)
  657. {
  658. ulong zc = 0;
  659. for (int i = 0; i < len; ++i)
  660. {
  661. zc += MulWordAddTo(len, x[i], y, 0, zz, i) & M;
  662. zc += zz[i + len] & M;
  663. zz[i + len] = (uint)zc;
  664. zc >>= 32;
  665. }
  666. return (uint)zc;
  667. }
  668. public static uint MulAddTo(int len, uint[] x, int xOff, uint[] y, int yOff, uint[] zz, int zzOff)
  669. {
  670. ulong zc = 0;
  671. for (int i = 0; i < len; ++i)
  672. {
  673. zc += MulWordAddTo(len, x[xOff + i], y, yOff, zz, zzOff) & M;
  674. zc += zz[zzOff + len] & M;
  675. zz[zzOff + len] = (uint)zc;
  676. zc >>= 32;
  677. ++zzOff;
  678. }
  679. return (uint)zc;
  680. }
  681. public static uint Mul31BothAdd(int len, uint a, uint[] x, uint b, uint[] y, uint[] z, int zOff)
  682. {
  683. ulong c = 0, aVal = (ulong)a, bVal = (ulong)b;
  684. int i = 0;
  685. do
  686. {
  687. c += aVal * x[i] + bVal * y[i] + z[zOff + i];
  688. z[zOff + i] = (uint)c;
  689. c >>= 32;
  690. }
  691. while (++i < len);
  692. return (uint)c;
  693. }
  694. public static uint MulWord(int len, uint x, uint[] y, uint[] z)
  695. {
  696. ulong c = 0, xVal = (ulong)x;
  697. int i = 0;
  698. do
  699. {
  700. c += xVal * y[i];
  701. z[i] = (uint)c;
  702. c >>= 32;
  703. }
  704. while (++i < len);
  705. return (uint)c;
  706. }
  707. public static uint MulWord(int len, uint x, uint[] y, int yOff, uint[] z, int zOff)
  708. {
  709. ulong c = 0, xVal = (ulong)x;
  710. int i = 0;
  711. do
  712. {
  713. c += xVal * y[yOff + i];
  714. z[zOff + i] = (uint)c;
  715. c >>= 32;
  716. }
  717. while (++i < len);
  718. return (uint)c;
  719. }
  720. public static uint MulWordAddTo(int len, uint x, uint[] y, int yOff, uint[] z, int zOff)
  721. {
  722. ulong c = 0, xVal = (ulong)x;
  723. int i = 0;
  724. do
  725. {
  726. c += xVal * y[yOff + i] + z[zOff + i];
  727. z[zOff + i] = (uint)c;
  728. c >>= 32;
  729. }
  730. while (++i < len);
  731. return (uint)c;
  732. }
  733. public static uint MulWordDwordAddAt(int len, uint x, ulong y, uint[] z, int zPos)
  734. {
  735. Debug.Assert(zPos <= (len - 3));
  736. ulong c = 0, xVal = (ulong)x;
  737. c += xVal * (uint)y + z[zPos + 0];
  738. z[zPos + 0] = (uint)c;
  739. c >>= 32;
  740. c += xVal * (y >> 32) + z[zPos + 1];
  741. z[zPos + 1] = (uint)c;
  742. c >>= 32;
  743. c += (ulong)z[zPos + 2];
  744. z[zPos + 2] = (uint)c;
  745. c >>= 32;
  746. return c == 0 ? 0 : IncAt(len, z, zPos + 3);
  747. }
  748. public static uint ShiftDownBit(int len, uint[] z, uint c)
  749. {
  750. int i = len;
  751. while (--i >= 0)
  752. {
  753. uint next = z[i];
  754. z[i] = (next >> 1) | (c << 31);
  755. c = next;
  756. }
  757. return c << 31;
  758. }
  759. public static uint ShiftDownBit(int len, uint[] z, int zOff, uint c)
  760. {
  761. int i = len;
  762. while (--i >= 0)
  763. {
  764. uint next = z[zOff + i];
  765. z[zOff + i] = (next >> 1) | (c << 31);
  766. c = next;
  767. }
  768. return c << 31;
  769. }
  770. public static uint ShiftDownBit(int len, uint[] x, uint c, uint[] z)
  771. {
  772. int i = len;
  773. while (--i >= 0)
  774. {
  775. uint next = x[i];
  776. z[i] = (next >> 1) | (c << 31);
  777. c = next;
  778. }
  779. return c << 31;
  780. }
  781. public static uint ShiftDownBit(int len, uint[] x, int xOff, uint c, uint[] z, int zOff)
  782. {
  783. int i = len;
  784. while (--i >= 0)
  785. {
  786. uint next = x[xOff + i];
  787. z[zOff + i] = (next >> 1) | (c << 31);
  788. c = next;
  789. }
  790. return c << 31;
  791. }
  792. public static uint ShiftDownBits(int len, uint[] z, int bits, uint c)
  793. {
  794. Debug.Assert(bits > 0 && bits < 32);
  795. int i = len;
  796. while (--i >= 0)
  797. {
  798. uint next = z[i];
  799. z[i] = (next >> bits) | (c << -bits);
  800. c = next;
  801. }
  802. return c << -bits;
  803. }
  804. public static uint ShiftDownBits(int len, uint[] z, int zOff, int bits, uint c)
  805. {
  806. Debug.Assert(bits > 0 && bits < 32);
  807. int i = len;
  808. while (--i >= 0)
  809. {
  810. uint next = z[zOff + i];
  811. z[zOff + i] = (next >> bits) | (c << -bits);
  812. c = next;
  813. }
  814. return c << -bits;
  815. }
  816. public static uint ShiftDownBits(int len, uint[] x, int bits, uint c, uint[] z)
  817. {
  818. Debug.Assert(bits > 0 && bits < 32);
  819. int i = len;
  820. while (--i >= 0)
  821. {
  822. uint next = x[i];
  823. z[i] = (next >> bits) | (c << -bits);
  824. c = next;
  825. }
  826. return c << -bits;
  827. }
  828. public static uint ShiftDownBits(int len, uint[] x, int xOff, int bits, uint c, uint[] z, int zOff)
  829. {
  830. Debug.Assert(bits > 0 && bits < 32);
  831. int i = len;
  832. while (--i >= 0)
  833. {
  834. uint next = x[xOff + i];
  835. z[zOff + i] = (next >> bits) | (c << -bits);
  836. c = next;
  837. }
  838. return c << -bits;
  839. }
  840. public static uint ShiftDownWord(int len, uint[] z, uint c)
  841. {
  842. int i = len;
  843. while (--i >= 0)
  844. {
  845. uint next = z[i];
  846. z[i] = c;
  847. c = next;
  848. }
  849. return c;
  850. }
  851. public static uint ShiftUpBit(int len, uint[] z, uint c)
  852. {
  853. for (int i = 0; i < len; ++i)
  854. {
  855. uint next = z[i];
  856. z[i] = (next << 1) | (c >> 31);
  857. c = next;
  858. }
  859. return c >> 31;
  860. }
  861. public static uint ShiftUpBit(int len, uint[] z, int zOff, uint c)
  862. {
  863. for (int i = 0; i < len; ++i)
  864. {
  865. uint next = z[zOff + i];
  866. z[zOff + i] = (next << 1) | (c >> 31);
  867. c = next;
  868. }
  869. return c >> 31;
  870. }
  871. public static uint ShiftUpBit(int len, uint[] x, uint c, uint[] z)
  872. {
  873. for (int i = 0; i < len; ++i)
  874. {
  875. uint next = x[i];
  876. z[i] = (next << 1) | (c >> 31);
  877. c = next;
  878. }
  879. return c >> 31;
  880. }
  881. public static uint ShiftUpBit(int len, uint[] x, int xOff, uint c, uint[] z, int zOff)
  882. {
  883. for (int i = 0; i < len; ++i)
  884. {
  885. uint next = x[xOff + i];
  886. z[zOff + i] = (next << 1) | (c >> 31);
  887. c = next;
  888. }
  889. return c >> 31;
  890. }
  891. public static ulong ShiftUpBit64(int len, ulong[] x, int xOff, ulong c, ulong[] z, int zOff)
  892. {
  893. for (int i = 0; i < len; ++i)
  894. {
  895. ulong next = x[xOff + i];
  896. z[zOff + i] = (next << 1) | (c >> 63);
  897. c = next;
  898. }
  899. return c >> 63;
  900. }
  901. public static uint ShiftUpBits(int len, uint[] z, int bits, uint c)
  902. {
  903. Debug.Assert(bits > 0 && bits < 32);
  904. for (int i = 0; i < len; ++i)
  905. {
  906. uint next = z[i];
  907. z[i] = (next << bits) | (c >> -bits);
  908. c = next;
  909. }
  910. return c >> -bits;
  911. }
  912. public static uint ShiftUpBits(int len, uint[] z, int zOff, int bits, uint c)
  913. {
  914. Debug.Assert(bits > 0 && bits < 32);
  915. for (int i = 0; i < len; ++i)
  916. {
  917. uint next = z[zOff + i];
  918. z[zOff + i] = (next << bits) | (c >> -bits);
  919. c = next;
  920. }
  921. return c >> -bits;
  922. }
  923. public static ulong ShiftUpBits64(int len, ulong[] z, int zOff, int bits, ulong c)
  924. {
  925. Debug.Assert(bits > 0 && bits < 64);
  926. for (int i = 0; i < len; ++i)
  927. {
  928. ulong next = z[zOff + i];
  929. z[zOff + i] = (next << bits) | (c >> -bits);
  930. c = next;
  931. }
  932. return c >> -bits;
  933. }
  934. public static uint ShiftUpBits(int len, uint[] x, int bits, uint c, uint[] z)
  935. {
  936. Debug.Assert(bits > 0 && bits < 32);
  937. for (int i = 0; i < len; ++i)
  938. {
  939. uint next = x[i];
  940. z[i] = (next << bits) | (c >> -bits);
  941. c = next;
  942. }
  943. return c >> -bits;
  944. }
  945. public static uint ShiftUpBits(int len, uint[] x, int xOff, int bits, uint c, uint[] z, int zOff)
  946. {
  947. Debug.Assert(bits > 0 && bits < 32);
  948. for (int i = 0; i < len; ++i)
  949. {
  950. uint next = x[xOff + i];
  951. z[zOff + i] = (next << bits) | (c >> -bits);
  952. c = next;
  953. }
  954. return c >> -bits;
  955. }
  956. public static ulong ShiftUpBits64(int len, ulong[] x, int xOff, int bits, ulong c, ulong[] z, int zOff)
  957. {
  958. Debug.Assert(bits > 0 && bits < 64);
  959. for (int i = 0; i < len; ++i)
  960. {
  961. ulong next = x[xOff + i];
  962. z[zOff + i] = (next << bits) | (c >> -bits);
  963. c = next;
  964. }
  965. return c >> -bits;
  966. }
  967. public static void Square(int len, uint[] x, uint[] zz)
  968. {
  969. int extLen = len << 1;
  970. uint c = 0;
  971. int j = len, k = extLen;
  972. do
  973. {
  974. ulong xVal = (ulong)x[--j];
  975. ulong p = xVal * xVal;
  976. zz[--k] = (c << 31) | (uint)(p >> 33);
  977. zz[--k] = (uint)(p >> 1);
  978. c = (uint)p;
  979. }
  980. while (j > 0);
  981. ulong d = 0UL;
  982. int zzPos = 2;
  983. for (int i = 1; i < len; ++i)
  984. {
  985. d += SquareWordAddTo(x, i, zz);
  986. d += zz[zzPos];
  987. zz[zzPos++] = (uint)d; d >>= 32;
  988. d += zz[zzPos];
  989. zz[zzPos++] = (uint)d; d >>= 32;
  990. }
  991. Debug.Assert(0UL == d);
  992. ShiftUpBit(extLen, zz, x[0] << 31);
  993. }
  994. public static void Square(int len, uint[] x, int xOff, uint[] zz, int zzOff)
  995. {
  996. int extLen = len << 1;
  997. uint c = 0;
  998. int j = len, k = extLen;
  999. do
  1000. {
  1001. ulong xVal = (ulong)x[xOff + --j];
  1002. ulong p = xVal * xVal;
  1003. zz[zzOff + --k] = (c << 31) | (uint)(p >> 33);
  1004. zz[zzOff + --k] = (uint)(p >> 1);
  1005. c = (uint)p;
  1006. }
  1007. while (j > 0);
  1008. ulong d = 0UL;
  1009. int zzPos = zzOff + 2;
  1010. for (int i = 1; i < len; ++i)
  1011. {
  1012. d += SquareWordAddTo(x, xOff, i, zz, zzOff);
  1013. d += zz[zzPos];
  1014. zz[zzPos++] = (uint)d; d >>= 32;
  1015. d += zz[zzPos];
  1016. zz[zzPos++] = (uint)d; d >>= 32;
  1017. }
  1018. Debug.Assert(0UL == d);
  1019. ShiftUpBit(extLen, zz, zzOff, x[xOff] << 31);
  1020. }
  1021. public static uint SquareWordAdd(uint[] x, int xPos, uint[] z)
  1022. {
  1023. ulong c = 0, xVal = (ulong)x[xPos];
  1024. int i = 0;
  1025. do
  1026. {
  1027. c += xVal * x[i] + z[xPos + i];
  1028. z[xPos + i] = (uint)c;
  1029. c >>= 32;
  1030. }
  1031. while (++i < xPos);
  1032. return (uint)c;
  1033. }
  1034. public static uint SquareWordAdd(uint[] x, int xOff, int xPos, uint[] z, int zOff)
  1035. {
  1036. ulong c = 0, xVal = (ulong)x[xOff + xPos];
  1037. int i = 0;
  1038. do
  1039. {
  1040. c += xVal * (x[xOff + i] & M) + (z[xPos + zOff] & M);
  1041. z[xPos + zOff] = (uint)c;
  1042. c >>= 32;
  1043. ++zOff;
  1044. }
  1045. while (++i < xPos);
  1046. return (uint)c;
  1047. }
  1048. public static uint SquareWordAddTo(uint[] x, int xPos, uint[] z)
  1049. {
  1050. ulong c = 0, xVal = (ulong)x[xPos];
  1051. int i = 0;
  1052. do
  1053. {
  1054. c += xVal * x[i] + z[xPos + i];
  1055. z[xPos + i] = (uint)c;
  1056. c >>= 32;
  1057. }
  1058. while (++i < xPos);
  1059. return (uint)c;
  1060. }
  1061. public static uint SquareWordAddTo(uint[] x, int xOff, int xPos, uint[] z, int zOff)
  1062. {
  1063. ulong c = 0, xVal = (ulong)x[xOff + xPos];
  1064. int i = 0;
  1065. do
  1066. {
  1067. c += xVal * (x[xOff + i] & M) + (z[xPos + zOff] & M);
  1068. z[xPos + zOff] = (uint)c;
  1069. c >>= 32;
  1070. ++zOff;
  1071. }
  1072. while (++i < xPos);
  1073. return (uint)c;
  1074. }
  1075. public static int Sub(int len, uint[] x, uint[] y, uint[] z)
  1076. {
  1077. long c = 0;
  1078. for (int i = 0; i < len; ++i)
  1079. {
  1080. c += (long)x[i] - y[i];
  1081. z[i] = (uint)c;
  1082. c >>= 32;
  1083. }
  1084. return (int)c;
  1085. }
  1086. public static int Sub(int len, uint[] x, int xOff, uint[] y, int yOff, uint[] z, int zOff)
  1087. {
  1088. long c = 0;
  1089. for (int i = 0; i < len; ++i)
  1090. {
  1091. c += (long)x[xOff + i] - y[yOff + i];
  1092. z[zOff + i] = (uint)c;
  1093. c >>= 32;
  1094. }
  1095. return (int)c;
  1096. }
  1097. public static int Sub33At(int len, uint x, uint[] z, int zPos)
  1098. {
  1099. Debug.Assert(zPos <= (len - 2));
  1100. long c = (long)z[zPos + 0] - x;
  1101. z[zPos + 0] = (uint)c;
  1102. c >>= 32;
  1103. c += (long)z[zPos + 1] - 1;
  1104. z[zPos + 1] = (uint)c;
  1105. c >>= 32;
  1106. return c == 0 ? 0 : DecAt(len, z, zPos + 2);
  1107. }
  1108. public static int Sub33At(int len, uint x, uint[] z, int zOff, int zPos)
  1109. {
  1110. Debug.Assert(zPos <= (len - 2));
  1111. long c = (long)z[zOff + zPos] - x;
  1112. z[zOff + zPos] = (uint)c;
  1113. c >>= 32;
  1114. c += (long)z[zOff + zPos + 1] - 1;
  1115. z[zOff + zPos + 1] = (uint)c;
  1116. c >>= 32;
  1117. return c == 0 ? 0 : DecAt(len, z, zOff, zPos + 2);
  1118. }
  1119. public static int Sub33From(int len, uint x, uint[] z)
  1120. {
  1121. long c = (long)z[0] - x;
  1122. z[0] = (uint)c;
  1123. c >>= 32;
  1124. c += (long)z[1] - 1;
  1125. z[1] = (uint)c;
  1126. c >>= 32;
  1127. return c == 0 ? 0 : DecAt(len, z, 2);
  1128. }
  1129. public static int Sub33From(int len, uint x, uint[] z, int zOff)
  1130. {
  1131. long c = (long)z[zOff + 0] - x;
  1132. z[zOff + 0] = (uint)c;
  1133. c >>= 32;
  1134. c += (long)z[zOff + 1] - 1;
  1135. z[zOff + 1] = (uint)c;
  1136. c >>= 32;
  1137. return c == 0 ? 0 : DecAt(len, z, zOff, 2);
  1138. }
  1139. public static int SubBothFrom(int len, uint[] x, uint[] y, uint[] z)
  1140. {
  1141. long c = 0;
  1142. for (int i = 0; i < len; ++i)
  1143. {
  1144. c += (long)z[i] - x[i] - y[i];
  1145. z[i] = (uint)c;
  1146. c >>= 32;
  1147. }
  1148. return (int)c;
  1149. }
  1150. public static int SubBothFrom(int len, uint[] x, int xOff, uint[] y, int yOff, uint[] z, int zOff)
  1151. {
  1152. long c = 0;
  1153. for (int i = 0; i < len; ++i)
  1154. {
  1155. c += (long)z[zOff + i] - x[xOff + i] - y[yOff + i];
  1156. z[zOff + i] = (uint)c;
  1157. c >>= 32;
  1158. }
  1159. return (int)c;
  1160. }
  1161. public static int SubDWordAt(int len, ulong x, uint[] z, int zPos)
  1162. {
  1163. Debug.Assert(zPos <= (len - 2));
  1164. long c = (long)z[zPos + 0] - (long)(x & M);
  1165. z[zPos + 0] = (uint)c;
  1166. c >>= 32;
  1167. c += (long)z[zPos + 1] - (long)(x >> 32);
  1168. z[zPos + 1] = (uint)c;
  1169. c >>= 32;
  1170. return c == 0 ? 0 : DecAt(len, z, zPos + 2);
  1171. }
  1172. public static int SubDWordAt(int len, ulong x, uint[] z, int zOff, int zPos)
  1173. {
  1174. Debug.Assert(zPos <= (len - 2));
  1175. long c = (long)z[zOff + zPos] - (long)(x & M);
  1176. z[zOff + zPos] = (uint)c;
  1177. c >>= 32;
  1178. c += (long)z[zOff + zPos + 1] - (long)(x >> 32);
  1179. z[zOff + zPos + 1] = (uint)c;
  1180. c >>= 32;
  1181. return c == 0 ? 0 : DecAt(len, z, zOff, zPos + 2);
  1182. }
  1183. public static int SubDWordFrom(int len, ulong x, uint[] z)
  1184. {
  1185. long c = (long)z[0] - (long)(x & M);
  1186. z[0] = (uint)c;
  1187. c >>= 32;
  1188. c += (long)z[1] - (long)(x >> 32);
  1189. z[1] = (uint)c;
  1190. c >>= 32;
  1191. return c == 0 ? 0 : DecAt(len, z, 2);
  1192. }
  1193. public static int SubDWordFrom(int len, ulong x, uint[] z, int zOff)
  1194. {
  1195. long c = (long)z[zOff + 0] - (long)(x & M);
  1196. z[zOff + 0] = (uint)c;
  1197. c >>= 32;
  1198. c += (long)z[zOff + 1] - (long)(x >> 32);
  1199. z[zOff + 1] = (uint)c;
  1200. c >>= 32;
  1201. return c == 0 ? 0 : DecAt(len, z, zOff, 2);
  1202. }
  1203. public static int SubFrom(int len, uint[] x, uint[] z)
  1204. {
  1205. long c = 0;
  1206. for (int i = 0; i < len; ++i)
  1207. {
  1208. c += (long)z[i] - x[i];
  1209. z[i] = (uint)c;
  1210. c >>= 32;
  1211. }
  1212. return (int)c;
  1213. }
  1214. public static int SubFrom(int len, uint[] x, int xOff, uint[] z, int zOff)
  1215. {
  1216. long c = 0;
  1217. for (int i = 0; i < len; ++i)
  1218. {
  1219. c += (long)z[zOff + i] - x[xOff + i];
  1220. z[zOff + i] = (uint)c;
  1221. c >>= 32;
  1222. }
  1223. return (int)c;
  1224. }
  1225. public static int SubWordAt(int len, uint x, uint[] z, int zPos)
  1226. {
  1227. Debug.Assert(zPos <= (len - 1));
  1228. long c = (long)z[zPos] - x;
  1229. z[zPos] = (uint)c;
  1230. c >>= 32;
  1231. return c == 0 ? 0 : DecAt(len, z, zPos + 1);
  1232. }
  1233. public static int SubWordAt(int len, uint x, uint[] z, int zOff, int zPos)
  1234. {
  1235. Debug.Assert(zPos <= (len - 1));
  1236. long c = (long)z[zOff + zPos] - x;
  1237. z[zOff + zPos] = (uint)c;
  1238. c >>= 32;
  1239. return c == 0 ? 0 : DecAt(len, z, zOff, zPos + 1);
  1240. }
  1241. public static int SubWordFrom(int len, uint x, uint[] z)
  1242. {
  1243. long c = (long)z[0] - x;
  1244. z[0] = (uint)c;
  1245. c >>= 32;
  1246. return c == 0 ? 0 : DecAt(len, z, 1);
  1247. }
  1248. public static int SubWordFrom(int len, uint x, uint[] z, int zOff)
  1249. {
  1250. long c = (long)z[zOff + 0] - x;
  1251. z[zOff + 0] = (uint)c;
  1252. c >>= 32;
  1253. return c == 0 ? 0 : DecAt(len, z, zOff, 1);
  1254. }
  1255. public static BigInteger ToBigInteger(int len, uint[] x)
  1256. {
  1257. byte[] bs = new byte[len << 2];
  1258. for (int i = 0; i < len; ++i)
  1259. {
  1260. uint x_i = x[i];
  1261. if (x_i != 0)
  1262. {
  1263. Pack.UInt32_To_BE(x_i, bs, (len - 1 - i) << 2);
  1264. }
  1265. }
  1266. return new BigInteger(1, bs);
  1267. }
  1268. public static void Zero(int len, uint[] z)
  1269. {
  1270. for (int i = 0; i < len; ++i)
  1271. {
  1272. z[i] = 0;
  1273. }
  1274. }
  1275. public static void Zero64(int len, ulong[] z)
  1276. {
  1277. for (int i = 0; i < len; ++i)
  1278. {
  1279. z[i] = 0UL;
  1280. }
  1281. }
  1282. }
  1283. }
  1284. #pragma warning restore
  1285. #endif