bn_print.c 11 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402
  1. /* crypto/bn/bn_print.c */
  2. /* Copyright (C) 1995-1998 Eric Young (eay@cryptsoft.com)
  3. * All rights reserved.
  4. *
  5. * This package is an SSL implementation written
  6. * by Eric Young (eay@cryptsoft.com).
  7. * The implementation was written so as to conform with Netscapes SSL.
  8. *
  9. * This library is free for commercial and non-commercial use as long as
  10. * the following conditions are aheared to. The following conditions
  11. * apply to all code found in this distribution, be it the RC4, RSA,
  12. * lhash, DES, etc., code; not just the SSL code. The SSL documentation
  13. * included with this distribution is covered by the same copyright terms
  14. * except that the holder is Tim Hudson (tjh@cryptsoft.com).
  15. *
  16. * Copyright remains Eric Young's, and as such any Copyright notices in
  17. * the code are not to be removed.
  18. * If this package is used in a product, Eric Young should be given attribution
  19. * as the author of the parts of the library used.
  20. * This can be in the form of a textual message at program startup or
  21. * in documentation (online or textual) provided with the package.
  22. *
  23. * Redistribution and use in source and binary forms, with or without
  24. * modification, are permitted provided that the following conditions
  25. * are met:
  26. * 1. Redistributions of source code must retain the copyright
  27. * notice, this list of conditions and the following disclaimer.
  28. * 2. Redistributions in binary form must reproduce the above copyright
  29. * notice, this list of conditions and the following disclaimer in the
  30. * documentation and/or other materials provided with the distribution.
  31. * 3. All advertising materials mentioning features or use of this software
  32. * must display the following acknowledgement:
  33. * "This product includes cryptographic software written by
  34. * Eric Young (eay@cryptsoft.com)"
  35. * The word 'cryptographic' can be left out if the rouines from the library
  36. * being used are not cryptographic related :-).
  37. * 4. If you include any Windows specific code (or a derivative thereof) from
  38. * the apps directory (application code) you must include an acknowledgement:
  39. * "This product includes software written by Tim Hudson (tjh@cryptsoft.com)"
  40. *
  41. * THIS SOFTWARE IS PROVIDED BY ERIC YOUNG ``AS IS'' AND
  42. * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
  43. * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
  44. * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
  45. * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
  46. * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
  47. * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
  48. * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
  49. * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
  50. * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
  51. * SUCH DAMAGE.
  52. *
  53. * The licence and distribution terms for any publically available version or
  54. * derivative of this code cannot be changed. i.e. this code cannot simply be
  55. * copied and put under another distribution licence
  56. * [including the GNU Public Licence.]
  57. */
  58. #include <stdio.h>
  59. #include <ctype.h>
  60. #include <limits.h>
  61. #include "cryptlib.h"
  62. #include <openssl/buffer.h>
  63. #include "bn_lcl.h"
  64. static const char Hex[] = "0123456789ABCDEF";
  65. /* Must 'OPENSSL_free' the returned data */
  66. char *BN_bn2hex(const BIGNUM *a)
  67. {
  68. int i, j, v, z = 0;
  69. char *buf;
  70. char *p;
  71. if (BN_is_zero(a))
  72. return OPENSSL_strdup("0");
  73. buf = OPENSSL_malloc(a->top * BN_BYTES * 2 + 2);
  74. if (buf == NULL) {
  75. BNerr(BN_F_BN_BN2HEX, ERR_R_MALLOC_FAILURE);
  76. goto err;
  77. }
  78. p = buf;
  79. if (a->neg)
  80. *(p++) = '-';
  81. for (i = a->top - 1; i >= 0; i--) {
  82. for (j = BN_BITS2 - 8; j >= 0; j -= 8) {
  83. /* strip leading zeros */
  84. v = ((int)(a->d[i] >> (long)j)) & 0xff;
  85. if (z || (v != 0)) {
  86. *(p++) = Hex[v >> 4];
  87. *(p++) = Hex[v & 0x0f];
  88. z = 1;
  89. }
  90. }
  91. }
  92. *p = '\0';
  93. err:
  94. return (buf);
  95. }
  96. /* Must 'OPENSSL_free' the returned data */
  97. char *BN_bn2dec(const BIGNUM *a)
  98. {
  99. int i = 0, num, ok = 0;
  100. char *buf = NULL;
  101. char *p;
  102. BIGNUM *t = NULL;
  103. BN_ULONG *bn_data = NULL, *lp;
  104. int bn_data_num;
  105. /*-
  106. * get an upper bound for the length of the decimal integer
  107. * num <= (BN_num_bits(a) + 1) * log(2)
  108. * <= 3 * BN_num_bits(a) * 0.1001 + log(2) + 1 (rounding error)
  109. * <= BN_num_bits(a)/10 + BN_num_bits/1000 + 1 + 1
  110. */
  111. i = BN_num_bits(a) * 3;
  112. num = (i / 10 + i / 1000 + 1) + 1;
  113. bn_data_num = num / BN_DEC_NUM + 1;
  114. bn_data = OPENSSL_malloc(bn_data_num * sizeof(BN_ULONG));
  115. buf = OPENSSL_malloc(num + 3);
  116. if ((buf == NULL) || (bn_data == NULL)) {
  117. BNerr(BN_F_BN_BN2DEC, ERR_R_MALLOC_FAILURE);
  118. goto err;
  119. }
  120. if ((t = BN_dup(a)) == NULL)
  121. goto err;
  122. #define BUF_REMAIN (num+3 - (size_t)(p - buf))
  123. p = buf;
  124. lp = bn_data;
  125. if (BN_is_zero(t)) {
  126. *(p++) = '0';
  127. *(p++) = '\0';
  128. } else {
  129. if (BN_is_negative(t))
  130. *p++ = '-';
  131. while (!BN_is_zero(t)) {
  132. if (lp - bn_data >= bn_data_num)
  133. goto err;
  134. *lp = BN_div_word(t, BN_DEC_CONV);
  135. if (*lp == (BN_ULONG)-1)
  136. goto err;
  137. lp++;
  138. }
  139. lp--;
  140. /*
  141. * We now have a series of blocks, BN_DEC_NUM chars in length, where
  142. * the last one needs truncation. The blocks need to be reversed in
  143. * order.
  144. */
  145. BIO_snprintf(p, BUF_REMAIN, BN_DEC_FMT1, *lp);
  146. while (*p)
  147. p++;
  148. while (lp != bn_data) {
  149. lp--;
  150. BIO_snprintf(p, BUF_REMAIN, BN_DEC_FMT2, *lp);
  151. while (*p)
  152. p++;
  153. }
  154. }
  155. ok = 1;
  156. err:
  157. if (bn_data != NULL)
  158. OPENSSL_free(bn_data);
  159. if (t != NULL)
  160. BN_free(t);
  161. if (!ok && buf) {
  162. OPENSSL_free(buf);
  163. buf = NULL;
  164. }
  165. return (buf);
  166. }
  167. int BN_hex2bn(BIGNUM **bn, const char *a)
  168. {
  169. BIGNUM *ret = NULL;
  170. BN_ULONG l = 0;
  171. int neg = 0, h, m, i, j, k, c;
  172. int num;
  173. if ((a == NULL) || (*a == '\0'))
  174. return (0);
  175. if (*a == '-') {
  176. neg = 1;
  177. a++;
  178. }
  179. for (i = 0; i <= (INT_MAX/4) && isxdigit((unsigned char)a[i]); i++)
  180. continue;
  181. if (i > INT_MAX/4)
  182. goto err;
  183. num = i + neg;
  184. if (bn == NULL)
  185. return (num);
  186. /* a is the start of the hex digits, and it is 'i' long */
  187. if (*bn == NULL) {
  188. if ((ret = BN_new()) == NULL)
  189. return (0);
  190. } else {
  191. ret = *bn;
  192. BN_zero(ret);
  193. }
  194. /* i is the number of hex digits */
  195. if (bn_expand(ret, i * 4) == NULL)
  196. goto err;
  197. j = i; /* least significant 'hex' */
  198. m = 0;
  199. h = 0;
  200. while (j > 0) {
  201. m = ((BN_BYTES * 2) <= j) ? (BN_BYTES * 2) : j;
  202. l = 0;
  203. for (;;) {
  204. c = a[j - m];
  205. if ((c >= '0') && (c <= '9'))
  206. k = c - '0';
  207. else if ((c >= 'a') && (c <= 'f'))
  208. k = c - 'a' + 10;
  209. else if ((c >= 'A') && (c <= 'F'))
  210. k = c - 'A' + 10;
  211. else
  212. k = 0; /* paranoia */
  213. l = (l << 4) | k;
  214. if (--m <= 0) {
  215. ret->d[h++] = l;
  216. break;
  217. }
  218. }
  219. j -= (BN_BYTES * 2);
  220. }
  221. ret->top = h;
  222. bn_correct_top(ret);
  223. *bn = ret;
  224. bn_check_top(ret);
  225. /* Don't set the negative flag if it's zero. */
  226. if (ret->top != 0)
  227. ret->neg = neg;
  228. return (num);
  229. err:
  230. if (*bn == NULL)
  231. BN_free(ret);
  232. return (0);
  233. }
  234. int BN_dec2bn(BIGNUM **bn, const char *a)
  235. {
  236. BIGNUM *ret = NULL;
  237. BN_ULONG l = 0;
  238. int neg = 0, i, j;
  239. int num;
  240. if ((a == NULL) || (*a == '\0'))
  241. return (0);
  242. if (*a == '-') {
  243. neg = 1;
  244. a++;
  245. }
  246. for (i = 0; i <= (INT_MAX/4) && isdigit((unsigned char)a[i]); i++)
  247. continue;
  248. if (i > INT_MAX/4)
  249. goto err;
  250. num = i + neg;
  251. if (bn == NULL)
  252. return (num);
  253. /*
  254. * a is the start of the digits, and it is 'i' long. We chop it into
  255. * BN_DEC_NUM digits at a time
  256. */
  257. if (*bn == NULL) {
  258. if ((ret = BN_new()) == NULL)
  259. return (0);
  260. } else {
  261. ret = *bn;
  262. BN_zero(ret);
  263. }
  264. /* i is the number of digits, a bit of an over expand */
  265. if (bn_expand(ret, i * 4) == NULL)
  266. goto err;
  267. j = BN_DEC_NUM - (i % BN_DEC_NUM);
  268. if (j == BN_DEC_NUM)
  269. j = 0;
  270. l = 0;
  271. while (--i >= 0) {
  272. l *= 10;
  273. l += *a - '0';
  274. a++;
  275. if (++j == BN_DEC_NUM) {
  276. BN_mul_word(ret, BN_DEC_CONV);
  277. BN_add_word(ret, l);
  278. l = 0;
  279. j = 0;
  280. }
  281. }
  282. bn_correct_top(ret);
  283. *bn = ret;
  284. bn_check_top(ret);
  285. /* Don't set the negative flag if it's zero. */
  286. if (ret->top != 0)
  287. ret->neg = neg;
  288. return (num);
  289. err:
  290. if (*bn == NULL)
  291. BN_free(ret);
  292. return (0);
  293. }
  294. int BN_asc2bn(BIGNUM **bn, const char *a)
  295. {
  296. const char *p = a;
  297. if (*p == '-')
  298. p++;
  299. if (p[0] == '0' && (p[1] == 'X' || p[1] == 'x')) {
  300. if (!BN_hex2bn(bn, p + 2))
  301. return 0;
  302. } else {
  303. if (!BN_dec2bn(bn, p))
  304. return 0;
  305. }
  306. /* Don't set the negative flag if it's zero. */
  307. if (*a == '-' && (*bn)->top != 0)
  308. (*bn)->neg = 1;
  309. return 1;
  310. }
  311. #ifndef OPENSSL_NO_BIO
  312. # ifndef OPENSSL_NO_FP_API
  313. int BN_print_fp(FILE *fp, const BIGNUM *a)
  314. {
  315. BIO *b;
  316. int ret;
  317. if ((b = BIO_new(BIO_s_file())) == NULL)
  318. return (0);
  319. BIO_set_fp(b, fp, BIO_NOCLOSE);
  320. ret = BN_print(b, a);
  321. BIO_free(b);
  322. return (ret);
  323. }
  324. # endif
  325. int BN_print(BIO *bp, const BIGNUM *a)
  326. {
  327. int i, j, v, z = 0;
  328. int ret = 0;
  329. if ((a->neg) && (BIO_write(bp, "-", 1) != 1))
  330. goto end;
  331. if (BN_is_zero(a) && (BIO_write(bp, "0", 1) != 1))
  332. goto end;
  333. for (i = a->top - 1; i >= 0; i--) {
  334. for (j = BN_BITS2 - 4; j >= 0; j -= 4) {
  335. /* strip leading zeros */
  336. v = ((int)(a->d[i] >> (long)j)) & 0x0f;
  337. if (z || (v != 0)) {
  338. if (BIO_write(bp, &(Hex[v]), 1) != 1)
  339. goto end;
  340. z = 1;
  341. }
  342. }
  343. }
  344. ret = 1;
  345. end:
  346. return (ret);
  347. }
  348. #endif
  349. char *BN_options(void)
  350. {
  351. static int init = 0;
  352. static char data[16];
  353. if (!init) {
  354. init++;
  355. #ifdef BN_LLONG
  356. BIO_snprintf(data, sizeof(data), "bn(%d,%d)",
  357. (int)sizeof(BN_ULLONG) * 8, (int)sizeof(BN_ULONG) * 8);
  358. #else
  359. BIO_snprintf(data, sizeof(data), "bn(%d,%d)",
  360. (int)sizeof(BN_ULONG) * 8, (int)sizeof(BN_ULONG) * 8);
  361. #endif
  362. }
  363. return (data);
  364. }