Nat.cs 33 KB

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