You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
 
 
 
 
 
 

310 lines
12 KiB

  1. /* DTLS implementation written by Nagendra Modadugu
  2. * (nagendra@cs.stanford.edu) for the OpenSSL project 2005. */
  3. /* ====================================================================
  4. * Copyright (c) 1998-2005 The OpenSSL Project. All rights reserved.
  5. *
  6. * Redistribution and use in source and binary forms, with or without
  7. * modification, are permitted provided that the following conditions
  8. * are met:
  9. *
  10. * 1. Redistributions of source code must retain the above copyright
  11. * notice, this list of conditions and the following disclaimer.
  12. *
  13. * 2. Redistributions in binary form must reproduce the above copyright
  14. * notice, this list of conditions and the following disclaimer in
  15. * the documentation and/or other materials provided with the
  16. * distribution.
  17. *
  18. * 3. All advertising materials mentioning features or use of this
  19. * software must display the following acknowledgment:
  20. * "This product includes software developed by the OpenSSL Project
  21. * for use in the OpenSSL Toolkit. (http://www.openssl.org/)"
  22. *
  23. * 4. The names "OpenSSL Toolkit" and "OpenSSL Project" must not be used to
  24. * endorse or promote products derived from this software without
  25. * prior written permission. For written permission, please contact
  26. * openssl-core@openssl.org.
  27. *
  28. * 5. Products derived from this software may not be called "OpenSSL"
  29. * nor may "OpenSSL" appear in their names without prior written
  30. * permission of the OpenSSL Project.
  31. *
  32. * 6. Redistributions of any form whatsoever must retain the following
  33. * acknowledgment:
  34. * "This product includes software developed by the OpenSSL Project
  35. * for use in the OpenSSL Toolkit (http://www.openssl.org/)"
  36. *
  37. * THIS SOFTWARE IS PROVIDED BY THE OpenSSL PROJECT ``AS IS'' AND ANY
  38. * EXPRESSED OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
  39. * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
  40. * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE OpenSSL PROJECT OR
  41. * ITS CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
  42. * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
  43. * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
  44. * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
  45. * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT,
  46. * STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
  47. * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED
  48. * OF THE POSSIBILITY OF SUCH DAMAGE.
  49. * ====================================================================
  50. *
  51. * This product includes cryptographic software written by Eric Young
  52. * (eay@cryptsoft.com). This product includes software written by Tim
  53. * Hudson (tjh@cryptsoft.com).
  54. *
  55. */
  56. /* Copyright (C) 1995-1998 Eric Young (eay@cryptsoft.com)
  57. * All rights reserved.
  58. *
  59. * This package is an SSL implementation written
  60. * by Eric Young (eay@cryptsoft.com).
  61. * The implementation was written so as to conform with Netscapes SSL.
  62. *
  63. * This library is free for commercial and non-commercial use as long as
  64. * the following conditions are aheared to. The following conditions
  65. * apply to all code found in this distribution, be it the RC4, RSA,
  66. * lhash, DES, etc., code; not just the SSL code. The SSL documentation
  67. * included with this distribution is covered by the same copyright terms
  68. * except that the holder is Tim Hudson (tjh@cryptsoft.com).
  69. *
  70. * Copyright remains Eric Young's, and as such any Copyright notices in
  71. * the code are not to be removed.
  72. * If this package is used in a product, Eric Young should be given attribution
  73. * as the author of the parts of the library used.
  74. * This can be in the form of a textual message at program startup or
  75. * in documentation (online or textual) provided with the package.
  76. *
  77. * Redistribution and use in source and binary forms, with or without
  78. * modification, are permitted provided that the following conditions
  79. * are met:
  80. * 1. Redistributions of source code must retain the copyright
  81. * notice, this list of conditions and the following disclaimer.
  82. * 2. Redistributions in binary form must reproduce the above copyright
  83. * notice, this list of conditions and the following disclaimer in the
  84. * documentation and/or other materials provided with the distribution.
  85. * 3. All advertising materials mentioning features or use of this software
  86. * must display the following acknowledgement:
  87. * "This product includes cryptographic software written by
  88. * Eric Young (eay@cryptsoft.com)"
  89. * The word 'cryptographic' can be left out if the rouines from the library
  90. * being used are not cryptographic related :-).
  91. * 4. If you include any Windows specific code (or a derivative thereof) from
  92. * the apps directory (application code) you must include an acknowledgement:
  93. * "This product includes software written by Tim Hudson (tjh@cryptsoft.com)"
  94. *
  95. * THIS SOFTWARE IS PROVIDED BY ERIC YOUNG ``AS IS'' AND
  96. * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
  97. * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
  98. * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
  99. * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
  100. * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
  101. * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
  102. * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
  103. * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
  104. * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
  105. * SUCH DAMAGE.
  106. *
  107. * The licence and distribution terms for any publically available version or
  108. * derivative of this code cannot be changed. i.e. this code cannot simply be
  109. * copied and put under another distribution licence
  110. * [including the GNU Public Licence.] */
  111. #include <openssl/ssl.h>
  112. #include <assert.h>
  113. #include <string.h>
  114. #include <openssl/bytestring.h>
  115. #include <openssl/err.h>
  116. #include "internal.h"
  117. #include "../crypto/internal.h"
  118. /* to_u64_be treats |in| as a 8-byte big-endian integer and returns the value as
  119. * a |uint64_t|. */
  120. static uint64_t to_u64_be(const uint8_t in[8]) {
  121. uint64_t ret = 0;
  122. unsigned i;
  123. for (i = 0; i < 8; i++) {
  124. ret <<= 8;
  125. ret |= in[i];
  126. }
  127. return ret;
  128. }
  129. /* dtls1_bitmap_should_discard returns one if |seq_num| has been seen in |bitmap|
  130. * or is stale. Otherwise it returns zero. */
  131. static int dtls1_bitmap_should_discard(DTLS1_BITMAP *bitmap,
  132. const uint8_t seq_num[8]) {
  133. const unsigned kWindowSize = sizeof(bitmap->map) * 8;
  134. uint64_t seq_num_u = to_u64_be(seq_num);
  135. if (seq_num_u > bitmap->max_seq_num) {
  136. return 0;
  137. }
  138. uint64_t idx = bitmap->max_seq_num - seq_num_u;
  139. return idx >= kWindowSize || (bitmap->map & (((uint64_t)1) << idx));
  140. }
  141. /* dtls1_bitmap_record updates |bitmap| to record receipt of sequence number
  142. * |seq_num|. It slides the window forward if needed. It is an error to call
  143. * this function on a stale sequence number. */
  144. static void dtls1_bitmap_record(DTLS1_BITMAP *bitmap,
  145. const uint8_t seq_num[8]) {
  146. const unsigned kWindowSize = sizeof(bitmap->map) * 8;
  147. uint64_t seq_num_u = to_u64_be(seq_num);
  148. /* Shift the window if necessary. */
  149. if (seq_num_u > bitmap->max_seq_num) {
  150. uint64_t shift = seq_num_u - bitmap->max_seq_num;
  151. if (shift >= kWindowSize) {
  152. bitmap->map = 0;
  153. } else {
  154. bitmap->map <<= shift;
  155. }
  156. bitmap->max_seq_num = seq_num_u;
  157. }
  158. uint64_t idx = bitmap->max_seq_num - seq_num_u;
  159. if (idx < kWindowSize) {
  160. bitmap->map |= ((uint64_t)1) << idx;
  161. }
  162. }
  163. enum ssl_open_record_t dtls_open_record(SSL *ssl, uint8_t *out_type, CBS *out,
  164. size_t *out_consumed,
  165. uint8_t *out_alert, uint8_t *in,
  166. size_t in_len) {
  167. *out_consumed = 0;
  168. CBS cbs;
  169. CBS_init(&cbs, in, in_len);
  170. /* Decode the record. */
  171. uint8_t type;
  172. uint16_t version;
  173. uint8_t sequence[8];
  174. CBS body;
  175. if (!CBS_get_u8(&cbs, &type) ||
  176. !CBS_get_u16(&cbs, &version) ||
  177. !CBS_copy_bytes(&cbs, sequence, 8) ||
  178. !CBS_get_u16_length_prefixed(&cbs, &body) ||
  179. (ssl->s3->have_version && version != ssl->version) ||
  180. (version >> 8) != DTLS1_VERSION_MAJOR ||
  181. CBS_len(&body) > SSL3_RT_MAX_ENCRYPTED_LENGTH) {
  182. /* The record header was incomplete or malformed. Drop the entire packet. */
  183. *out_consumed = in_len;
  184. return ssl_open_record_discard;
  185. }
  186. ssl_do_msg_callback(ssl, 0 /* read */, SSL3_RT_HEADER, in,
  187. DTLS1_RT_HEADER_LENGTH);
  188. uint16_t epoch = (((uint16_t)sequence[0]) << 8) | sequence[1];
  189. if (epoch != ssl->d1->r_epoch ||
  190. dtls1_bitmap_should_discard(&ssl->d1->bitmap, sequence)) {
  191. /* Drop this record. It's from the wrong epoch or is a replay. Note that if
  192. * |epoch| is the next epoch, the record could be buffered for later. For
  193. * simplicity, drop it and expect retransmit to handle it later; DTLS must
  194. * handle packet loss anyway. */
  195. *out_consumed = in_len - CBS_len(&cbs);
  196. return ssl_open_record_discard;
  197. }
  198. /* Decrypt the body in-place. */
  199. if (!SSL_AEAD_CTX_open(ssl->s3->aead_read_ctx, out, type, version, sequence,
  200. (uint8_t *)CBS_data(&body), CBS_len(&body))) {
  201. /* Bad packets are silently dropped in DTLS. See section 4.2.1 of RFC 6347.
  202. * Clear the error queue of any errors decryption may have added. Drop the
  203. * entire packet as it must not have come from the peer.
  204. *
  205. * TODO(davidben): This doesn't distinguish malloc failures from encryption
  206. * failures. */
  207. ERR_clear_error();
  208. *out_consumed = in_len - CBS_len(&cbs);
  209. return ssl_open_record_discard;
  210. }
  211. *out_consumed = in_len - CBS_len(&cbs);
  212. /* Check the plaintext length. */
  213. if (CBS_len(out) > SSL3_RT_MAX_PLAIN_LENGTH) {
  214. OPENSSL_PUT_ERROR(SSL, SSL_R_DATA_LENGTH_TOO_LONG);
  215. *out_alert = SSL_AD_RECORD_OVERFLOW;
  216. return ssl_open_record_error;
  217. }
  218. dtls1_bitmap_record(&ssl->d1->bitmap, sequence);
  219. /* TODO(davidben): Limit the number of empty records as in TLS? This is only
  220. * useful if we also limit discarded packets. */
  221. if (type == SSL3_RT_ALERT) {
  222. return ssl_process_alert(ssl, out_alert, CBS_data(out), CBS_len(out));
  223. }
  224. ssl->s3->warning_alert_count = 0;
  225. *out_type = type;
  226. return ssl_open_record_success;
  227. }
  228. int dtls_seal_record(SSL *ssl, uint8_t *out, size_t *out_len, size_t max_out,
  229. uint8_t type, const uint8_t *in, size_t in_len,
  230. enum dtls1_use_epoch_t use_epoch) {
  231. if (buffers_alias(in, in_len, out, max_out)) {
  232. OPENSSL_PUT_ERROR(SSL, SSL_R_OUTPUT_ALIASES_INPUT);
  233. return 0;
  234. }
  235. /* Determine the parameters for the current epoch. */
  236. uint16_t epoch = ssl->d1->w_epoch;
  237. SSL_AEAD_CTX *aead = ssl->s3->aead_write_ctx;
  238. uint8_t *seq = ssl->s3->write_sequence;
  239. if (use_epoch == dtls1_use_previous_epoch) {
  240. /* DTLS renegotiation is unsupported, so only epochs 0 (NULL cipher) and 1
  241. * (negotiated cipher) exist. */
  242. assert(ssl->d1->w_epoch == 1);
  243. epoch = ssl->d1->w_epoch - 1;
  244. aead = NULL;
  245. seq = ssl->d1->last_write_sequence;
  246. }
  247. if (max_out < DTLS1_RT_HEADER_LENGTH) {
  248. OPENSSL_PUT_ERROR(SSL, SSL_R_BUFFER_TOO_SMALL);
  249. return 0;
  250. }
  251. out[0] = type;
  252. uint16_t wire_version = ssl->s3->have_version ? ssl->version : DTLS1_VERSION;
  253. out[1] = wire_version >> 8;
  254. out[2] = wire_version & 0xff;
  255. out[3] = epoch >> 8;
  256. out[4] = epoch & 0xff;
  257. memcpy(&out[5], &seq[2], 6);
  258. size_t ciphertext_len;
  259. if (!SSL_AEAD_CTX_seal(aead, out + DTLS1_RT_HEADER_LENGTH, &ciphertext_len,
  260. max_out - DTLS1_RT_HEADER_LENGTH, type, wire_version,
  261. &out[3] /* seq */, in, in_len) ||
  262. !ssl_record_sequence_update(&seq[2], 6)) {
  263. return 0;
  264. }
  265. if (ciphertext_len >= 1 << 16) {
  266. OPENSSL_PUT_ERROR(SSL, ERR_R_OVERFLOW);
  267. return 0;
  268. }
  269. out[11] = ciphertext_len >> 8;
  270. out[12] = ciphertext_len & 0xff;
  271. *out_len = DTLS1_RT_HEADER_LENGTH + ciphertext_len;
  272. ssl_do_msg_callback(ssl, 1 /* write */, SSL3_RT_HEADER, out,
  273. DTLS1_RT_HEADER_LENGTH);
  274. return 1;
  275. }