sshdh.c 7.8 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253
  1. /*
  2. * Diffie-Hellman implementation for PuTTY.
  3. */
  4. #include "ssh.h"
  5. /*
  6. * The primes used in the group1 and group14 key exchange.
  7. */
  8. static const unsigned char P1[] = {
  9. 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xC9, 0x0F, 0xDA, 0xA2,
  10. 0x21, 0x68, 0xC2, 0x34, 0xC4, 0xC6, 0x62, 0x8B, 0x80, 0xDC, 0x1C, 0xD1,
  11. 0x29, 0x02, 0x4E, 0x08, 0x8A, 0x67, 0xCC, 0x74, 0x02, 0x0B, 0xBE, 0xA6,
  12. 0x3B, 0x13, 0x9B, 0x22, 0x51, 0x4A, 0x08, 0x79, 0x8E, 0x34, 0x04, 0xDD,
  13. 0xEF, 0x95, 0x19, 0xB3, 0xCD, 0x3A, 0x43, 0x1B, 0x30, 0x2B, 0x0A, 0x6D,
  14. 0xF2, 0x5F, 0x14, 0x37, 0x4F, 0xE1, 0x35, 0x6D, 0x6D, 0x51, 0xC2, 0x45,
  15. 0xE4, 0x85, 0xB5, 0x76, 0x62, 0x5E, 0x7E, 0xC6, 0xF4, 0x4C, 0x42, 0xE9,
  16. 0xA6, 0x37, 0xED, 0x6B, 0x0B, 0xFF, 0x5C, 0xB6, 0xF4, 0x06, 0xB7, 0xED,
  17. 0xEE, 0x38, 0x6B, 0xFB, 0x5A, 0x89, 0x9F, 0xA5, 0xAE, 0x9F, 0x24, 0x11,
  18. 0x7C, 0x4B, 0x1F, 0xE6, 0x49, 0x28, 0x66, 0x51, 0xEC, 0xE6, 0x53, 0x81,
  19. 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF
  20. };
  21. static const unsigned char P14[] = {
  22. 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xC9, 0x0F, 0xDA, 0xA2,
  23. 0x21, 0x68, 0xC2, 0x34, 0xC4, 0xC6, 0x62, 0x8B, 0x80, 0xDC, 0x1C, 0xD1,
  24. 0x29, 0x02, 0x4E, 0x08, 0x8A, 0x67, 0xCC, 0x74, 0x02, 0x0B, 0xBE, 0xA6,
  25. 0x3B, 0x13, 0x9B, 0x22, 0x51, 0x4A, 0x08, 0x79, 0x8E, 0x34, 0x04, 0xDD,
  26. 0xEF, 0x95, 0x19, 0xB3, 0xCD, 0x3A, 0x43, 0x1B, 0x30, 0x2B, 0x0A, 0x6D,
  27. 0xF2, 0x5F, 0x14, 0x37, 0x4F, 0xE1, 0x35, 0x6D, 0x6D, 0x51, 0xC2, 0x45,
  28. 0xE4, 0x85, 0xB5, 0x76, 0x62, 0x5E, 0x7E, 0xC6, 0xF4, 0x4C, 0x42, 0xE9,
  29. 0xA6, 0x37, 0xED, 0x6B, 0x0B, 0xFF, 0x5C, 0xB6, 0xF4, 0x06, 0xB7, 0xED,
  30. 0xEE, 0x38, 0x6B, 0xFB, 0x5A, 0x89, 0x9F, 0xA5, 0xAE, 0x9F, 0x24, 0x11,
  31. 0x7C, 0x4B, 0x1F, 0xE6, 0x49, 0x28, 0x66, 0x51, 0xEC, 0xE4, 0x5B, 0x3D,
  32. 0xC2, 0x00, 0x7C, 0xB8, 0xA1, 0x63, 0xBF, 0x05, 0x98, 0xDA, 0x48, 0x36,
  33. 0x1C, 0x55, 0xD3, 0x9A, 0x69, 0x16, 0x3F, 0xA8, 0xFD, 0x24, 0xCF, 0x5F,
  34. 0x83, 0x65, 0x5D, 0x23, 0xDC, 0xA3, 0xAD, 0x96, 0x1C, 0x62, 0xF3, 0x56,
  35. 0x20, 0x85, 0x52, 0xBB, 0x9E, 0xD5, 0x29, 0x07, 0x70, 0x96, 0x96, 0x6D,
  36. 0x67, 0x0C, 0x35, 0x4E, 0x4A, 0xBC, 0x98, 0x04, 0xF1, 0x74, 0x6C, 0x08,
  37. 0xCA, 0x18, 0x21, 0x7C, 0x32, 0x90, 0x5E, 0x46, 0x2E, 0x36, 0xCE, 0x3B,
  38. 0xE3, 0x9E, 0x77, 0x2C, 0x18, 0x0E, 0x86, 0x03, 0x9B, 0x27, 0x83, 0xA2,
  39. 0xEC, 0x07, 0xA2, 0x8F, 0xB5, 0xC5, 0x5D, 0xF0, 0x6F, 0x4C, 0x52, 0xC9,
  40. 0xDE, 0x2B, 0xCB, 0xF6, 0x95, 0x58, 0x17, 0x18, 0x39, 0x95, 0x49, 0x7C,
  41. 0xEA, 0x95, 0x6A, 0xE5, 0x15, 0xD2, 0x26, 0x18, 0x98, 0xFA, 0x05, 0x10,
  42. 0x15, 0x72, 0x8E, 0x5A, 0x8A, 0xAC, 0xAA, 0x68, 0xFF, 0xFF, 0xFF, 0xFF,
  43. 0xFF, 0xFF, 0xFF, 0xFF
  44. };
  45. /*
  46. * The generator g = 2 (used for both group1 and group14).
  47. */
  48. static const unsigned char G[] = { 2 };
  49. static const struct ssh_kex ssh_diffiehellman_group1_sha1 = {
  50. "diffie-hellman-group1-sha1", "group1",
  51. KEXTYPE_DH, P1, G, lenof(P1), lenof(G), &ssh_sha1
  52. };
  53. static const struct ssh_kex *const group1_list[] = {
  54. &ssh_diffiehellman_group1_sha1
  55. };
  56. const struct ssh_kexes ssh_diffiehellman_group1 = {
  57. sizeof(group1_list) / sizeof(*group1_list),
  58. group1_list
  59. };
  60. static const struct ssh_kex ssh_diffiehellman_group14_sha1 = {
  61. "diffie-hellman-group14-sha1", "group14",
  62. KEXTYPE_DH, P14, G, lenof(P14), lenof(G), &ssh_sha1
  63. };
  64. static const struct ssh_kex *const group14_list[] = {
  65. &ssh_diffiehellman_group14_sha1
  66. };
  67. const struct ssh_kexes ssh_diffiehellman_group14 = {
  68. sizeof(group14_list) / sizeof(*group14_list),
  69. group14_list
  70. };
  71. static const struct ssh_kex ssh_diffiehellman_gex_sha256 = {
  72. "diffie-hellman-group-exchange-sha256", NULL,
  73. KEXTYPE_DH, NULL, NULL, 0, 0, &ssh_sha256
  74. };
  75. static const struct ssh_kex ssh_diffiehellman_gex_sha1 = {
  76. "diffie-hellman-group-exchange-sha1", NULL,
  77. KEXTYPE_DH, NULL, NULL, 0, 0, &ssh_sha1
  78. };
  79. static const struct ssh_kex *const gex_list[] = {
  80. &ssh_diffiehellman_gex_sha256,
  81. &ssh_diffiehellman_gex_sha1
  82. };
  83. const struct ssh_kexes ssh_diffiehellman_gex = {
  84. sizeof(gex_list) / sizeof(*gex_list),
  85. gex_list
  86. };
  87. /*
  88. * Variables.
  89. */
  90. struct dh_ctx {
  91. Bignum x, e, p, q, qmask, g;
  92. };
  93. /*
  94. * Common DH initialisation.
  95. */
  96. static void dh_init(struct dh_ctx *ctx)
  97. {
  98. ctx->q = bignum_rshift(ctx->p, 1);
  99. ctx->qmask = bignum_bitmask(ctx->q);
  100. ctx->x = ctx->e = NULL;
  101. }
  102. /*
  103. * Initialise DH for a standard group.
  104. */
  105. void *dh_setup_group(const struct ssh_kex *kex)
  106. {
  107. struct dh_ctx *ctx = snew(struct dh_ctx);
  108. ctx->p = bignum_from_bytes(kex->pdata, kex->plen);
  109. ctx->g = bignum_from_bytes(kex->gdata, kex->glen);
  110. dh_init(ctx);
  111. return ctx;
  112. }
  113. /*
  114. * Initialise DH for a server-supplied group.
  115. */
  116. void *dh_setup_gex(Bignum pval, Bignum gval)
  117. {
  118. struct dh_ctx *ctx = snew(struct dh_ctx);
  119. ctx->p = copybn(pval);
  120. ctx->g = copybn(gval);
  121. dh_init(ctx);
  122. return ctx;
  123. }
  124. /*
  125. * Clean up and free a context.
  126. */
  127. void dh_cleanup(void *handle)
  128. {
  129. struct dh_ctx *ctx = (struct dh_ctx *)handle;
  130. freebn(ctx->x);
  131. freebn(ctx->e);
  132. freebn(ctx->p);
  133. freebn(ctx->g);
  134. freebn(ctx->q);
  135. freebn(ctx->qmask);
  136. sfree(ctx);
  137. }
  138. /*
  139. * DH stage 1: invent a number x between 1 and q, and compute e =
  140. * g^x mod p. Return e.
  141. *
  142. * If `nbits' is greater than zero, it is used as an upper limit
  143. * for the number of bits in x. This is safe provided that (a) you
  144. * use twice as many bits in x as the number of bits you expect to
  145. * use in your session key, and (b) the DH group is a safe prime
  146. * (which SSH demands that it must be).
  147. *
  148. * P. C. van Oorschot, M. J. Wiener
  149. * "On Diffie-Hellman Key Agreement with Short Exponents".
  150. * Advances in Cryptology: Proceedings of Eurocrypt '96
  151. * Springer-Verlag, May 1996.
  152. */
  153. Bignum dh_create_e(void *handle, int nbits)
  154. {
  155. struct dh_ctx *ctx = (struct dh_ctx *)handle;
  156. int i;
  157. int nbytes;
  158. unsigned char *buf;
  159. nbytes = ssh1_bignum_length(ctx->qmask);
  160. buf = snewn(nbytes, unsigned char);
  161. do {
  162. /*
  163. * Create a potential x, by ANDing a string of random bytes
  164. * with qmask.
  165. */
  166. if (ctx->x)
  167. freebn(ctx->x);
  168. if (nbits == 0 || nbits > bignum_bitcount(ctx->qmask)) {
  169. ssh1_write_bignum(buf, ctx->qmask);
  170. for (i = 2; i < nbytes; i++)
  171. buf[i] &= random_byte();
  172. ssh1_read_bignum(buf, nbytes, &ctx->x); /* can't fail */
  173. } else {
  174. int b, nb;
  175. ctx->x = bn_power_2(nbits);
  176. b = nb = 0;
  177. for (i = 0; i < nbits; i++) {
  178. if (nb == 0) {
  179. nb = 8;
  180. b = random_byte();
  181. }
  182. bignum_set_bit(ctx->x, i, b & 1);
  183. b >>= 1;
  184. nb--;
  185. }
  186. }
  187. } while (bignum_cmp(ctx->x, One) <= 0 || bignum_cmp(ctx->x, ctx->q) >= 0);
  188. sfree(buf);
  189. /*
  190. * Done. Now compute e = g^x mod p.
  191. */
  192. ctx->e = modpow(ctx->g, ctx->x, ctx->p);
  193. return ctx->e;
  194. }
  195. /*
  196. * DH stage 2-epsilon: given a number f, validate it to ensure it's in
  197. * range. (RFC 4253 section 8: "Values of 'e' or 'f' that are not in
  198. * the range [1, p-1] MUST NOT be sent or accepted by either side."
  199. * Also, we rule out 1 and p-1 too, since that's easy to do and since
  200. * they lead to obviously weak keys that even a passive eavesdropper
  201. * can figure out.)
  202. */
  203. const char *dh_validate_f(void *handle, Bignum f)
  204. {
  205. struct dh_ctx *ctx = (struct dh_ctx *)handle;
  206. if (bignum_cmp(f, One) <= 0) {
  207. return "f value received is too small";
  208. } else {
  209. Bignum pm1 = bigsub(ctx->p, One);
  210. int cmp = bignum_cmp(f, pm1);
  211. freebn(pm1);
  212. if (cmp >= 0)
  213. return "f value received is too large";
  214. }
  215. return NULL;
  216. }
  217. /*
  218. * DH stage 2: given a number f, compute K = f^x mod p.
  219. */
  220. Bignum dh_find_K(void *handle, Bignum f)
  221. {
  222. struct dh_ctx *ctx = (struct dh_ctx *)handle;
  223. Bignum ret;
  224. ret = modpow(f, ctx->x, ctx->p);
  225. return ret;
  226. }