SecT409Field.cs 12 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398
  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.Math.Raw;
  6. namespace BestHTTP.SecureProtocol.Org.BouncyCastle.Math.EC.Custom.Sec
  7. {
  8. internal class SecT409Field
  9. {
  10. private const ulong M25 = ulong.MaxValue >> 39;
  11. private const ulong M59 = ulong.MaxValue >> 5;
  12. public static void Add(ulong[] x, ulong[] y, ulong[] z)
  13. {
  14. z[0] = x[0] ^ y[0];
  15. z[1] = x[1] ^ y[1];
  16. z[2] = x[2] ^ y[2];
  17. z[3] = x[3] ^ y[3];
  18. z[4] = x[4] ^ y[4];
  19. z[5] = x[5] ^ y[5];
  20. z[6] = x[6] ^ y[6];
  21. }
  22. public static void AddExt(ulong[] xx, ulong[] yy, ulong[] zz)
  23. {
  24. for (int i = 0; i < 13; ++i)
  25. {
  26. zz[i] = xx[i] ^ yy[i];
  27. }
  28. }
  29. public static void AddOne(ulong[] x, ulong[] z)
  30. {
  31. z[0] = x[0] ^ 1UL;
  32. z[1] = x[1];
  33. z[2] = x[2];
  34. z[3] = x[3];
  35. z[4] = x[4];
  36. z[5] = x[5];
  37. z[6] = x[6];
  38. }
  39. private static void AddTo(ulong[] x, ulong[] z)
  40. {
  41. z[0] ^= x[0];
  42. z[1] ^= x[1];
  43. z[2] ^= x[2];
  44. z[3] ^= x[3];
  45. z[4] ^= x[4];
  46. z[5] ^= x[5];
  47. z[6] ^= x[6];
  48. }
  49. public static ulong[] FromBigInteger(BigInteger x)
  50. {
  51. return Nat.FromBigInteger64(409, x);
  52. }
  53. public static void HalfTrace(ulong[] x, ulong[] z)
  54. {
  55. ulong[] tt = Nat.Create64(13);
  56. Nat448.Copy64(x, z);
  57. for (int i = 1; i < 409; i += 2)
  58. {
  59. ImplSquare(z, tt);
  60. Reduce(tt, z);
  61. ImplSquare(z, tt);
  62. Reduce(tt, z);
  63. AddTo(x, z);
  64. }
  65. }
  66. public static void Invert(ulong[] x, ulong[] z)
  67. {
  68. if (Nat448.IsZero64(x))
  69. throw new InvalidOperationException();
  70. // Itoh-Tsujii inversion with bases { 2, 3 }
  71. ulong[] t0 = Nat448.Create64();
  72. ulong[] t1 = Nat448.Create64();
  73. ulong[] t2 = Nat448.Create64();
  74. Square(x, t0);
  75. // 3 | 408
  76. SquareN(t0, 1, t1);
  77. Multiply(t0, t1, t0);
  78. SquareN(t1, 1, t1);
  79. Multiply(t0, t1, t0);
  80. // 2 | 136
  81. SquareN(t0, 3, t1);
  82. Multiply(t0, t1, t0);
  83. // 2 | 68
  84. SquareN(t0, 6, t1);
  85. Multiply(t0, t1, t0);
  86. // 2 | 34
  87. SquareN(t0, 12, t1);
  88. Multiply(t0, t1, t2);
  89. // ! {2,3} | 17
  90. SquareN(t2, 24, t0);
  91. SquareN(t0, 24, t1);
  92. Multiply(t0, t1, t0);
  93. // 2 | 8
  94. SquareN(t0, 48, t1);
  95. Multiply(t0, t1, t0);
  96. // 2 | 4
  97. SquareN(t0, 96, t1);
  98. Multiply(t0, t1, t0);
  99. // 2 | 2
  100. SquareN(t0, 192, t1);
  101. Multiply(t0, t1, t0);
  102. Multiply(t0, t2, z);
  103. }
  104. public static void Multiply(ulong[] x, ulong[] y, ulong[] z)
  105. {
  106. ulong[] tt = Nat448.CreateExt64();
  107. ImplMultiply(x, y, tt);
  108. Reduce(tt, z);
  109. }
  110. public static void MultiplyAddToExt(ulong[] x, ulong[] y, ulong[] zz)
  111. {
  112. ulong[] tt = Nat448.CreateExt64();
  113. ImplMultiply(x, y, tt);
  114. AddExt(zz, tt, zz);
  115. }
  116. public static void Reduce(ulong[] xx, ulong[] z)
  117. {
  118. ulong x00 = xx[0], x01 = xx[1], x02 = xx[2], x03 = xx[3];
  119. ulong x04 = xx[4], x05 = xx[5], x06 = xx[6], x07 = xx[7];
  120. ulong u = xx[12];
  121. x05 ^= (u << 39);
  122. x06 ^= (u >> 25) ^ (u << 62);
  123. x07 ^= (u >> 2);
  124. u = xx[11];
  125. x04 ^= (u << 39);
  126. x05 ^= (u >> 25) ^ (u << 62);
  127. x06 ^= (u >> 2);
  128. u = xx[10];
  129. x03 ^= (u << 39);
  130. x04 ^= (u >> 25) ^ (u << 62);
  131. x05 ^= (u >> 2);
  132. u = xx[9];
  133. x02 ^= (u << 39);
  134. x03 ^= (u >> 25) ^ (u << 62);
  135. x04 ^= (u >> 2);
  136. u = xx[8];
  137. x01 ^= (u << 39);
  138. x02 ^= (u >> 25) ^ (u << 62);
  139. x03 ^= (u >> 2);
  140. u = x07;
  141. x00 ^= (u << 39);
  142. x01 ^= (u >> 25) ^ (u << 62);
  143. x02 ^= (u >> 2);
  144. ulong t = x06 >> 25;
  145. z[0] = x00 ^ t;
  146. z[1] = x01 ^ (t << 23);
  147. z[2] = x02;
  148. z[3] = x03;
  149. z[4] = x04;
  150. z[5] = x05;
  151. z[6] = x06 & M25;
  152. }
  153. public static void Reduce39(ulong[] z, int zOff)
  154. {
  155. ulong z6 = z[zOff + 6], t = z6 >> 25;
  156. z[zOff ] ^= t;
  157. z[zOff + 1] ^= (t << 23);
  158. z[zOff + 6] = z6 & M25;
  159. }
  160. public static void Sqrt(ulong[] x, ulong[] z)
  161. {
  162. ulong u0, u1;
  163. u0 = Interleave.Unshuffle(x[0]); u1 = Interleave.Unshuffle(x[1]);
  164. ulong e0 = (u0 & 0x00000000FFFFFFFFUL) | (u1 << 32);
  165. ulong c0 = (u0 >> 32) | (u1 & 0xFFFFFFFF00000000UL);
  166. u0 = Interleave.Unshuffle(x[2]); u1 = Interleave.Unshuffle(x[3]);
  167. ulong e1 = (u0 & 0x00000000FFFFFFFFUL) | (u1 << 32);
  168. ulong c1 = (u0 >> 32) | (u1 & 0xFFFFFFFF00000000UL);
  169. u0 = Interleave.Unshuffle(x[4]); u1 = Interleave.Unshuffle(x[5]);
  170. ulong e2 = (u0 & 0x00000000FFFFFFFFUL) | (u1 << 32);
  171. ulong c2 = (u0 >> 32) | (u1 & 0xFFFFFFFF00000000UL);
  172. u0 = Interleave.Unshuffle(x[6]);
  173. ulong e3 = (u0 & 0x00000000FFFFFFFFUL);
  174. ulong c3 = (u0 >> 32);
  175. z[0] = e0 ^ (c0 << 44);
  176. z[1] = e1 ^ (c1 << 44) ^ (c0 >> 20);
  177. z[2] = e2 ^ (c2 << 44) ^ (c1 >> 20);
  178. z[3] = e3 ^ (c3 << 44) ^ (c2 >> 20) ^ (c0 << 13);
  179. z[4] = (c3 >> 20) ^ (c1 << 13) ^ (c0 >> 51);
  180. z[5] = (c2 << 13) ^ (c1 >> 51);
  181. z[6] = (c3 << 13) ^ (c2 >> 51);
  182. Debug.Assert((c3 >> 51) == 0);
  183. }
  184. public static void Square(ulong[] x, ulong[] z)
  185. {
  186. ulong[] tt = Nat.Create64(13);
  187. ImplSquare(x, tt);
  188. Reduce(tt, z);
  189. }
  190. public static void SquareAddToExt(ulong[] x, ulong[] zz)
  191. {
  192. ulong[] tt = Nat.Create64(13);
  193. ImplSquare(x, tt);
  194. AddExt(zz, tt, zz);
  195. }
  196. public static void SquareN(ulong[] x, int n, ulong[] z)
  197. {
  198. Debug.Assert(n > 0);
  199. ulong[] tt = Nat.Create64(13);
  200. ImplSquare(x, tt);
  201. Reduce(tt, z);
  202. while (--n > 0)
  203. {
  204. ImplSquare(z, tt);
  205. Reduce(tt, z);
  206. }
  207. }
  208. public static uint Trace(ulong[] x)
  209. {
  210. // Non-zero-trace bits: 0
  211. return (uint)(x[0]) & 1U;
  212. }
  213. protected static void ImplCompactExt(ulong[] zz)
  214. {
  215. ulong z00 = zz[ 0], z01 = zz[ 1], z02 = zz[ 2], z03 = zz[ 3], z04 = zz[ 4], z05 = zz[ 5], z06 = zz[ 6];
  216. ulong z07 = zz[ 7], z08 = zz[ 8], z09 = zz[ 9], z10 = zz[10], z11 = zz[11], z12 = zz[12], z13 = zz[13];
  217. zz[ 0] = z00 ^ (z01 << 59);
  218. zz[ 1] = (z01 >> 5) ^ (z02 << 54);
  219. zz[ 2] = (z02 >> 10) ^ (z03 << 49);
  220. zz[ 3] = (z03 >> 15) ^ (z04 << 44);
  221. zz[ 4] = (z04 >> 20) ^ (z05 << 39);
  222. zz[ 5] = (z05 >> 25) ^ (z06 << 34);
  223. zz[ 6] = (z06 >> 30) ^ (z07 << 29);
  224. zz[ 7] = (z07 >> 35) ^ (z08 << 24);
  225. zz[ 8] = (z08 >> 40) ^ (z09 << 19);
  226. zz[ 9] = (z09 >> 45) ^ (z10 << 14);
  227. zz[10] = (z10 >> 50) ^ (z11 << 9);
  228. zz[11] = (z11 >> 55) ^ (z12 << 4)
  229. ^ (z13 << 63);
  230. zz[12] = (z13 >> 1);
  231. //zz[13] = 0;
  232. }
  233. protected static void ImplExpand(ulong[] x, ulong[] z)
  234. {
  235. ulong x0 = x[0], x1 = x[1], x2 = x[2], x3 = x[3], x4 = x[4], x5 = x[5], x6 = x[6];
  236. z[0] = x0 & M59;
  237. z[1] = ((x0 >> 59) ^ (x1 << 5)) & M59;
  238. z[2] = ((x1 >> 54) ^ (x2 << 10)) & M59;
  239. z[3] = ((x2 >> 49) ^ (x3 << 15)) & M59;
  240. z[4] = ((x3 >> 44) ^ (x4 << 20)) & M59;
  241. z[5] = ((x4 >> 39) ^ (x5 << 25)) & M59;
  242. z[6] = ((x5 >> 34) ^ (x6 << 30));
  243. }
  244. protected static void ImplMultiply(ulong[] x, ulong[] y, ulong[] zz)
  245. {
  246. ulong[] a = new ulong[7], b = new ulong[7];
  247. ImplExpand(x, a);
  248. ImplExpand(y, b);
  249. ulong[] u = new ulong[8];
  250. for (int i = 0; i < 7; ++i)
  251. {
  252. ImplMulwAcc(u, a[i], b[i], zz, i << 1);
  253. }
  254. ulong v0 = zz[0], v1 = zz[1];
  255. v0 ^= zz[ 2]; zz[1] = v0 ^ v1; v1 ^= zz[ 3];
  256. v0 ^= zz[ 4]; zz[2] = v0 ^ v1; v1 ^= zz[ 5];
  257. v0 ^= zz[ 6]; zz[3] = v0 ^ v1; v1 ^= zz[ 7];
  258. v0 ^= zz[ 8]; zz[4] = v0 ^ v1; v1 ^= zz[ 9];
  259. v0 ^= zz[10]; zz[5] = v0 ^ v1; v1 ^= zz[11];
  260. v0 ^= zz[12]; zz[6] = v0 ^ v1; v1 ^= zz[13];
  261. ulong w = v0 ^ v1;
  262. zz[ 7] = zz[0] ^ w;
  263. zz[ 8] = zz[1] ^ w;
  264. zz[ 9] = zz[2] ^ w;
  265. zz[10] = zz[3] ^ w;
  266. zz[11] = zz[4] ^ w;
  267. zz[12] = zz[5] ^ w;
  268. zz[13] = zz[6] ^ w;
  269. ImplMulwAcc(u, a[0] ^ a[1], b[0] ^ b[1], zz, 1);
  270. ImplMulwAcc(u, a[0] ^ a[2], b[0] ^ b[2], zz, 2);
  271. ImplMulwAcc(u, a[0] ^ a[3], b[0] ^ b[3], zz, 3);
  272. ImplMulwAcc(u, a[1] ^ a[2], b[1] ^ b[2], zz, 3);
  273. ImplMulwAcc(u, a[0] ^ a[4], b[0] ^ b[4], zz, 4);
  274. ImplMulwAcc(u, a[1] ^ a[3], b[1] ^ b[3], zz, 4);
  275. ImplMulwAcc(u, a[0] ^ a[5], b[0] ^ b[5], zz, 5);
  276. ImplMulwAcc(u, a[1] ^ a[4], b[1] ^ b[4], zz, 5);
  277. ImplMulwAcc(u, a[2] ^ a[3], b[2] ^ b[3], zz, 5);
  278. ImplMulwAcc(u, a[0] ^ a[6], b[0] ^ b[6], zz, 6);
  279. ImplMulwAcc(u, a[1] ^ a[5], b[1] ^ b[5], zz, 6);
  280. ImplMulwAcc(u, a[2] ^ a[4], b[2] ^ b[4], zz, 6);
  281. ImplMulwAcc(u, a[1] ^ a[6], b[1] ^ b[6], zz, 7);
  282. ImplMulwAcc(u, a[2] ^ a[5], b[2] ^ b[5], zz, 7);
  283. ImplMulwAcc(u, a[3] ^ a[4], b[3] ^ b[4], zz, 7);
  284. ImplMulwAcc(u, a[2] ^ a[6], b[2] ^ b[6], zz, 8);
  285. ImplMulwAcc(u, a[3] ^ a[5], b[3] ^ b[5], zz, 8);
  286. ImplMulwAcc(u, a[3] ^ a[6], b[3] ^ b[6], zz, 9);
  287. ImplMulwAcc(u, a[4] ^ a[5], b[4] ^ b[5], zz, 9);
  288. ImplMulwAcc(u, a[4] ^ a[6], b[4] ^ b[6], zz, 10);
  289. ImplMulwAcc(u, a[5] ^ a[6], b[5] ^ b[6], zz, 11);
  290. ImplCompactExt(zz);
  291. }
  292. protected static void ImplMulwAcc(ulong[] u, ulong x, ulong y, ulong[] z, int zOff)
  293. {
  294. Debug.Assert(x >> 59 == 0);
  295. Debug.Assert(y >> 59 == 0);
  296. //u[0] = 0;
  297. u[1] = y;
  298. u[2] = u[1] << 1;
  299. u[3] = u[2] ^ y;
  300. u[4] = u[2] << 1;
  301. u[5] = u[4] ^ y;
  302. u[6] = u[3] << 1;
  303. u[7] = u[6] ^ y;
  304. uint j = (uint)x;
  305. ulong g, h = 0, l = u[j & 7]
  306. ^ (u[(j >> 3) & 7] << 3);
  307. int k = 54;
  308. do
  309. {
  310. j = (uint)(x >> k);
  311. g = u[j & 7]
  312. ^ u[(j >> 3) & 7] << 3;
  313. l ^= (g << k);
  314. h ^= (g >> -k);
  315. }
  316. while ((k -= 6) > 0);
  317. Debug.Assert(h >> 53 == 0);
  318. z[zOff ] ^= l & M59;
  319. z[zOff + 1] ^= (l >> 59) ^ (h << 5);
  320. }
  321. protected static void ImplSquare(ulong[] x, ulong[] zz)
  322. {
  323. Interleave.Expand64To128(x, 0, 6, zz, 0);
  324. zz[12] = Interleave.Expand32to64((uint)x[6]);
  325. }
  326. }
  327. }
  328. #pragma warning restore
  329. #endif