challenge.c 4.9 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135
  1. /*
  2. * challenge.c
  3. * ptunnel is licensed under the BSD license:
  4. *
  5. * Copyright (c) 2004-2011, Daniel Stoedle <daniels@cs.uit.no>,
  6. * Yellow Lemon Software. All rights reserved.
  7. *
  8. * Copyright (c) 2017-2019, Toni Uhlig <matzeton@googlemail.com>
  9. *
  10. * Redistribution and use in source and binary forms, with or without
  11. * modification, are permitted provided that the following conditions are met:
  12. *
  13. * - Redistributions of source code must retain the above copyright notice,
  14. * this list of conditions and the following disclaimer.
  15. *
  16. * - Redistributions in binary form must reproduce the above copyright notice,
  17. * this list of conditions and the following disclaimer in the documentation
  18. * and/or other materials provided with the distribution.
  19. *
  20. * - Neither the name of the Yellow Lemon Software nor the names of its
  21. * contributors may be used to endorse or promote products derived from this
  22. * software without specific prior written permission.
  23. *
  24. * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
  25. * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
  26. * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
  27. * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
  28. * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
  29. * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
  30. * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
  31. * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
  32. * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
  33. * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
  34. * POSSIBILITY OF SUCH DAMAGE.
  35. *
  36. * Contacting the author:
  37. * You can get in touch with me, Daniel Stødle (that's the Norwegian letter oe,
  38. * in case your text editor didn't realize), here: <daniels@cs.uit.no>
  39. *
  40. * The official ptunnel website is here:
  41. * <http://www.cs.uit.no/~daniels/PingTunnel/>
  42. *
  43. * Note that the source code is best viewed with tabs set to 4 spaces.
  44. */
  45. #include <stdlib.h>
  46. #include <string.h>
  47. #include <sys/time.h>
  48. #include <assert.h>
  49. #include "challenge.h"
  50. #include "options.h"
  51. #include "md5.h"
  52. #include "utils.h"
  53. /* generate_challenge: Generates a random challenge, incorporating the current
  54. * local timestamp to avoid replay attacks.
  55. */
  56. challenge_t *generate_challenge(void) {
  57. struct timeval tt;
  58. challenge_t *c;
  59. int i;
  60. c = (challenge_t *) calloc(1, sizeof(challenge_t));
  61. assert(c != NULL);
  62. gettimeofday(&tt, 0);
  63. c->plain.sec = tt.tv_sec;
  64. c->plain.usec_rnd = tt.tv_usec + pt_random();
  65. for (i=0;i<6;i++)
  66. c->plain.random[i] = pt_random();
  67. return c;
  68. }
  69. /* generate_response_md5: Generates a response to the given challenge. The response
  70. * is generated by combining the concatenating the challenge data with the
  71. * md5 digest of the password, and then calculating the MD5 digest of the
  72. * entire buffer. The result is stored in the passed-in challenge, overwriting
  73. * the challenge data.
  74. */
  75. void generate_response_md5(challenge_plain_t *plain, challenge_digest_t *digest) {
  76. md5_byte_t buf[sizeof(*plain) + kMD5_digest_size];
  77. md5_state_t state;
  78. digest->hash_type = HT_MD5;
  79. memcpy(buf, plain, sizeof(*plain));
  80. memcpy(&buf[sizeof(*plain)], opts.md5_password_digest, kMD5_digest_size);
  81. memset(plain, 0, sizeof(*plain));
  82. md5_init(&state);
  83. md5_append(&state, buf, sizeof(*plain) + kMD5_digest_size);
  84. md5_finish(&state, (md5_byte_t *) &digest->md5[0]);
  85. }
  86. /* validate_challenge_md5: Checks whether a given response matches the expected
  87. * response, returning 1 if validation succeeded, and 0 otherwise. Note that
  88. * overwriting the local challenge with the challenge result is not a problem,
  89. * as the data will not be used again anyway (authentication either succeeds,
  90. * or the connection is closed down).
  91. */
  92. int validate_challenge_md5(challenge_t *local, challenge_digest_t *remote) {
  93. generate_response_md5(&local->plain, &local->digest);
  94. if (remote->hash_type == HT_MD5 &&
  95. memcmp(&local->digest.md5[0], &remote->md5[0], sizeof(local->digest.md5)) == 0)
  96. {
  97. return 1;
  98. }
  99. return 0;
  100. }
  101. #ifdef ENABLE_SHA512
  102. void generate_response_sha512(challenge_plain_t *plain, challenge_digest_t *digest)
  103. {
  104. unsigned char buf[sizeof(*plain) + kSHA512_digest_size];
  105. digest->hash_type = HT_SHA512;
  106. memcpy(buf, plain, sizeof(*plain));
  107. memcpy(&buf[sizeof(*plain)], opts.sha512_password_digest, kSHA512_digest_size);
  108. memset(plain, 0, sizeof(*plain));
  109. SHA512(buf, sizeof(*plain) + kSHA512_digest_size, &digest->sha512[0]);
  110. }
  111. int validate_challenge_sha512(challenge_t *local, challenge_digest_t *remote)
  112. {
  113. generate_response_sha512(&local->plain, &local->digest);
  114. if (remote->hash_type == HT_SHA512 &&
  115. memcmp(&local->digest.sha512[0], &remote->sha512[0], sizeof(local->digest.sha512)) == 0)
  116. {
  117. return 1;
  118. }
  119. return 0;
  120. }
  121. #endif /* ENABLE_SHA512 */