binascii.c 15 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520
  1. /* Copyright (c) 2001, Matej Pfajfar.
  2. * Copyright (c) 2001-2004, Roger Dingledine.
  3. * Copyright (c) 2004-2006, Roger Dingledine, Nick Mathewson.
  4. * Copyright (c) 2007-2018, The Tor Project, Inc. */
  5. /* See LICENSE for licensing information */
  6. /**
  7. * \file binascii.c
  8. *
  9. * \brief Miscellaneous functions for encoding and decoding various things
  10. * in base{16,32,64}.
  11. */
  12. #include "orconfig.h"
  13. #include "lib/encoding/binascii.h"
  14. #include "lib/log/torlog.h"
  15. #include "lib/log/util_bug.h"
  16. #include "lib/cc/torint.h"
  17. #include "lib/string/compat_ctype.h"
  18. #include "lib/intmath/muldiv.h"
  19. #include "lib/malloc/malloc.h"
  20. #include <stddef.h>
  21. #include <string.h>
  22. #include <stdlib.h>
  23. /** Return a pointer to a NUL-terminated hexadecimal string encoding
  24. * the first <b>fromlen</b> bytes of <b>from</b>. (fromlen must be \<= 32.) The
  25. * result does not need to be deallocated, but repeated calls to
  26. * hex_str will trash old results.
  27. */
  28. const char *
  29. hex_str(const char *from, size_t fromlen)
  30. {
  31. static char buf[65];
  32. if (fromlen>(sizeof(buf)-1)/2)
  33. fromlen = (sizeof(buf)-1)/2;
  34. base16_encode(buf,sizeof(buf),from,fromlen);
  35. return buf;
  36. }
  37. /* Return the base32 encoded size in bytes using the source length srclen.
  38. *
  39. * (WATCH OUT: This API counts the terminating NUL byte, but
  40. * base64_encode_size does not.)
  41. */
  42. size_t
  43. base32_encoded_size(size_t srclen)
  44. {
  45. size_t enclen;
  46. tor_assert(srclen < SIZE_T_CEILING / 8);
  47. enclen = BASE32_NOPAD_BUFSIZE(srclen);
  48. tor_assert(enclen < INT_MAX && enclen > srclen);
  49. return enclen;
  50. }
  51. /** Implements base32 encoding as in RFC 4648. */
  52. void
  53. base32_encode(char *dest, size_t destlen, const char *src, size_t srclen)
  54. {
  55. unsigned int i, v, u;
  56. size_t nbits = srclen * 8;
  57. size_t bit;
  58. /* We need enough space for the encoded data and the extra NUL byte. */
  59. tor_assert(base32_encoded_size(srclen) <= destlen);
  60. tor_assert(destlen < SIZE_T_CEILING);
  61. /* Make sure we leave no uninitialized data in the destination buffer. */
  62. memset(dest, 0, destlen);
  63. for (i=0,bit=0; bit < nbits; ++i, bit+=5) {
  64. /* set v to the 16-bit value starting at src[bits/8], 0-padded. */
  65. size_t idx = bit / 8;
  66. v = ((uint8_t)src[idx]) << 8;
  67. if (idx+1 < srclen)
  68. v += (uint8_t)src[idx+1];
  69. /* set u to the 5-bit value at the bit'th bit of buf. */
  70. u = (v >> (11-(bit%8))) & 0x1F;
  71. dest[i] = BASE32_CHARS[u];
  72. }
  73. dest[i] = '\0';
  74. }
  75. /** Implements base32 decoding as in RFC 4648.
  76. * Returns 0 if successful, -1 otherwise.
  77. */
  78. int
  79. base32_decode(char *dest, size_t destlen, const char *src, size_t srclen)
  80. {
  81. /* XXXX we might want to rewrite this along the lines of base64_decode, if
  82. * it ever shows up in the profile. */
  83. unsigned int i;
  84. size_t nbits, j, bit;
  85. char *tmp;
  86. nbits = ((srclen * 5) / 8) * 8;
  87. tor_assert(srclen < SIZE_T_CEILING / 5);
  88. tor_assert((nbits/8) <= destlen); /* We need enough space. */
  89. tor_assert(destlen < SIZE_T_CEILING);
  90. /* Make sure we leave no uninitialized data in the destination buffer. */
  91. memset(dest, 0, destlen);
  92. /* Convert base32 encoded chars to the 5-bit values that they represent. */
  93. tmp = tor_malloc_zero(srclen);
  94. for (j = 0; j < srclen; ++j) {
  95. if (src[j] > 0x60 && src[j] < 0x7B) tmp[j] = src[j] - 0x61;
  96. else if (src[j] > 0x31 && src[j] < 0x38) tmp[j] = src[j] - 0x18;
  97. else if (src[j] > 0x40 && src[j] < 0x5B) tmp[j] = src[j] - 0x41;
  98. else {
  99. log_warn(LD_GENERAL, "illegal character in base32 encoded string");
  100. tor_free(tmp);
  101. return -1;
  102. }
  103. }
  104. /* Assemble result byte-wise by applying five possible cases. */
  105. for (i = 0, bit = 0; bit < nbits; ++i, bit += 8) {
  106. switch (bit % 40) {
  107. case 0:
  108. dest[i] = (((uint8_t)tmp[(bit/5)]) << 3) +
  109. (((uint8_t)tmp[(bit/5)+1]) >> 2);
  110. break;
  111. case 8:
  112. dest[i] = (((uint8_t)tmp[(bit/5)]) << 6) +
  113. (((uint8_t)tmp[(bit/5)+1]) << 1) +
  114. (((uint8_t)tmp[(bit/5)+2]) >> 4);
  115. break;
  116. case 16:
  117. dest[i] = (((uint8_t)tmp[(bit/5)]) << 4) +
  118. (((uint8_t)tmp[(bit/5)+1]) >> 1);
  119. break;
  120. case 24:
  121. dest[i] = (((uint8_t)tmp[(bit/5)]) << 7) +
  122. (((uint8_t)tmp[(bit/5)+1]) << 2) +
  123. (((uint8_t)tmp[(bit/5)+2]) >> 3);
  124. break;
  125. case 32:
  126. dest[i] = (((uint8_t)tmp[(bit/5)]) << 5) +
  127. ((uint8_t)tmp[(bit/5)+1]);
  128. break;
  129. }
  130. }
  131. memset(tmp, 0, srclen); /* on the heap, this should be safe */
  132. tor_free(tmp);
  133. tmp = NULL;
  134. return 0;
  135. }
  136. #define BASE64_OPENSSL_LINELEN 64
  137. /** Return the Base64 encoded size of <b>srclen</b> bytes of data in
  138. * bytes.
  139. *
  140. * (WATCH OUT: This API <em>does not</em> count the terminating NUL byte,
  141. * but base32_encoded_size does.)
  142. *
  143. * If <b>flags</b>&amp;BASE64_ENCODE_MULTILINE is true, return the size
  144. * of the encoded output as multiline output (64 character, `\n' terminated
  145. * lines).
  146. */
  147. size_t
  148. base64_encode_size(size_t srclen, int flags)
  149. {
  150. size_t enclen;
  151. /* Use INT_MAX for overflow checking because base64_encode() returns int. */
  152. tor_assert(srclen < INT_MAX);
  153. tor_assert(CEIL_DIV(srclen, 3) < INT_MAX / 4);
  154. enclen = BASE64_LEN(srclen);
  155. if (flags & BASE64_ENCODE_MULTILINE)
  156. enclen += CEIL_DIV(enclen, BASE64_OPENSSL_LINELEN);
  157. tor_assert(enclen < INT_MAX && (enclen == 0 || enclen > srclen));
  158. return enclen;
  159. }
  160. /** Internal table mapping 6 bit values to the Base64 alphabet. */
  161. static const char base64_encode_table[64] = {
  162. 'A', 'B', 'C', 'D', 'E', 'F', 'G', 'H',
  163. 'I', 'J', 'K', 'L', 'M', 'N', 'O', 'P',
  164. 'Q', 'R', 'S', 'T', 'U', 'V', 'W', 'X',
  165. 'Y', 'Z', 'a', 'b', 'c', 'd', 'e', 'f',
  166. 'g', 'h', 'i', 'j', 'k', 'l', 'm', 'n',
  167. 'o', 'p', 'q', 'r', 's', 't', 'u', 'v',
  168. 'w', 'x', 'y', 'z', '0', '1', '2', '3',
  169. '4', '5', '6', '7', '8', '9', '+', '/'
  170. };
  171. /** Base64 encode <b>srclen</b> bytes of data from <b>src</b>. Write
  172. * the result into <b>dest</b>, if it will fit within <b>destlen</b>
  173. * bytes. Return the number of bytes written on success; -1 if
  174. * destlen is too short, or other failure.
  175. *
  176. * If <b>flags</b>&amp;BASE64_ENCODE_MULTILINE is true, return encoded
  177. * output in multiline format (64 character, `\n' terminated lines).
  178. */
  179. int
  180. base64_encode(char *dest, size_t destlen, const char *src, size_t srclen,
  181. int flags)
  182. {
  183. const unsigned char *usrc = (unsigned char *)src;
  184. const unsigned char *eous = usrc + srclen;
  185. char *d = dest;
  186. uint32_t n = 0;
  187. size_t linelen = 0;
  188. size_t enclen;
  189. int n_idx = 0;
  190. if (!src || !dest)
  191. return -1;
  192. /* Ensure that there is sufficient space, including the NUL. */
  193. enclen = base64_encode_size(srclen, flags);
  194. if (destlen < enclen + 1)
  195. return -1;
  196. if (destlen > SIZE_T_CEILING)
  197. return -1;
  198. if (enclen > INT_MAX)
  199. return -1;
  200. /* Make sure we leave no uninitialized data in the destination buffer. */
  201. memset(dest, 0, destlen);
  202. /* XXX/Yawning: If this ends up being too slow, this can be sped up
  203. * by separating the multiline format case and the normal case, and
  204. * processing 48 bytes of input at a time when newlines are desired.
  205. */
  206. #define ENCODE_CHAR(ch) \
  207. STMT_BEGIN \
  208. *d++ = ch; \
  209. if (flags & BASE64_ENCODE_MULTILINE) { \
  210. if (++linelen % BASE64_OPENSSL_LINELEN == 0) { \
  211. linelen = 0; \
  212. *d++ = '\n'; \
  213. } \
  214. } \
  215. STMT_END
  216. #define ENCODE_N(idx) \
  217. ENCODE_CHAR(base64_encode_table[(n >> ((3 - idx) * 6)) & 0x3f])
  218. #define ENCODE_PAD() ENCODE_CHAR('=')
  219. /* Iterate over all the bytes in src. Each one will add 8 bits to the
  220. * value we're encoding. Accumulate bits in <b>n</b>, and whenever we
  221. * have 24 bits, batch them into 4 bytes and flush those bytes to dest.
  222. */
  223. for ( ; usrc < eous; ++usrc) {
  224. n = (n << 8) | *usrc;
  225. if ((++n_idx) == 3) {
  226. ENCODE_N(0);
  227. ENCODE_N(1);
  228. ENCODE_N(2);
  229. ENCODE_N(3);
  230. n_idx = 0;
  231. n = 0;
  232. }
  233. }
  234. switch (n_idx) {
  235. case 0:
  236. /* 0 leftover bits, no pading to add. */
  237. break;
  238. case 1:
  239. /* 8 leftover bits, pad to 12 bits, write the 2 6-bit values followed
  240. * by 2 padding characters.
  241. */
  242. n <<= 4;
  243. ENCODE_N(2);
  244. ENCODE_N(3);
  245. ENCODE_PAD();
  246. ENCODE_PAD();
  247. break;
  248. case 2:
  249. /* 16 leftover bits, pad to 18 bits, write the 3 6-bit values followed
  250. * by 1 padding character.
  251. */
  252. n <<= 2;
  253. ENCODE_N(1);
  254. ENCODE_N(2);
  255. ENCODE_N(3);
  256. ENCODE_PAD();
  257. break;
  258. // LCOV_EXCL_START -- we can't reach this point, because we enforce
  259. // 0 <= ncov_idx < 3 in the loop above.
  260. default:
  261. /* Something went catastrophically wrong. */
  262. tor_fragile_assert();
  263. return -1;
  264. // LCOV_EXCL_STOP
  265. }
  266. #undef ENCODE_N
  267. #undef ENCODE_PAD
  268. #undef ENCODE_CHAR
  269. /* Multiline output always includes at least one newline. */
  270. if (flags & BASE64_ENCODE_MULTILINE && linelen != 0)
  271. *d++ = '\n';
  272. tor_assert(d - dest == (ptrdiff_t)enclen);
  273. *d++ = '\0'; /* NUL terminate the output. */
  274. return (int) enclen;
  275. }
  276. /** As base64_encode, but do not add any internal spaces or external padding
  277. * to the output stream. */
  278. int
  279. base64_encode_nopad(char *dest, size_t destlen,
  280. const uint8_t *src, size_t srclen)
  281. {
  282. int n = base64_encode(dest, destlen, (const char*) src, srclen, 0);
  283. if (n <= 0)
  284. return n;
  285. tor_assert((size_t)n < destlen && dest[n] == 0);
  286. char *in, *out;
  287. in = out = dest;
  288. while (*in) {
  289. if (*in == '=' || *in == '\n') {
  290. ++in;
  291. } else {
  292. *out++ = *in++;
  293. }
  294. }
  295. *out = 0;
  296. tor_assert(out - dest <= INT_MAX);
  297. return (int)(out - dest);
  298. }
  299. #undef BASE64_OPENSSL_LINELEN
  300. /** @{ */
  301. /** Special values used for the base64_decode_table */
  302. #define X 255
  303. #define SP 64
  304. #define PAD 65
  305. /** @} */
  306. /** Internal table mapping byte values to what they represent in base64.
  307. * Numbers 0..63 are 6-bit integers. SPs are spaces, and should be
  308. * skipped. Xs are invalid and must not appear in base64. PAD indicates
  309. * end-of-string. */
  310. static const uint8_t base64_decode_table[256] = {
  311. X, X, X, X, X, X, X, X, X, SP, SP, SP, X, SP, X, X, /* */
  312. X, X, X, X, X, X, X, X, X, X, X, X, X, X, X, X,
  313. SP, X, X, X, X, X, X, X, X, X, X, 62, X, X, X, 63,
  314. 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, X, X, X, PAD, X, X,
  315. X, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14,
  316. 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, X, X, X, X, X,
  317. X, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40,
  318. 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, X, X, X, X, X,
  319. X, X, X, X, X, X, X, X, X, X, X, X, X, X, X, X,
  320. X, X, X, X, X, X, X, X, X, X, X, X, X, X, X, X,
  321. X, X, X, X, X, X, X, X, X, X, X, X, X, X, X, X,
  322. X, X, X, X, X, X, X, X, X, X, X, X, X, X, X, X,
  323. X, X, X, X, X, X, X, X, X, X, X, X, X, X, X, X,
  324. X, X, X, X, X, X, X, X, X, X, X, X, X, X, X, X,
  325. X, X, X, X, X, X, X, X, X, X, X, X, X, X, X, X,
  326. X, X, X, X, X, X, X, X, X, X, X, X, X, X, X, X,
  327. };
  328. /** Base64 decode <b>srclen</b> bytes of data from <b>src</b>. Write
  329. * the result into <b>dest</b>, if it will fit within <b>destlen</b>
  330. * bytes. Return the number of bytes written on success; -1 if
  331. * destlen is too short, or other failure.
  332. *
  333. * NOTE 1: destlen is checked conservatively, as though srclen contained no
  334. * spaces or padding.
  335. *
  336. * NOTE 2: This implementation does not check for the correct number of
  337. * padding "=" characters at the end of the string, and does not check
  338. * for internal padding characters.
  339. */
  340. int
  341. base64_decode(char *dest, size_t destlen, const char *src, size_t srclen)
  342. {
  343. const char *eos = src+srclen;
  344. uint32_t n=0;
  345. int n_idx=0;
  346. size_t di = 0;
  347. if (destlen > INT_MAX)
  348. return -1;
  349. /* Make sure we leave no uninitialized data in the destination buffer. */
  350. memset(dest, 0, destlen);
  351. /* Iterate over all the bytes in src. Each one will add 0 or 6 bits to the
  352. * value we're decoding. Accumulate bits in <b>n</b>, and whenever we have
  353. * 24 bits, batch them into 3 bytes and flush those bytes to dest.
  354. */
  355. for ( ; src < eos; ++src) {
  356. unsigned char c = (unsigned char) *src;
  357. uint8_t v = base64_decode_table[c];
  358. switch (v) {
  359. case X:
  360. /* This character isn't allowed in base64. */
  361. return -1;
  362. case SP:
  363. /* This character is whitespace, and has no effect. */
  364. continue;
  365. case PAD:
  366. /* We've hit an = character: the data is over. */
  367. goto end_of_loop;
  368. default:
  369. /* We have an actual 6-bit value. Append it to the bits in n. */
  370. n = (n<<6) | v;
  371. if ((++n_idx) == 4) {
  372. /* We've accumulated 24 bits in n. Flush them. */
  373. if (destlen < 3 || di > destlen - 3)
  374. return -1;
  375. dest[di++] = (n>>16);
  376. dest[di++] = (n>>8) & 0xff;
  377. dest[di++] = (n) & 0xff;
  378. n_idx = 0;
  379. n = 0;
  380. }
  381. }
  382. }
  383. end_of_loop:
  384. /* If we have leftover bits, we need to cope. */
  385. switch (n_idx) {
  386. case 0:
  387. default:
  388. /* No leftover bits. We win. */
  389. break;
  390. case 1:
  391. /* 6 leftover bits. That's invalid; we can't form a byte out of that. */
  392. return -1;
  393. case 2:
  394. /* 12 leftover bits: The last 4 are padding and the first 8 are data. */
  395. if (destlen < 1 || di > destlen - 1)
  396. return -1;
  397. dest[di++] = n >> 4;
  398. break;
  399. case 3:
  400. /* 18 leftover bits: The last 2 are padding and the first 16 are data. */
  401. if (destlen < 2 || di > destlen - 2)
  402. return -1;
  403. dest[di++] = n >> 10;
  404. dest[di++] = n >> 2;
  405. }
  406. tor_assert(di <= destlen);
  407. return (int)di;
  408. }
  409. #undef X
  410. #undef SP
  411. #undef PAD
  412. /** Encode the <b>srclen</b> bytes at <b>src</b> in a NUL-terminated,
  413. * uppercase hexadecimal string; store it in the <b>destlen</b>-byte buffer
  414. * <b>dest</b>.
  415. */
  416. void
  417. base16_encode(char *dest, size_t destlen, const char *src, size_t srclen)
  418. {
  419. const char *end;
  420. char *cp;
  421. tor_assert(srclen < SIZE_T_CEILING / 2 - 1);
  422. tor_assert(destlen >= BASE16_BUFSIZE(srclen));
  423. tor_assert(destlen < SIZE_T_CEILING);
  424. /* Make sure we leave no uninitialized data in the destination buffer. */
  425. memset(dest, 0, destlen);
  426. cp = dest;
  427. end = src+srclen;
  428. while (src<end) {
  429. *cp++ = "0123456789ABCDEF"[ (*(const uint8_t*)src) >> 4 ];
  430. *cp++ = "0123456789ABCDEF"[ (*(const uint8_t*)src) & 0xf ];
  431. ++src;
  432. }
  433. *cp = '\0';
  434. }
  435. /** Given a hexadecimal string of <b>srclen</b> bytes in <b>src</b>, decode
  436. * it and store the result in the <b>destlen</b>-byte buffer at <b>dest</b>.
  437. * Return the number of bytes decoded on success, -1 on failure. If
  438. * <b>destlen</b> is greater than INT_MAX or less than half of
  439. * <b>srclen</b>, -1 is returned. */
  440. int
  441. base16_decode(char *dest, size_t destlen, const char *src, size_t srclen)
  442. {
  443. const char *end;
  444. char *dest_orig = dest;
  445. int v1,v2;
  446. if ((srclen % 2) != 0)
  447. return -1;
  448. if (destlen < srclen/2 || destlen > INT_MAX)
  449. return -1;
  450. /* Make sure we leave no uninitialized data in the destination buffer. */
  451. memset(dest, 0, destlen);
  452. end = src+srclen;
  453. while (src<end) {
  454. v1 = hex_decode_digit(*src);
  455. v2 = hex_decode_digit(*(src+1));
  456. if (v1<0||v2<0)
  457. return -1;
  458. *(uint8_t*)dest = (v1<<4)|v2;
  459. ++dest;
  460. src+=2;
  461. }
  462. tor_assert((dest-dest_orig) <= (ptrdiff_t) destlen);
  463. return (int) (dest-dest_orig);
  464. }