SecP256R1Field.cs 9.5 KB

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