der.c 11 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447
  1. /*-
  2. * Copyright (c) 2016 Christos Zoulas
  3. * All rights reserved.
  4. *
  5. * Redistribution and use in source and binary forms, with or without
  6. * modification, are permitted provided that the following conditions
  7. * are met:
  8. * 1. Redistributions of source code must retain the above copyright
  9. * notice, this list of conditions and the following disclaimer.
  10. * 2. Redistributions in binary form must reproduce the above copyright
  11. * notice, this list of conditions and the following disclaimer in the
  12. * documentation and/or other materials provided with the distribution.
  13. *
  14. * THIS SOFTWARE IS PROVIDED BY THE NETBSD FOUNDATION, INC. AND CONTRIBUTORS
  15. * ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED
  16. * TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
  17. * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE FOUNDATION OR CONTRIBUTORS
  18. * BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
  19. * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
  20. * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
  21. * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
  22. * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
  23. * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
  24. * POSSIBILITY OF SUCH DAMAGE.
  25. */
  26. /*
  27. * DER (Distinguished Encoding Rules) Parser
  28. *
  29. * Sources:
  30. * https://en.wikipedia.org/wiki/X.690
  31. * http://fm4dd.com/openssl/certexamples.htm
  32. * http://blog.engelke.com/2014/10/17/parsing-ber-and-der-encoded-asn-1-objects/
  33. */
  34. #ifndef TEST_DER
  35. #include "file.h"
  36. #ifndef lint
  37. FILE_RCSID("@(#)$File: der.c,v 1.20 2020/06/07 19:10:37 christos Exp $")
  38. #endif
  39. #else
  40. #define SIZE_T_FORMAT "z"
  41. #define CAST(a, b) ((a)(b))
  42. #endif
  43. #include <sys/types.h>
  44. #include <stdio.h>
  45. #include <fcntl.h>
  46. #include <stdlib.h>
  47. #include <string.h>
  48. #include <ctype.h>
  49. #ifndef TEST_DER
  50. #include "magic.h"
  51. #include "der.h"
  52. #else
  53. #include <sys/mman.h>
  54. #include <sys/stat.h>
  55. #include <err.h>
  56. #endif
  57. #define DER_BAD CAST(uint32_t, -1)
  58. #define DER_CLASS_UNIVERSAL 0
  59. #define DER_CLASS_APPLICATION 1
  60. #define DER_CLASS_CONTEXT 2
  61. #define DER_CLASS_PRIVATE 3
  62. #if defined(DEBUG_DER) || defined(TEST_DER)
  63. static const char der_class[] = "UACP";
  64. #endif
  65. #define DER_TYPE_PRIMITIVE 0
  66. #define DER_TYPE_CONSTRUCTED 1
  67. #if defined(DEBUG_DER) || defined(TEST_DER)
  68. static const char der_type[] = "PC";
  69. #endif
  70. #define DER_TAG_EOC 0x00
  71. #define DER_TAG_BOOLEAN 0x01
  72. #define DER_TAG_INTEGER 0x02
  73. #define DER_TAG_BIT STRING 0x03
  74. #define DER_TAG_OCTET_STRING 0x04
  75. #define DER_TAG_NULL 0x05
  76. #define DER_TAG_OBJECT_IDENTIFIER 0x06
  77. #define DER_TAG_OBJECT_DESCRIPTOR 0x07
  78. #define DER_TAG_EXTERNAL 0x08
  79. #define DER_TAG_REAL 0x09
  80. #define DER_TAG_ENUMERATED 0x0a
  81. #define DER_TAG_EMBEDDED_PDV 0x0b
  82. #define DER_TAG_UTF8_STRING 0x0c
  83. #define DER_TAG_RELATIVE_OID 0x0d
  84. #define DER_TAG_TIME 0x0e
  85. #define DER_TAG_RESERVED_2 0x0f
  86. #define DER_TAG_SEQUENCE 0x10
  87. #define DER_TAG_SET 0x11
  88. #define DER_TAG_NUMERIC_STRING 0x12
  89. #define DER_TAG_PRINTABLE_STRING 0x13
  90. #define DER_TAG_T61_STRING 0x14
  91. #define DER_TAG_VIDEOTEX_STRING 0x15
  92. #define DER_TAG_IA5_STRING 0x16
  93. #define DER_TAG_UTCTIME 0x17
  94. #define DER_TAG_GENERALIZED_TIME 0x18
  95. #define DER_TAG_GRAPHIC_STRING 0x19
  96. #define DER_TAG_VISIBLE_STRING 0x1a
  97. #define DER_TAG_GENERAL_STRING 0x1b
  98. #define DER_TAG_UNIVERSAL_STRING 0x1c
  99. #define DER_TAG_CHARACTER_STRING 0x1d
  100. #define DER_TAG_BMP_STRING 0x1e
  101. #define DER_TAG_DATE 0x1f
  102. #define DER_TAG_TIME_OF_DAY 0x20
  103. #define DER_TAG_DATE_TIME 0x21
  104. #define DER_TAG_DURATION 0x22
  105. #define DER_TAG_OID_IRI 0x23
  106. #define DER_TAG_RELATIVE_OID_IRI 0x24
  107. #define DER_TAG_LAST 0x25
  108. static const char *der__tag[] = {
  109. "eoc", "bool", "int", "bit_str", "octet_str",
  110. "null", "obj_id", "obj_desc", "ext", "real",
  111. "enum", "embed", "utf8_str", "rel_oid", "time",
  112. "res2", "seq", "set", "num_str", "prt_str",
  113. "t61_str", "vid_str", "ia5_str", "utc_time", "gen_time",
  114. "gr_str", "vis_str", "gen_str", "univ_str", "char_str",
  115. "bmp_str", "date", "tod", "datetime", "duration",
  116. "oid-iri", "rel-oid-iri",
  117. };
  118. #ifdef DEBUG_DER
  119. #define DPRINTF(a) printf a
  120. #else
  121. #define DPRINTF(a)
  122. #endif
  123. #ifdef TEST_DER
  124. static uint8_t
  125. getclass(uint8_t c)
  126. {
  127. return c >> 6;
  128. }
  129. static uint8_t
  130. gettype(uint8_t c)
  131. {
  132. return (c >> 5) & 1;
  133. }
  134. #endif
  135. static uint32_t
  136. gettag(const uint8_t *c, size_t *p, size_t l)
  137. {
  138. uint32_t tag;
  139. if (*p >= l)
  140. return DER_BAD;
  141. tag = c[(*p)++] & 0x1f;
  142. if (tag != 0x1f)
  143. return tag;
  144. if (*p >= l)
  145. return DER_BAD;
  146. while (c[*p] >= 0x80) {
  147. tag = tag * 128 + c[(*p)++] - 0x80;
  148. if (*p >= l)
  149. return DER_BAD;
  150. }
  151. return tag;
  152. }
  153. /*
  154. * Read the length of a DER tag from the input.
  155. *
  156. * `c` is the input, `p` is an output parameter that specifies how much of the
  157. * input we consumed, and `l` is the maximum input length.
  158. *
  159. * Returns the length, or DER_BAD if the end of the input is reached or the
  160. * length exceeds the remaining input.
  161. */
  162. static uint32_t
  163. getlength(const uint8_t *c, size_t *p, size_t l)
  164. {
  165. uint8_t digits, i;
  166. size_t len;
  167. int is_onebyte_result;
  168. if (*p >= l) {
  169. DPRINTF(("%s:[1] %zu >= %zu\n", __func__, *p, l));
  170. return DER_BAD;
  171. }
  172. /*
  173. * Digits can either be 0b0 followed by the result, or 0b1
  174. * followed by the number of digits of the result. In either case,
  175. * we verify that we can read so many bytes from the input.
  176. */
  177. is_onebyte_result = (c[*p] & 0x80) == 0;
  178. digits = c[(*p)++] & 0x7f;
  179. if (*p + digits >= l) {
  180. DPRINTF(("%s:[2] %zu + %u >= %zu\n", __func__, *p, digits, l));
  181. return DER_BAD;
  182. }
  183. if (is_onebyte_result)
  184. return digits;
  185. /*
  186. * Decode len. We've already verified that we're allowed to read
  187. * `digits` bytes.
  188. */
  189. len = 0;
  190. for (i = 0; i < digits; i++)
  191. len = (len << 8) | c[(*p)++];
  192. if (len > UINT32_MAX - *p || *p + len > l) {
  193. DPRINTF(("%s:[3] bad len %zu + %zu >= %zu\n",
  194. __func__, *p, len, l));
  195. return DER_BAD;
  196. }
  197. return CAST(uint32_t, len);
  198. }
  199. static const char *
  200. der_tag(char *buf, size_t len, uint32_t tag)
  201. {
  202. if (tag < DER_TAG_LAST)
  203. strlcpy(buf, der__tag[tag], len);
  204. else
  205. snprintf(buf, len, "%#x", tag);
  206. return buf;
  207. }
  208. #ifndef TEST_DER
  209. static int
  210. der_data(char *buf, size_t blen, uint32_t tag, const void *q, uint32_t len)
  211. {
  212. const uint8_t *d = CAST(const uint8_t *, q);
  213. switch (tag) {
  214. case DER_TAG_PRINTABLE_STRING:
  215. case DER_TAG_UTF8_STRING:
  216. case DER_TAG_IA5_STRING:
  217. return snprintf(buf, blen, "%.*s", len, RCAST(const char *, q));
  218. case DER_TAG_UTCTIME:
  219. if (len < 12)
  220. break;
  221. return snprintf(buf, blen,
  222. "20%c%c-%c%c-%c%c %c%c:%c%c:%c%c GMT", d[0], d[1], d[2],
  223. d[3], d[4], d[5], d[6], d[7], d[8], d[9], d[10], d[11]);
  224. break;
  225. default:
  226. break;
  227. }
  228. for (uint32_t i = 0; i < len; i++) {
  229. uint32_t z = i << 1;
  230. if (z < blen - 2)
  231. snprintf(buf + z, blen - z, "%.2x", d[i]);
  232. }
  233. return len * 2;
  234. }
  235. int32_t
  236. der_offs(struct magic_set *ms, struct magic *m, size_t nbytes)
  237. {
  238. const uint8_t *b = RCAST(const uint8_t *, ms->search.s);
  239. size_t offs = 0, len = ms->search.s_len ? ms->search.s_len : nbytes;
  240. if (gettag(b, &offs, len) == DER_BAD) {
  241. DPRINTF(("%s: bad tag 1\n", __func__));
  242. return -1;
  243. }
  244. DPRINTF(("%s1: %d %" SIZE_T_FORMAT "u %u\n", __func__, ms->offset,
  245. offs, m->offset));
  246. uint32_t tlen = getlength(b, &offs, len);
  247. if (tlen == DER_BAD) {
  248. DPRINTF(("%s: bad tag 2\n", __func__));
  249. return -1;
  250. }
  251. DPRINTF(("%s2: %d %" SIZE_T_FORMAT "u %u\n", __func__, ms->offset,
  252. offs, tlen));
  253. offs += ms->offset + m->offset;
  254. DPRINTF(("cont_level = %d\n", m->cont_level));
  255. #ifdef DEBUG_DER
  256. for (size_t i = 0; i < m->cont_level; i++)
  257. printf("cont_level[%" SIZE_T_FORMAT "u] = %u\n", i,
  258. ms->c.li[i].off);
  259. #endif
  260. if (m->cont_level != 0) {
  261. if (offs + tlen > nbytes)
  262. return -1;
  263. ms->c.li[m->cont_level - 1].off = CAST(int, offs + tlen);
  264. DPRINTF(("cont_level[%u] = %u\n", m->cont_level - 1,
  265. ms->c.li[m->cont_level - 1].off));
  266. }
  267. return CAST(int32_t, offs);
  268. }
  269. int
  270. der_cmp(struct magic_set *ms, struct magic *m)
  271. {
  272. const uint8_t *b = RCAST(const uint8_t *, ms->search.s);
  273. const char *s = m->value.s;
  274. size_t offs = 0, len = ms->search.s_len;
  275. uint32_t tag, tlen;
  276. char buf[128];
  277. DPRINTF(("%s: compare %zu bytes\n", __func__, len));
  278. tag = gettag(b, &offs, len);
  279. if (tag == DER_BAD) {
  280. DPRINTF(("%s: bad tag 1\n", __func__));
  281. return -1;
  282. }
  283. DPRINTF(("%s1: %d %" SIZE_T_FORMAT "u %u\n", __func__, ms->offset,
  284. offs, m->offset));
  285. tlen = getlength(b, &offs, len);
  286. if (tlen == DER_BAD) {
  287. DPRINTF(("%s: bad tag 2\n", __func__));
  288. return -1;
  289. }
  290. der_tag(buf, sizeof(buf), tag);
  291. if ((ms->flags & MAGIC_DEBUG) != 0)
  292. fprintf(stderr, "%s: tag %p got=%s exp=%s\n", __func__, b,
  293. buf, s);
  294. size_t slen = strlen(buf);
  295. if (strncmp(buf, s, slen) != 0)
  296. return 0;
  297. s += slen;
  298. again:
  299. switch (*s) {
  300. case '\0':
  301. return 1;
  302. case '=':
  303. s++;
  304. goto val;
  305. default:
  306. if (!isdigit(CAST(unsigned char, *s)))
  307. return 0;
  308. slen = 0;
  309. do
  310. slen = slen * 10 + *s - '0';
  311. while (isdigit(CAST(unsigned char, *++s)));
  312. if ((ms->flags & MAGIC_DEBUG) != 0)
  313. fprintf(stderr, "%s: len %" SIZE_T_FORMAT "u %u\n",
  314. __func__, slen, tlen);
  315. if (tlen != slen)
  316. return 0;
  317. goto again;
  318. }
  319. val:
  320. DPRINTF(("%s: before data %" SIZE_T_FORMAT "u %u\n", __func__, offs,
  321. tlen));
  322. der_data(buf, sizeof(buf), tag, b + offs, tlen);
  323. if ((ms->flags & MAGIC_DEBUG) != 0)
  324. fprintf(stderr, "%s: data %s %s\n", __func__, buf, s);
  325. if (strcmp(buf, s) != 0 && strcmp("x", s) != 0)
  326. return 0;
  327. strlcpy(ms->ms_value.s, buf, sizeof(ms->ms_value.s));
  328. return 1;
  329. }
  330. #endif
  331. #ifdef TEST_DER
  332. static void
  333. printtag(uint32_t tag, const void *q, uint32_t len)
  334. {
  335. const uint8_t *d = q;
  336. switch (tag) {
  337. case DER_TAG_PRINTABLE_STRING:
  338. case DER_TAG_UTF8_STRING:
  339. case DER_TAG_IA5_STRING:
  340. case DER_TAG_UTCTIME:
  341. printf("%.*s\n", len, (const char *)q);
  342. return;
  343. default:
  344. break;
  345. }
  346. for (uint32_t i = 0; i < len; i++)
  347. printf("%.2x", d[i]);
  348. printf("\n");
  349. }
  350. static void
  351. printdata(size_t level, const void *v, size_t x, size_t l)
  352. {
  353. const uint8_t *p = v, *ep = p + l;
  354. size_t ox;
  355. char buf[128];
  356. while (p + x < ep) {
  357. const uint8_t *q;
  358. uint8_t c = getclass(p[x]);
  359. uint8_t t = gettype(p[x]);
  360. ox = x;
  361. // if (x != 0)
  362. // printf("%.2x %.2x %.2x\n", p[x - 1], p[x], p[x + 1]);
  363. uint32_t tag = gettag(p, &x, ep - p + x);
  364. if (p + x >= ep)
  365. break;
  366. uint32_t len = getlength(p, &x, ep - p + x);
  367. printf("%" SIZE_T_FORMAT "u %" SIZE_T_FORMAT "u-%"
  368. SIZE_T_FORMAT "u %c,%c,%s,%u:", level, ox, x,
  369. der_class[c], der_type[t],
  370. der_tag(buf, sizeof(buf), tag), len);
  371. q = p + x;
  372. if (p + len > ep)
  373. errx(EXIT_FAILURE, "corrupt der");
  374. printtag(tag, q, len);
  375. if (t != DER_TYPE_PRIMITIVE)
  376. printdata(level + 1, p, x, len + x);
  377. x += len;
  378. }
  379. }
  380. int
  381. main(int argc, char *argv[])
  382. {
  383. int fd;
  384. struct stat st;
  385. size_t l;
  386. void *p;
  387. if ((fd = open(argv[1], O_RDONLY)) == -1)
  388. err(EXIT_FAILURE, "open `%s'", argv[1]);
  389. if (fstat(fd, &st) == -1)
  390. err(EXIT_FAILURE, "stat `%s'", argv[1]);
  391. l = (size_t)st.st_size;
  392. if ((p = mmap(NULL, l, PROT_READ, MAP_FILE, fd, 0)) == MAP_FAILED)
  393. err(EXIT_FAILURE, "mmap `%s'", argv[1]);
  394. printdata(0, p, 0, l);
  395. munmap(p, l);
  396. return 0;
  397. }
  398. #endif