SecT571Field.cs 14 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459
  1. #if !BESTHTTP_DISABLE_ALTERNATE_SSL && (!UNITY_WEBGL || UNITY_EDITOR)
  2. #pragma warning disable
  3. using System;
  4. using System.Diagnostics;
  5. #if NETCOREAPP3_0_OR_GREATER
  6. using System.Runtime.Intrinsics;
  7. using System.Runtime.Intrinsics.X86;
  8. #endif
  9. using Best.HTTP.SecureProtocol.Org.BouncyCastle.Math.Raw;
  10. namespace Best.HTTP.SecureProtocol.Org.BouncyCastle.Math.EC.Custom.Sec
  11. {
  12. internal class SecT571Field
  13. {
  14. private const ulong M59 = ulong.MaxValue >> 5;
  15. private static readonly ulong[] ROOT_Z = new ulong[]{ 0x2BE1195F08CAFB99UL, 0x95F08CAF84657C23UL,
  16. 0xCAF84657C232BE11UL, 0x657C232BE1195F08UL, 0xF84657C2308CAF84UL, 0x7C232BE1195F08CAUL,
  17. 0xBE1195F08CAF8465UL, 0x5F08CAF84657C232UL, 0x784657C232BE119UL };
  18. public static void Add(ulong[] x, ulong[] y, ulong[] z)
  19. {
  20. Nat.Xor64(9, x, y, z);
  21. }
  22. private static void Add(ulong[] x, int xOff, ulong[] y, int yOff, ulong[] z, int zOff)
  23. {
  24. Nat.Xor64(9, x, xOff, y, yOff, z, zOff);
  25. }
  26. public static void AddBothTo(ulong[] x, ulong[] y, ulong[] z)
  27. {
  28. for (int i = 0; i < 9; ++i)
  29. {
  30. z[i] ^= x[i] ^ y[i];
  31. }
  32. }
  33. private static void AddBothTo(ulong[] x, int xOff, ulong[] y, int yOff, ulong[] z, int zOff)
  34. {
  35. for (int i = 0; i < 9; ++i)
  36. {
  37. z[zOff + i] ^= x[xOff + i] ^ y[yOff + i];
  38. }
  39. }
  40. public static void AddExt(ulong[] xx, ulong[] yy, ulong[] zz)
  41. {
  42. Nat.Xor64(18, xx, yy, zz);
  43. }
  44. public static void AddOne(ulong[] x, ulong[] z)
  45. {
  46. z[0] = x[0] ^ 1UL;
  47. for (int i = 1; i < 9; ++i)
  48. {
  49. z[i] = x[i];
  50. }
  51. }
  52. private static void AddTo(ulong[] x, ulong[] z)
  53. {
  54. Nat.XorTo64(9, x, z);
  55. }
  56. public static ulong[] FromBigInteger(BigInteger x)
  57. {
  58. return Nat.FromBigInteger64(571, x);
  59. }
  60. public static void HalfTrace(ulong[] x, ulong[] z)
  61. {
  62. ulong[] tt = Nat576.CreateExt64();
  63. Nat576.Copy64(x, z);
  64. for (int i = 1; i < 571; i += 2)
  65. {
  66. ImplSquare(z, tt);
  67. Reduce(tt, z);
  68. ImplSquare(z, tt);
  69. Reduce(tt, z);
  70. AddTo(x, z);
  71. }
  72. }
  73. public static void Invert(ulong[] x, ulong[] z)
  74. {
  75. if (Nat576.IsZero64(x))
  76. throw new InvalidOperationException();
  77. // Itoh-Tsujii inversion with bases { 2, 3, 5 }
  78. ulong[] t0 = Nat576.Create64();
  79. ulong[] t1 = Nat576.Create64();
  80. ulong[] t2 = Nat576.Create64();
  81. Square(x, t2);
  82. // 5 | 570
  83. Square(t2, t0);
  84. Square(t0, t1);
  85. Multiply(t0, t1, t0);
  86. SquareN(t0, 2, t1);
  87. Multiply(t0, t1, t0);
  88. Multiply(t0, t2, t0);
  89. // 3 | 114
  90. SquareN(t0, 5, t1);
  91. Multiply(t0, t1, t0);
  92. SquareN(t1, 5, t1);
  93. Multiply(t0, t1, t0);
  94. // 2 | 38
  95. SquareN(t0, 15, t1);
  96. Multiply(t0, t1, t2);
  97. // ! {2,3,5} | 19
  98. SquareN(t2, 30, t0);
  99. SquareN(t0, 30, t1);
  100. Multiply(t0, t1, t0);
  101. // 3 | 9
  102. SquareN(t0, 60, t1);
  103. Multiply(t0, t1, t0);
  104. SquareN(t1, 60, t1);
  105. Multiply(t0, t1, t0);
  106. // 3 | 3
  107. SquareN(t0, 180, t1);
  108. Multiply(t0, t1, t0);
  109. SquareN(t1, 180, t1);
  110. Multiply(t0, t1, t0);
  111. Multiply(t0, t2, z);
  112. }
  113. public static void Multiply(ulong[] x, ulong[] y, ulong[] z)
  114. {
  115. ulong[] tt = Nat576.CreateExt64();
  116. ImplMultiply(x, y, tt);
  117. Reduce(tt, z);
  118. }
  119. public static void MultiplyAddToExt(ulong[] x, ulong[] y, ulong[] zz)
  120. {
  121. ulong[] tt = Nat576.CreateExt64();
  122. ImplMultiply(x, y, tt);
  123. AddExt(zz, tt, zz);
  124. }
  125. public static void MultiplyPrecomp(ulong[] x, ulong[] precomp, ulong[] z)
  126. {
  127. ulong[] tt = Nat576.CreateExt64();
  128. ImplMultiplyPrecomp(x, precomp, tt);
  129. Reduce(tt, z);
  130. }
  131. public static void MultiplyPrecompAddToExt(ulong[] x, ulong[] precomp, ulong[] zz)
  132. {
  133. ulong[] tt = Nat576.CreateExt64();
  134. ImplMultiplyPrecomp(x, precomp, tt);
  135. AddExt(zz, tt, zz);
  136. }
  137. public static ulong[] PrecompMultiplicand(ulong[] x)
  138. {
  139. #if NETCOREAPP3_0_OR_GREATER
  140. ulong[] z = Nat576.Create64();
  141. Nat576.Copy64(x, z);
  142. return z;
  143. #else
  144. /*
  145. * Precompute table of all 4-bit products of x (first section)
  146. */
  147. int len = 9 << 4;
  148. ulong[] t = new ulong[len << 1];
  149. Array.Copy(x, 0, t, 9, 9);
  150. //Reduce5(t, 9);
  151. int tOff = 0;
  152. for (int i = 7; i > 0; --i)
  153. {
  154. tOff += 18;
  155. Nat.ShiftUpBit64(9, t, tOff >> 1, 0UL, t, tOff);
  156. Reduce5(t, tOff);
  157. Add(t, 9, t, tOff, t, tOff + 9);
  158. }
  159. /*
  160. * Second section with all 4-bit products of x shifted 4 bits
  161. */
  162. Nat.ShiftUpBits64(len, t, 0, 4, 0UL, t, len);
  163. return t;
  164. #endif
  165. }
  166. public static void Reduce(ulong[] xx, ulong[] z)
  167. {
  168. ulong xx09 = xx[9];
  169. ulong u = xx[17], v = xx09;
  170. xx09 = v ^ (u >> 59) ^ (u >> 57) ^ (u >> 54) ^ (u >> 49);
  171. v = xx[8] ^ (u << 5) ^ (u << 7) ^ (u << 10) ^ (u << 15);
  172. for (int i = 16; i >= 10; --i)
  173. {
  174. u = xx[i];
  175. z[i - 8] = v ^ (u >> 59) ^ (u >> 57) ^ (u >> 54) ^ (u >> 49);
  176. v = xx[i - 9] ^ (u << 5) ^ (u << 7) ^ (u << 10) ^ (u << 15);
  177. }
  178. u = xx09;
  179. z[1] = v ^ (u >> 59) ^ (u >> 57) ^ (u >> 54) ^ (u >> 49);
  180. v = xx[0] ^ (u << 5) ^ (u << 7) ^ (u << 10) ^ (u << 15);
  181. ulong x08 = z[8];
  182. ulong t = x08 >> 59;
  183. z[0] = v ^ t ^ (t << 2) ^ (t << 5) ^ (t << 10);
  184. z[8] = x08 & M59;
  185. }
  186. public static void Reduce5(ulong[] z, int zOff)
  187. {
  188. ulong z8 = z[zOff + 8], t = z8 >> 59;
  189. z[zOff ] ^= t ^ (t << 2) ^ (t << 5) ^ (t << 10);
  190. z[zOff + 8] = z8 & M59;
  191. }
  192. public static void Sqrt(ulong[] x, ulong[] z)
  193. {
  194. ulong[] evn = Nat576.Create64(), odd = Nat576.Create64();
  195. odd[0] = Interleave.Unshuffle(x[0], x[1], out evn[0]);
  196. odd[1] = Interleave.Unshuffle(x[2], x[3], out evn[1]);
  197. odd[2] = Interleave.Unshuffle(x[4], x[5], out evn[2]);
  198. odd[3] = Interleave.Unshuffle(x[6], x[7], out evn[3]);
  199. odd[4] = Interleave.Unshuffle(x[8] , out evn[4]);
  200. Multiply(odd, ROOT_Z, z);
  201. Add(z, evn, z);
  202. }
  203. public static void Square(ulong[] x, ulong[] z)
  204. {
  205. ulong[] tt = Nat576.CreateExt64();
  206. ImplSquare(x, tt);
  207. Reduce(tt, z);
  208. }
  209. public static void SquareAddToExt(ulong[] x, ulong[] zz)
  210. {
  211. ulong[] tt = Nat576.CreateExt64();
  212. ImplSquare(x, tt);
  213. AddExt(zz, tt, zz);
  214. }
  215. public static void SquareN(ulong[] x, int n, ulong[] z)
  216. {
  217. Debug.Assert(n > 0);
  218. ulong[] tt = Nat576.CreateExt64();
  219. ImplSquare(x, tt);
  220. Reduce(tt, z);
  221. while (--n > 0)
  222. {
  223. ImplSquare(z, tt);
  224. Reduce(tt, z);
  225. }
  226. }
  227. public static uint Trace(ulong[] x)
  228. {
  229. // Non-zero-trace bits: 0, 561, 569
  230. return (uint)(x[0] ^ (x[8] >> 49) ^ (x[8] >> 57)) & 1U;
  231. }
  232. protected static void ImplMultiply(ulong[] x, ulong[] y, ulong[] zz)
  233. {
  234. //ulong[] precomp = PrecompMultiplicand(y);
  235. //ImplMultiplyPrecomp(x, precomp, zz);
  236. ulong[] u = new ulong[16];
  237. for (int i = 0; i < 9; ++i)
  238. {
  239. ImplMulwAcc(u, x[i], y[i], zz, i << 1);
  240. }
  241. ulong v0 = zz[0], v1 = zz[1];
  242. v0 ^= zz[ 2]; zz[1] = v0 ^ v1; v1 ^= zz[ 3];
  243. v0 ^= zz[ 4]; zz[2] = v0 ^ v1; v1 ^= zz[ 5];
  244. v0 ^= zz[ 6]; zz[3] = v0 ^ v1; v1 ^= zz[ 7];
  245. v0 ^= zz[ 8]; zz[4] = v0 ^ v1; v1 ^= zz[ 9];
  246. v0 ^= zz[10]; zz[5] = v0 ^ v1; v1 ^= zz[11];
  247. v0 ^= zz[12]; zz[6] = v0 ^ v1; v1 ^= zz[13];
  248. v0 ^= zz[14]; zz[7] = v0 ^ v1; v1 ^= zz[15];
  249. v0 ^= zz[16]; zz[8] = v0 ^ v1; v1 ^= zz[17];
  250. ulong w = v0 ^ v1;
  251. zz[ 9] = zz[0] ^ w;
  252. zz[10] = zz[1] ^ w;
  253. zz[11] = zz[2] ^ w;
  254. zz[12] = zz[3] ^ w;
  255. zz[13] = zz[4] ^ w;
  256. zz[14] = zz[5] ^ w;
  257. zz[15] = zz[6] ^ w;
  258. zz[16] = zz[7] ^ w;
  259. zz[17] = zz[8] ^ w;
  260. ImplMulwAcc(u, x[0] ^ x[1], y[0] ^ y[1], zz, 1);
  261. ImplMulwAcc(u, x[0] ^ x[2], y[0] ^ y[2], zz, 2);
  262. ImplMulwAcc(u, x[0] ^ x[3], y[0] ^ y[3], zz, 3);
  263. ImplMulwAcc(u, x[1] ^ x[2], y[1] ^ y[2], zz, 3);
  264. ImplMulwAcc(u, x[0] ^ x[4], y[0] ^ y[4], zz, 4);
  265. ImplMulwAcc(u, x[1] ^ x[3], y[1] ^ y[3], zz, 4);
  266. ImplMulwAcc(u, x[0] ^ x[5], y[0] ^ y[5], zz, 5);
  267. ImplMulwAcc(u, x[1] ^ x[4], y[1] ^ y[4], zz, 5);
  268. ImplMulwAcc(u, x[2] ^ x[3], y[2] ^ y[3], zz, 5);
  269. ImplMulwAcc(u, x[0] ^ x[6], y[0] ^ y[6], zz, 6);
  270. ImplMulwAcc(u, x[1] ^ x[5], y[1] ^ y[5], zz, 6);
  271. ImplMulwAcc(u, x[2] ^ x[4], y[2] ^ y[4], zz, 6);
  272. ImplMulwAcc(u, x[0] ^ x[7], y[0] ^ y[7], zz, 7);
  273. ImplMulwAcc(u, x[1] ^ x[6], y[1] ^ y[6], zz, 7);
  274. ImplMulwAcc(u, x[2] ^ x[5], y[2] ^ y[5], zz, 7);
  275. ImplMulwAcc(u, x[3] ^ x[4], y[3] ^ y[4], zz, 7);
  276. ImplMulwAcc(u, x[0] ^ x[8], y[0] ^ y[8], zz, 8);
  277. ImplMulwAcc(u, x[1] ^ x[7], y[1] ^ y[7], zz, 8);
  278. ImplMulwAcc(u, x[2] ^ x[6], y[2] ^ y[6], zz, 8);
  279. ImplMulwAcc(u, x[3] ^ x[5], y[3] ^ y[5], zz, 8);
  280. ImplMulwAcc(u, x[1] ^ x[8], y[1] ^ y[8], zz, 9);
  281. ImplMulwAcc(u, x[2] ^ x[7], y[2] ^ y[7], zz, 9);
  282. ImplMulwAcc(u, x[3] ^ x[6], y[3] ^ y[6], zz, 9);
  283. ImplMulwAcc(u, x[4] ^ x[5], y[4] ^ y[5], zz, 9);
  284. ImplMulwAcc(u, x[2] ^ x[8], y[2] ^ y[8], zz, 10);
  285. ImplMulwAcc(u, x[3] ^ x[7], y[3] ^ y[7], zz, 10);
  286. ImplMulwAcc(u, x[4] ^ x[6], y[4] ^ y[6], zz, 10);
  287. ImplMulwAcc(u, x[3] ^ x[8], y[3] ^ y[8], zz, 11);
  288. ImplMulwAcc(u, x[4] ^ x[7], y[4] ^ y[7], zz, 11);
  289. ImplMulwAcc(u, x[5] ^ x[6], y[5] ^ y[6], zz, 11);
  290. ImplMulwAcc(u, x[4] ^ x[8], y[4] ^ y[8], zz, 12);
  291. ImplMulwAcc(u, x[5] ^ x[7], y[5] ^ y[7], zz, 12);
  292. ImplMulwAcc(u, x[5] ^ x[8], y[5] ^ y[8], zz, 13);
  293. ImplMulwAcc(u, x[6] ^ x[7], y[6] ^ y[7], zz, 13);
  294. ImplMulwAcc(u, x[6] ^ x[8], y[6] ^ y[8], zz, 14);
  295. ImplMulwAcc(u, x[7] ^ x[8], y[7] ^ y[8], zz, 15);
  296. }
  297. protected static void ImplMultiplyPrecomp(ulong[] x, ulong[] precomp, ulong[] zz)
  298. {
  299. #if NETCOREAPP3_0_OR_GREATER
  300. ImplMultiply(x, precomp, zz);
  301. #else
  302. uint MASK = 0xF;
  303. /*
  304. * Lopez-Dahab algorithm
  305. */
  306. for (int k = 56; k >= 0; k -= 8)
  307. {
  308. for (int j = 1; j < 9; j += 2)
  309. {
  310. uint aVal = (uint)(x[j] >> k);
  311. uint u = aVal & MASK;
  312. uint v = (aVal >> 4) & MASK;
  313. AddBothTo(precomp, (int)(9 * u), precomp, (int)(9 * (v + 16)), zz, j - 1);
  314. }
  315. Nat.ShiftUpBits64(16, zz, 0, 8, 0UL);
  316. }
  317. for (int k = 56; k >= 0; k -= 8)
  318. {
  319. for (int j = 0; j < 9; j += 2)
  320. {
  321. uint aVal = (uint)(x[j] >> k);
  322. uint u = aVal & MASK;
  323. uint v = (aVal >> 4) & MASK;
  324. AddBothTo(precomp, (int)(9 * u), precomp, (int)(9 * (v + 16)), zz, j);
  325. }
  326. if (k > 0)
  327. {
  328. Nat.ShiftUpBits64(18, zz, 0, 8, 0UL);
  329. }
  330. }
  331. #endif
  332. }
  333. protected static void ImplMulwAcc(ulong[] u, ulong x, ulong y, ulong[] z, int zOff)
  334. {
  335. #if NETCOREAPP3_0_OR_GREATER
  336. if (Pclmulqdq.IsSupported)
  337. {
  338. var X = Vector128.CreateScalar(x);
  339. var Y = Vector128.CreateScalar(y);
  340. var Z = Pclmulqdq.CarrylessMultiply(X, Y, 0x00);
  341. z[zOff ] ^= Z.GetElement(0);
  342. z[zOff + 1] ^= Z.GetElement(1);
  343. return;
  344. }
  345. #endif
  346. //u[0] = 0;
  347. u[1] = y;
  348. for (int i = 2; i < 16; i += 2)
  349. {
  350. u[i ] = u[i >> 1] << 1;
  351. u[i + 1] = u[i ] ^ y;
  352. }
  353. uint j = (uint)x;
  354. ulong g, h = 0, l = u[j & 15]
  355. ^ u[(j >> 4) & 15] << 4;
  356. int k = 56;
  357. do
  358. {
  359. j = (uint)(x >> k);
  360. g = u[j & 15]
  361. ^ u[(j >> 4) & 15] << 4;
  362. l ^= (g << k);
  363. h ^= (g >> -k);
  364. }
  365. while ((k -= 8) > 0);
  366. for (int p = 0; p < 7; ++p)
  367. {
  368. x = (x & 0xFEFEFEFEFEFEFEFEUL) >> 1;
  369. h ^= x & (ulong)((long)(y << p) >> 63);
  370. }
  371. Debug.Assert(h >> 63 == 0);
  372. z[zOff ] ^= l;
  373. z[zOff + 1] ^= h;
  374. }
  375. protected static void ImplSquare(ulong[] x, ulong[] zz)
  376. {
  377. Interleave.Expand64To128(x, 0, 9, zz, 0);
  378. }
  379. }
  380. }
  381. #pragma warning restore
  382. #endif