SecP384R1Field.cs 8.6 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299
  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 SecP384R1Field
  9. {
  10. // 2^384 - 2^128 - 2^96 + 2^32 - 1
  11. internal static readonly uint[] P = new uint[]{ 0xFFFFFFFF, 0x00000000, 0x00000000, 0xFFFFFFFF, 0xFFFFFFFE, 0xFFFFFFFF,
  12. 0xFFFFFFFF, 0xFFFFFFFF, 0xFFFFFFFF, 0xFFFFFFFF, 0xFFFFFFFF, 0xFFFFFFFF };
  13. internal static readonly uint[] PExt = new uint[]{ 0x00000001, 0xFFFFFFFE, 0x00000000, 0x00000002, 0x00000000, 0xFFFFFFFE,
  14. 0x00000000, 0x00000002, 0x00000001, 0x00000000, 0x00000000, 0x00000000, 0xFFFFFFFE, 0x00000001, 0x00000000,
  15. 0xFFFFFFFE, 0xFFFFFFFD, 0xFFFFFFFF, 0xFFFFFFFF, 0xFFFFFFFF, 0xFFFFFFFF, 0xFFFFFFFF, 0xFFFFFFFF, 0xFFFFFFFF };
  16. private static readonly uint[] PExtInv = new uint[]{ 0xFFFFFFFF, 0x00000001, 0xFFFFFFFF, 0xFFFFFFFD, 0xFFFFFFFF, 0x00000001,
  17. 0xFFFFFFFF, 0xFFFFFFFD, 0xFFFFFFFE, 0xFFFFFFFF, 0xFFFFFFFF, 0xFFFFFFFF, 0x00000001, 0xFFFFFFFE, 0xFFFFFFFF,
  18. 0x00000001, 0x00000002 };
  19. private const uint P11 = 0xFFFFFFFF;
  20. private const uint PExt23 = 0xFFFFFFFF;
  21. public static void Add(uint[] x, uint[] y, uint[] z)
  22. {
  23. uint c = Nat.Add(12, x, y, z);
  24. if (c != 0 || (z[11] == P11 && Nat.Gte(12, z, P)))
  25. {
  26. AddPInvTo(z);
  27. }
  28. }
  29. public static void AddExt(uint[] xx, uint[] yy, uint[] zz)
  30. {
  31. uint c = Nat.Add(24, xx, yy, zz);
  32. if (c != 0 || (zz[23] == PExt23 && Nat.Gte(24, zz, PExt)))
  33. {
  34. if (Nat.AddTo(PExtInv.Length, PExtInv, zz) != 0)
  35. {
  36. Nat.IncAt(24, zz, PExtInv.Length);
  37. }
  38. }
  39. }
  40. public static void AddOne(uint[] x, uint[] z)
  41. {
  42. uint c = Nat.Inc(12, x, z);
  43. if (c != 0 || (z[11] == P11 && Nat.Gte(12, z, P)))
  44. {
  45. AddPInvTo(z);
  46. }
  47. }
  48. public static uint[] FromBigInteger(BigInteger x)
  49. {
  50. uint[] z = Nat.FromBigInteger(384, x);
  51. if (z[11] == P11 && Nat.Gte(12, z, P))
  52. {
  53. Nat.SubFrom(12, P, z);
  54. }
  55. return z;
  56. }
  57. public static void Half(uint[] x, uint[] z)
  58. {
  59. if ((x[0] & 1) == 0)
  60. {
  61. Nat.ShiftDownBit(12, x, 0, z);
  62. }
  63. else
  64. {
  65. uint c = Nat.Add(12, x, P, z);
  66. Nat.ShiftDownBit(12, z, c);
  67. }
  68. }
  69. public static void Multiply(uint[] x, uint[] y, uint[] z)
  70. {
  71. uint[] tt = Nat.Create(24);
  72. Nat384.Mul(x, y, tt);
  73. Reduce(tt, z);
  74. }
  75. public static void Negate(uint[] x, uint[] z)
  76. {
  77. if (Nat.IsZero(12, x))
  78. {
  79. Nat.Zero(12, z);
  80. }
  81. else
  82. {
  83. Nat.Sub(12, P, x, z);
  84. }
  85. }
  86. public static void Reduce(uint[] xx, uint[] z)
  87. {
  88. long xx16 = xx[16], xx17 = xx[17], xx18 = xx[18], xx19 = xx[19];
  89. long xx20 = xx[20], xx21 = xx[21], xx22 = xx[22], xx23 = xx[23];
  90. const long n = 1;
  91. long t0 = (long)xx[12] + xx20 - n;
  92. long t1 = (long)xx[13] + xx22;
  93. long t2 = (long)xx[14] + xx22 + xx23;
  94. long t3 = (long)xx[15] + xx23;
  95. long t4 = xx17 + xx21;
  96. long t5 = xx21 - xx23;
  97. long t6 = xx22 - xx23;
  98. long t7 = t0 + t5;
  99. long cc = 0;
  100. cc += (long)xx[0] + t7;
  101. z[0] = (uint)cc;
  102. cc >>= 32;
  103. cc += (long)xx[1] + xx23 - t0 + t1;
  104. z[1] = (uint)cc;
  105. cc >>= 32;
  106. cc += (long)xx[2] - xx21 - t1 + t2;
  107. z[2] = (uint)cc;
  108. cc >>= 32;
  109. cc += (long)xx[3] - t2 + t3 + t7;
  110. z[3] = (uint)cc;
  111. cc >>= 32;
  112. cc += (long)xx[4] + xx16 + xx21 + t1 - t3 + t7;
  113. z[4] = (uint)cc;
  114. cc >>= 32;
  115. cc += (long)xx[5] - xx16 + t1 + t2 + t4;
  116. z[5] = (uint)cc;
  117. cc >>= 32;
  118. cc += (long)xx[6] + xx18 - xx17 + t2 + t3;
  119. z[6] = (uint)cc;
  120. cc >>= 32;
  121. cc += (long)xx[7] + xx16 + xx19 - xx18 + t3;
  122. z[7] = (uint)cc;
  123. cc >>= 32;
  124. cc += (long)xx[8] + xx16 + xx17 + xx20 - xx19;
  125. z[8] = (uint)cc;
  126. cc >>= 32;
  127. cc += (long)xx[9] + xx18 - xx20 + t4;
  128. z[9] = (uint)cc;
  129. cc >>= 32;
  130. cc += (long)xx[10] + xx18 + xx19 - t5 + t6;
  131. z[10] = (uint)cc;
  132. cc >>= 32;
  133. cc += (long)xx[11] + xx19 + xx20 - t6;
  134. z[11] = (uint)cc;
  135. cc >>= 32;
  136. cc += n;
  137. Debug.Assert(cc >= 0);
  138. Reduce32((uint)cc, z);
  139. }
  140. public static void Reduce32(uint x, uint[] z)
  141. {
  142. long cc = 0;
  143. if (x != 0)
  144. {
  145. long xx12 = x;
  146. cc += (long)z[0] + xx12;
  147. z[0] = (uint)cc;
  148. cc >>= 32;
  149. cc += (long)z[1] - xx12;
  150. z[1] = (uint)cc;
  151. cc >>= 32;
  152. if (cc != 0)
  153. {
  154. cc += (long)z[2];
  155. z[2] = (uint)cc;
  156. cc >>= 32;
  157. }
  158. cc += (long)z[3] + xx12;
  159. z[3] = (uint)cc;
  160. cc >>= 32;
  161. cc += (long)z[4] + xx12;
  162. z[4] = (uint)cc;
  163. cc >>= 32;
  164. Debug.Assert(cc == 0 || cc == 1);
  165. }
  166. if ((cc != 0 && Nat.IncAt(12, z, 5) != 0)
  167. || (z[11] == P11 && Nat.Gte(12, z, P)))
  168. {
  169. AddPInvTo(z);
  170. }
  171. }
  172. public static void Square(uint[] x, uint[] z)
  173. {
  174. uint[] tt = Nat.Create(24);
  175. Nat384.Square(x, tt);
  176. Reduce(tt, z);
  177. }
  178. public static void SquareN(uint[] x, int n, uint[] z)
  179. {
  180. Debug.Assert(n > 0);
  181. uint[] tt = Nat.Create(24);
  182. Nat384.Square(x, tt);
  183. Reduce(tt, z);
  184. while (--n > 0)
  185. {
  186. Nat384.Square(z, tt);
  187. Reduce(tt, z);
  188. }
  189. }
  190. public static void Subtract(uint[] x, uint[] y, uint[] z)
  191. {
  192. int c = Nat.Sub(12, x, y, z);
  193. if (c != 0)
  194. {
  195. SubPInvFrom(z);
  196. }
  197. }
  198. public static void SubtractExt(uint[] xx, uint[] yy, uint[] zz)
  199. {
  200. int c = Nat.Sub(24, xx, yy, zz);
  201. if (c != 0)
  202. {
  203. if (Nat.SubFrom(PExtInv.Length, PExtInv, zz) != 0)
  204. {
  205. Nat.DecAt(24, zz, PExtInv.Length);
  206. }
  207. }
  208. }
  209. public static void Twice(uint[] x, uint[] z)
  210. {
  211. uint c = Nat.ShiftUpBit(12, x, 0, z);
  212. if (c != 0 || (z[11] == P11 && Nat.Gte(12, z, P)))
  213. {
  214. AddPInvTo(z);
  215. }
  216. }
  217. private static void AddPInvTo(uint[] z)
  218. {
  219. long c = (long)z[0] + 1;
  220. z[0] = (uint)c;
  221. c >>= 32;
  222. c += (long)z[1] - 1;
  223. z[1] = (uint)c;
  224. c >>= 32;
  225. if (c != 0)
  226. {
  227. c += (long)z[2];
  228. z[2] = (uint)c;
  229. c >>= 32;
  230. }
  231. c += (long)z[3] + 1;
  232. z[3] = (uint)c;
  233. c >>= 32;
  234. c += (long)z[4] + 1;
  235. z[4] = (uint)c;
  236. c >>= 32;
  237. if (c != 0)
  238. {
  239. Nat.IncAt(12, z, 5);
  240. }
  241. }
  242. private static void SubPInvFrom(uint[] z)
  243. {
  244. long c = (long)z[0] - 1;
  245. z[0] = (uint)c;
  246. c >>= 32;
  247. c += (long)z[1] + 1;
  248. z[1] = (uint)c;
  249. c >>= 32;
  250. if (c != 0)
  251. {
  252. c += (long)z[2];
  253. z[2] = (uint)c;
  254. c >>= 32;
  255. }
  256. c += (long)z[3] - 1;
  257. z[3] = (uint)c;
  258. c >>= 32;
  259. c += (long)z[4] - 1;
  260. z[4] = (uint)c;
  261. c >>= 32;
  262. if (c != 0)
  263. {
  264. Nat.DecAt(12, z, 5);
  265. }
  266. }
  267. }
  268. }
  269. #pragma warning restore
  270. #endif