SecP384R1Field.cs 10 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364
  1. #if !BESTHTTP_DISABLE_ALTERNATE_SSL && (!UNITY_WEBGL || UNITY_EDITOR)
  2. #pragma warning disable
  3. using System;
  4. using System.Diagnostics;
  5. using Best.HTTP.SecureProtocol.Org.BouncyCastle.Crypto.Utilities;
  6. using Best.HTTP.SecureProtocol.Org.BouncyCastle.Math.Raw;
  7. using Best.HTTP.SecureProtocol.Org.BouncyCastle.Security;
  8. namespace Best.HTTP.SecureProtocol.Org.BouncyCastle.Math.EC.Custom.Sec
  9. {
  10. internal class SecP384R1Field
  11. {
  12. // 2^384 - 2^128 - 2^96 + 2^32 - 1
  13. internal static readonly uint[] P = new uint[]{ 0xFFFFFFFF, 0x00000000, 0x00000000, 0xFFFFFFFF, 0xFFFFFFFE,
  14. 0xFFFFFFFF, 0xFFFFFFFF, 0xFFFFFFFF, 0xFFFFFFFF, 0xFFFFFFFF, 0xFFFFFFFF, 0xFFFFFFFF };
  15. private static readonly uint[] PExt = new uint[]{ 0x00000001, 0xFFFFFFFE, 0x00000000, 0x00000002, 0x00000000,
  16. 0xFFFFFFFE, 0x00000000, 0x00000002, 0x00000001, 0x00000000, 0x00000000, 0x00000000, 0xFFFFFFFE, 0x00000001,
  17. 0x00000000, 0xFFFFFFFE, 0xFFFFFFFD, 0xFFFFFFFF, 0xFFFFFFFF, 0xFFFFFFFF, 0xFFFFFFFF, 0xFFFFFFFF, 0xFFFFFFFF,
  18. 0xFFFFFFFF };
  19. private static readonly uint[] PExtInv = new uint[]{ 0xFFFFFFFF, 0x00000001, 0xFFFFFFFF, 0xFFFFFFFD,
  20. 0xFFFFFFFF, 0x00000001, 0xFFFFFFFF, 0xFFFFFFFD, 0xFFFFFFFE, 0xFFFFFFFF, 0xFFFFFFFF, 0xFFFFFFFF, 0x00000001,
  21. 0xFFFFFFFE, 0xFFFFFFFF, 0x00000001, 0x00000002 };
  22. private const uint P11 = 0xFFFFFFFF;
  23. private const uint PExt23 = 0xFFFFFFFF;
  24. public static void Add(uint[] x, uint[] y, uint[] z)
  25. {
  26. uint c = Nat.Add(12, x, y, z);
  27. if (c != 0 || (z[11] == P11 && Nat.Gte(12, z, P)))
  28. {
  29. AddPInvTo(z);
  30. }
  31. }
  32. public static void AddExt(uint[] xx, uint[] yy, uint[] zz)
  33. {
  34. uint c = Nat.Add(24, xx, yy, zz);
  35. if (c != 0 || (zz[23] == PExt23 && Nat.Gte(24, zz, PExt)))
  36. {
  37. if (Nat.AddTo(PExtInv.Length, PExtInv, zz) != 0)
  38. {
  39. Nat.IncAt(24, zz, PExtInv.Length);
  40. }
  41. }
  42. }
  43. public static void AddOne(uint[] x, uint[] z)
  44. {
  45. uint c = Nat.Inc(12, x, z);
  46. if (c != 0 || (z[11] == P11 && Nat.Gte(12, z, P)))
  47. {
  48. AddPInvTo(z);
  49. }
  50. }
  51. public static uint[] FromBigInteger(BigInteger x)
  52. {
  53. uint[] z = Nat.FromBigInteger(384, x);
  54. if (z[11] == P11 && Nat.Gte(12, z, P))
  55. {
  56. Nat.SubFrom(12, P, z);
  57. }
  58. return z;
  59. }
  60. public static void Half(uint[] x, uint[] z)
  61. {
  62. if ((x[0] & 1) == 0)
  63. {
  64. Nat.ShiftDownBit(12, x, 0, z);
  65. }
  66. else
  67. {
  68. uint c = Nat.Add(12, x, P, z);
  69. Nat.ShiftDownBit(12, z, c);
  70. }
  71. }
  72. public static void Inv(uint[] x, uint[] z)
  73. {
  74. Mod.CheckedModOddInverse(P, x, z);
  75. }
  76. public static int IsZero(uint[] x)
  77. {
  78. uint d = 0;
  79. for (int i = 0; i < 12; ++i)
  80. {
  81. d |= x[i];
  82. }
  83. d = (d >> 1) | (d & 1);
  84. return ((int)d - 1) >> 31;
  85. }
  86. public static void Multiply(uint[] x, uint[] y, uint[] z)
  87. {
  88. uint[] tt = Nat.Create(24);
  89. Nat384.Mul(x, y, tt);
  90. Reduce(tt, z);
  91. }
  92. public static void Multiply(uint[] x, uint[] y, uint[] z, uint[] tt)
  93. {
  94. Nat384.Mul(x, y, tt);
  95. Reduce(tt, z);
  96. }
  97. public static void Negate(uint[] x, uint[] z)
  98. {
  99. if (0 != IsZero(x))
  100. {
  101. Nat.Sub(12, P, P, z);
  102. }
  103. else
  104. {
  105. Nat.Sub(12, P, x, z);
  106. }
  107. }
  108. public static void Random(SecureRandom r, uint[] z)
  109. {
  110. byte[] bb = new byte[12 * 4];
  111. do
  112. {
  113. r.NextBytes(bb);
  114. Pack.LE_To_UInt32(bb, 0, z, 0, 12);
  115. }
  116. while (0 == Nat.LessThan(12, z, P));
  117. }
  118. public static void RandomMult(SecureRandom r, uint[] z)
  119. {
  120. do
  121. {
  122. Random(r, z);
  123. }
  124. while (0 != IsZero(z));
  125. }
  126. public static void Reduce(uint[] xx, uint[] z)
  127. {
  128. long xx16 = xx[16], xx17 = xx[17], xx18 = xx[18], xx19 = xx[19];
  129. long xx20 = xx[20], xx21 = xx[21], xx22 = xx[22], xx23 = xx[23];
  130. const long n = 1;
  131. long t0 = (long)xx[12] + xx20 - n;
  132. long t1 = (long)xx[13] + xx22;
  133. long t2 = (long)xx[14] + xx22 + xx23;
  134. long t3 = (long)xx[15] + xx23;
  135. long t4 = xx17 + xx21;
  136. long t5 = xx21 - xx23;
  137. long t6 = xx22 - xx23;
  138. long t7 = t0 + t5;
  139. long cc = 0;
  140. cc += (long)xx[0] + t7;
  141. z[0] = (uint)cc;
  142. cc >>= 32;
  143. cc += (long)xx[1] + xx23 - t0 + t1;
  144. z[1] = (uint)cc;
  145. cc >>= 32;
  146. cc += (long)xx[2] - xx21 - t1 + t2;
  147. z[2] = (uint)cc;
  148. cc >>= 32;
  149. cc += (long)xx[3] - t2 + t3 + t7;
  150. z[3] = (uint)cc;
  151. cc >>= 32;
  152. cc += (long)xx[4] + xx16 + xx21 + t1 - t3 + t7;
  153. z[4] = (uint)cc;
  154. cc >>= 32;
  155. cc += (long)xx[5] - xx16 + t1 + t2 + t4;
  156. z[5] = (uint)cc;
  157. cc >>= 32;
  158. cc += (long)xx[6] + xx18 - xx17 + t2 + t3;
  159. z[6] = (uint)cc;
  160. cc >>= 32;
  161. cc += (long)xx[7] + xx16 + xx19 - xx18 + t3;
  162. z[7] = (uint)cc;
  163. cc >>= 32;
  164. cc += (long)xx[8] + xx16 + xx17 + xx20 - xx19;
  165. z[8] = (uint)cc;
  166. cc >>= 32;
  167. cc += (long)xx[9] + xx18 - xx20 + t4;
  168. z[9] = (uint)cc;
  169. cc >>= 32;
  170. cc += (long)xx[10] + xx18 + xx19 - t5 + t6;
  171. z[10] = (uint)cc;
  172. cc >>= 32;
  173. cc += (long)xx[11] + xx19 + xx20 - t6;
  174. z[11] = (uint)cc;
  175. cc >>= 32;
  176. cc += n;
  177. Debug.Assert(cc >= 0);
  178. Reduce32((uint)cc, z);
  179. }
  180. public static void Reduce32(uint x, uint[] z)
  181. {
  182. long cc = 0;
  183. if (x != 0)
  184. {
  185. long xx12 = x;
  186. cc += (long)z[0] + xx12;
  187. z[0] = (uint)cc;
  188. cc >>= 32;
  189. cc += (long)z[1] - xx12;
  190. z[1] = (uint)cc;
  191. cc >>= 32;
  192. if (cc != 0)
  193. {
  194. cc += (long)z[2];
  195. z[2] = (uint)cc;
  196. cc >>= 32;
  197. }
  198. cc += (long)z[3] + xx12;
  199. z[3] = (uint)cc;
  200. cc >>= 32;
  201. cc += (long)z[4] + xx12;
  202. z[4] = (uint)cc;
  203. cc >>= 32;
  204. Debug.Assert(cc == 0 || cc == 1);
  205. }
  206. if ((cc != 0 && Nat.IncAt(12, z, 5) != 0)
  207. || (z[11] == P11 && Nat.Gte(12, z, P)))
  208. {
  209. AddPInvTo(z);
  210. }
  211. }
  212. public static void Square(uint[] x, uint[] z)
  213. {
  214. uint[] tt = Nat.Create(24);
  215. Nat384.Square(x, tt);
  216. Reduce(tt, z);
  217. }
  218. public static void Square(uint[] x, uint[] z, uint[] tt)
  219. {
  220. Nat384.Square(x, tt);
  221. Reduce(tt, z);
  222. }
  223. public static void SquareN(uint[] x, int n, uint[] z)
  224. {
  225. Debug.Assert(n > 0);
  226. uint[] tt = Nat.Create(24);
  227. Nat384.Square(x, tt);
  228. Reduce(tt, z);
  229. while (--n > 0)
  230. {
  231. Nat384.Square(z, tt);
  232. Reduce(tt, z);
  233. }
  234. }
  235. public static void SquareN(uint[] x, int n, uint[] z, uint[] tt)
  236. {
  237. Debug.Assert(n > 0);
  238. Nat384.Square(x, tt);
  239. Reduce(tt, z);
  240. while (--n > 0)
  241. {
  242. Nat384.Square(z, tt);
  243. Reduce(tt, z);
  244. }
  245. }
  246. public static void Subtract(uint[] x, uint[] y, uint[] z)
  247. {
  248. int c = Nat.Sub(12, x, y, z);
  249. if (c != 0)
  250. {
  251. SubPInvFrom(z);
  252. }
  253. }
  254. public static void SubtractExt(uint[] xx, uint[] yy, uint[] zz)
  255. {
  256. int c = Nat.Sub(24, xx, yy, zz);
  257. if (c != 0)
  258. {
  259. if (Nat.SubFrom(PExtInv.Length, PExtInv, zz) != 0)
  260. {
  261. Nat.DecAt(24, zz, PExtInv.Length);
  262. }
  263. }
  264. }
  265. public static void Twice(uint[] x, uint[] z)
  266. {
  267. uint c = Nat.ShiftUpBit(12, x, 0, z);
  268. if (c != 0 || (z[11] == P11 && Nat.Gte(12, z, P)))
  269. {
  270. AddPInvTo(z);
  271. }
  272. }
  273. private static void AddPInvTo(uint[] z)
  274. {
  275. long c = (long)z[0] + 1;
  276. z[0] = (uint)c;
  277. c >>= 32;
  278. c += (long)z[1] - 1;
  279. z[1] = (uint)c;
  280. c >>= 32;
  281. if (c != 0)
  282. {
  283. c += (long)z[2];
  284. z[2] = (uint)c;
  285. c >>= 32;
  286. }
  287. c += (long)z[3] + 1;
  288. z[3] = (uint)c;
  289. c >>= 32;
  290. c += (long)z[4] + 1;
  291. z[4] = (uint)c;
  292. c >>= 32;
  293. if (c != 0)
  294. {
  295. Nat.IncAt(12, z, 5);
  296. }
  297. }
  298. private static void SubPInvFrom(uint[] z)
  299. {
  300. long c = (long)z[0] - 1;
  301. z[0] = (uint)c;
  302. c >>= 32;
  303. c += (long)z[1] + 1;
  304. z[1] = (uint)c;
  305. c >>= 32;
  306. if (c != 0)
  307. {
  308. c += (long)z[2];
  309. z[2] = (uint)c;
  310. c >>= 32;
  311. }
  312. c += (long)z[3] - 1;
  313. z[3] = (uint)c;
  314. c >>= 32;
  315. c += (long)z[4] - 1;
  316. z[4] = (uint)c;
  317. c >>= 32;
  318. if (c != 0)
  319. {
  320. Nat.DecAt(12, z, 5);
  321. }
  322. }
  323. }
  324. }
  325. #pragma warning restore
  326. #endif