SecT409Field.cs 9.8 KB

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