bn_print.c 10 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388
  1. /* crypto/bn/bn_print.c */
  2. /* Copyright (C) 1995-1998 Eric Young ([email protected])
  3. * All rights reserved.
  4. *
  5. * This package is an SSL implementation written
  6. * by Eric Young ([email protected]).
  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 ([email protected]).
  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 ([email protected])"
  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 ([email protected])"
  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 "cryptlib.h"
  61. #include <openssl/buffer.h>
  62. #include "bn_lcl.h"
  63. static const char Hex[] = "0123456789ABCDEF";
  64. /* Must 'OPENSSL_free' the returned data */
  65. char *BN_bn2hex(const BIGNUM *a)
  66. {
  67. int i, j, v, z = 0;
  68. char *buf;
  69. char *p;
  70. if (a->neg && BN_is_zero(a)) {
  71. /* "-0" == 3 bytes including NULL terminator */
  72. buf = OPENSSL_malloc(3);
  73. } else {
  74. buf = OPENSSL_malloc(a->top * BN_BYTES * 2 + 2);
  75. }
  76. if (buf == NULL) {
  77. BNerr(BN_F_BN_BN2HEX, ERR_R_MALLOC_FAILURE);
  78. goto err;
  79. }
  80. p = buf;
  81. if (a->neg)
  82. *(p++) = '-';
  83. if (BN_is_zero(a))
  84. *(p++) = '0';
  85. for (i = a->top - 1; i >= 0; i--) {
  86. for (j = BN_BITS2 - 8; j >= 0; j -= 8) {
  87. /* strip leading zeros */
  88. v = ((int)(a->d[i] >> (long)j)) & 0xff;
  89. if (z || (v != 0)) {
  90. *(p++) = Hex[v >> 4];
  91. *(p++) = Hex[v & 0x0f];
  92. z = 1;
  93. }
  94. }
  95. }
  96. *p = '\0';
  97. err:
  98. return (buf);
  99. }
  100. /* Must 'OPENSSL_free' the returned data */
  101. char *BN_bn2dec(const BIGNUM *a)
  102. {
  103. int i = 0, num, ok = 0;
  104. char *buf = NULL;
  105. char *p;
  106. BIGNUM *t = NULL;
  107. BN_ULONG *bn_data = NULL, *lp;
  108. /*-
  109. * get an upper bound for the length of the decimal integer
  110. * num <= (BN_num_bits(a) + 1) * log(2)
  111. * <= 3 * BN_num_bits(a) * 0.1001 + log(2) + 1 (rounding error)
  112. * <= BN_num_bits(a)/10 + BN_num_bits/1000 + 1 + 1
  113. */
  114. i = BN_num_bits(a) * 3;
  115. num = (i / 10 + i / 1000 + 1) + 1;
  116. bn_data =
  117. (BN_ULONG *)OPENSSL_malloc((num / BN_DEC_NUM + 1) * sizeof(BN_ULONG));
  118. buf = (char *)OPENSSL_malloc(num + 3);
  119. if ((buf == NULL) || (bn_data == NULL)) {
  120. BNerr(BN_F_BN_BN2DEC, ERR_R_MALLOC_FAILURE);
  121. goto err;
  122. }
  123. if ((t = BN_dup(a)) == NULL)
  124. goto err;
  125. #define BUF_REMAIN (num+3 - (size_t)(p - buf))
  126. p = buf;
  127. lp = bn_data;
  128. if (BN_is_zero(t)) {
  129. *(p++) = '0';
  130. *(p++) = '\0';
  131. } else {
  132. if (BN_is_negative(t))
  133. *p++ = '-';
  134. i = 0;
  135. while (!BN_is_zero(t)) {
  136. *lp = BN_div_word(t, BN_DEC_CONV);
  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; isxdigit((unsigned char)a[i]); i++) ;
  180. num = i + neg;
  181. if (bn == NULL)
  182. return (num);
  183. /* a is the start of the hex digits, and it is 'i' long */
  184. if (*bn == NULL) {
  185. if ((ret = BN_new()) == NULL)
  186. return (0);
  187. } else {
  188. ret = *bn;
  189. BN_zero(ret);
  190. }
  191. /* i is the number of hex digests; */
  192. if (bn_expand(ret, i * 4) == NULL)
  193. goto err;
  194. j = i; /* least significant 'hex' */
  195. m = 0;
  196. h = 0;
  197. while (j > 0) {
  198. m = ((BN_BYTES * 2) <= j) ? (BN_BYTES * 2) : j;
  199. l = 0;
  200. for (;;) {
  201. c = a[j - m];
  202. if ((c >= '0') && (c <= '9'))
  203. k = c - '0';
  204. else if ((c >= 'a') && (c <= 'f'))
  205. k = c - 'a' + 10;
  206. else if ((c >= 'A') && (c <= 'F'))
  207. k = c - 'A' + 10;
  208. else
  209. k = 0; /* paranoia */
  210. l = (l << 4) | k;
  211. if (--m <= 0) {
  212. ret->d[h++] = l;
  213. break;
  214. }
  215. }
  216. j -= (BN_BYTES * 2);
  217. }
  218. ret->top = h;
  219. bn_correct_top(ret);
  220. ret->neg = neg;
  221. *bn = ret;
  222. bn_check_top(ret);
  223. return (num);
  224. err:
  225. if (*bn == NULL)
  226. BN_free(ret);
  227. return (0);
  228. }
  229. int BN_dec2bn(BIGNUM **bn, const char *a)
  230. {
  231. BIGNUM *ret = NULL;
  232. BN_ULONG l = 0;
  233. int neg = 0, i, j;
  234. int num;
  235. if ((a == NULL) || (*a == '\0'))
  236. return (0);
  237. if (*a == '-') {
  238. neg = 1;
  239. a++;
  240. }
  241. for (i = 0; isdigit((unsigned char)a[i]); i++) ;
  242. num = i + neg;
  243. if (bn == NULL)
  244. return (num);
  245. /*
  246. * a is the start of the digits, and it is 'i' long. We chop it into
  247. * BN_DEC_NUM digits at a time
  248. */
  249. if (*bn == NULL) {
  250. if ((ret = BN_new()) == NULL)
  251. return (0);
  252. } else {
  253. ret = *bn;
  254. BN_zero(ret);
  255. }
  256. /* i is the number of digests, a bit of an over expand; */
  257. if (bn_expand(ret, i * 4) == NULL)
  258. goto err;
  259. j = BN_DEC_NUM - (i % BN_DEC_NUM);
  260. if (j == BN_DEC_NUM)
  261. j = 0;
  262. l = 0;
  263. while (*a) {
  264. l *= 10;
  265. l += *a - '0';
  266. a++;
  267. if (++j == BN_DEC_NUM) {
  268. BN_mul_word(ret, BN_DEC_CONV);
  269. BN_add_word(ret, l);
  270. l = 0;
  271. j = 0;
  272. }
  273. }
  274. ret->neg = neg;
  275. bn_correct_top(ret);
  276. *bn = ret;
  277. bn_check_top(ret);
  278. return (num);
  279. err:
  280. if (*bn == NULL)
  281. BN_free(ret);
  282. return (0);
  283. }
  284. int BN_asc2bn(BIGNUM **bn, const char *a)
  285. {
  286. const char *p = a;
  287. if (*p == '-')
  288. p++;
  289. if (p[0] == '0' && (p[1] == 'X' || p[1] == 'x')) {
  290. if (!BN_hex2bn(bn, p + 2))
  291. return 0;
  292. } else {
  293. if (!BN_dec2bn(bn, p))
  294. return 0;
  295. }
  296. if (*a == '-')
  297. (*bn)->neg = 1;
  298. return 1;
  299. }
  300. #ifndef OPENSSL_NO_BIO
  301. # ifndef OPENSSL_NO_FP_API
  302. int BN_print_fp(FILE *fp, const BIGNUM *a)
  303. {
  304. BIO *b;
  305. int ret;
  306. if ((b = BIO_new(BIO_s_file())) == NULL)
  307. return (0);
  308. BIO_set_fp(b, fp, BIO_NOCLOSE);
  309. ret = BN_print(b, a);
  310. BIO_free(b);
  311. return (ret);
  312. }
  313. # endif
  314. int BN_print(BIO *bp, const BIGNUM *a)
  315. {
  316. int i, j, v, z = 0;
  317. int ret = 0;
  318. if ((a->neg) && (BIO_write(bp, "-", 1) != 1))
  319. goto end;
  320. if (BN_is_zero(a) && (BIO_write(bp, "0", 1) != 1))
  321. goto end;
  322. for (i = a->top - 1; i >= 0; i--) {
  323. for (j = BN_BITS2 - 4; j >= 0; j -= 4) {
  324. /* strip leading zeros */
  325. v = ((int)(a->d[i] >> (long)j)) & 0x0f;
  326. if (z || (v != 0)) {
  327. if (BIO_write(bp, &(Hex[v]), 1) != 1)
  328. goto end;
  329. z = 1;
  330. }
  331. }
  332. }
  333. ret = 1;
  334. end:
  335. return (ret);
  336. }
  337. #endif
  338. char *BN_options(void)
  339. {
  340. static int init = 0;
  341. static char data[16];
  342. if (!init) {
  343. init++;
  344. #ifdef BN_LLONG
  345. BIO_snprintf(data, sizeof data, "bn(%d,%d)",
  346. (int)sizeof(BN_ULLONG) * 8, (int)sizeof(BN_ULONG) * 8);
  347. #else
  348. BIO_snprintf(data, sizeof data, "bn(%d,%d)",
  349. (int)sizeof(BN_ULONG) * 8, (int)sizeof(BN_ULONG) * 8);
  350. #endif
  351. }
  352. return (data);
  353. }