bn_print.c 7.8 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332
  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 "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. buf=(char *)OPENSSL_malloc(a->top*BN_BYTES*2+2);
  71. if (buf == NULL)
  72. {
  73. BNerr(BN_F_BN_BN2HEX,ERR_R_MALLOC_FAILURE);
  74. goto err;
  75. }
  76. p=buf;
  77. if (a->neg) *(p++)='-';
  78. if (a->top == 0) *(p++)='0';
  79. for (i=a->top-1; i >=0; i--)
  80. {
  81. for (j=BN_BITS2-8; j >= 0; j-=8)
  82. {
  83. /* strip leading zeros */
  84. v=((int)(a->d[i]>>(long)j))&0xff;
  85. if (z || (v != 0))
  86. {
  87. *(p++)=Hex[v>>4];
  88. *(p++)=Hex[v&0x0f];
  89. z=1;
  90. }
  91. }
  92. }
  93. *p='\0';
  94. err:
  95. return(buf);
  96. }
  97. /* Must 'OPENSSL_free' the returned data */
  98. char *BN_bn2dec(const BIGNUM *a)
  99. {
  100. int i=0,num;
  101. char *buf=NULL;
  102. char *p;
  103. BIGNUM *t=NULL;
  104. BN_ULONG *bn_data=NULL,*lp;
  105. i=BN_num_bits(a)*3;
  106. num=(i/10+i/1000+3)+1;
  107. bn_data=(BN_ULONG *)OPENSSL_malloc((num/BN_DEC_NUM+1)*sizeof(BN_ULONG));
  108. buf=(char *)OPENSSL_malloc(num+3);
  109. if ((buf == NULL) || (bn_data == NULL))
  110. {
  111. BNerr(BN_F_BN_BN2DEC,ERR_R_MALLOC_FAILURE);
  112. goto err;
  113. }
  114. if ((t=BN_dup(a)) == NULL) goto err;
  115. p=buf;
  116. lp=bn_data;
  117. if (t->neg) *(p++)='-';
  118. if (t->top == 0)
  119. {
  120. *(p++)='0';
  121. *(p++)='\0';
  122. }
  123. else
  124. {
  125. i=0;
  126. while (!BN_is_zero(t))
  127. {
  128. *lp=BN_div_word(t,BN_DEC_CONV);
  129. lp++;
  130. }
  131. lp--;
  132. /* We now have a series of blocks, BN_DEC_NUM chars
  133. * in length, where the last one needs truncation.
  134. * The blocks need to be reversed in order. */
  135. sprintf(p,BN_DEC_FMT1,*lp);
  136. while (*p) p++;
  137. while (lp != bn_data)
  138. {
  139. lp--;
  140. sprintf(p,BN_DEC_FMT2,*lp);
  141. while (*p) p++;
  142. }
  143. }
  144. err:
  145. if (bn_data != NULL) OPENSSL_free(bn_data);
  146. if (t != NULL) BN_free(t);
  147. return(buf);
  148. }
  149. int BN_hex2bn(BIGNUM **bn, const char *a)
  150. {
  151. BIGNUM *ret=NULL;
  152. BN_ULONG l=0;
  153. int neg=0,h,m,i,j,k,c;
  154. int num;
  155. if ((a == NULL) || (*a == '\0')) return(0);
  156. if (*a == '-') { neg=1; a++; }
  157. for (i=0; isxdigit((unsigned char) a[i]); i++)
  158. ;
  159. num=i+neg;
  160. if (bn == NULL) return(num);
  161. /* a is the start of the hex digits, and it is 'i' long */
  162. if (*bn == NULL)
  163. {
  164. if ((ret=BN_new()) == NULL) return(0);
  165. }
  166. else
  167. {
  168. ret= *bn;
  169. BN_zero(ret);
  170. }
  171. /* i is the number of hex digests; */
  172. if (bn_expand(ret,i*4) == NULL) goto err;
  173. j=i; /* least significant 'hex' */
  174. m=0;
  175. h=0;
  176. while (j > 0)
  177. {
  178. m=((BN_BYTES*2) <= j)?(BN_BYTES*2):j;
  179. l=0;
  180. for (;;)
  181. {
  182. c=a[j-m];
  183. if ((c >= '0') && (c <= '9')) k=c-'0';
  184. else if ((c >= 'a') && (c <= 'f')) k=c-'a'+10;
  185. else if ((c >= 'A') && (c <= 'F')) k=c-'A'+10;
  186. else k=0; /* paranoia */
  187. l=(l<<4)|k;
  188. if (--m <= 0)
  189. {
  190. ret->d[h++]=l;
  191. break;
  192. }
  193. }
  194. j-=(BN_BYTES*2);
  195. }
  196. ret->top=h;
  197. bn_fix_top(ret);
  198. ret->neg=neg;
  199. *bn=ret;
  200. return(num);
  201. err:
  202. if (*bn == NULL) BN_free(ret);
  203. return(0);
  204. }
  205. int BN_dec2bn(BIGNUM **bn, const char *a)
  206. {
  207. BIGNUM *ret=NULL;
  208. BN_ULONG l=0;
  209. int neg=0,i,j;
  210. int num;
  211. if ((a == NULL) || (*a == '\0')) return(0);
  212. if (*a == '-') { neg=1; a++; }
  213. for (i=0; isdigit((unsigned char) a[i]); i++)
  214. ;
  215. num=i+neg;
  216. if (bn == NULL) return(num);
  217. /* a is the start of the digits, and it is 'i' long.
  218. * We chop it into BN_DEC_NUM digits at a time */
  219. if (*bn == NULL)
  220. {
  221. if ((ret=BN_new()) == NULL) return(0);
  222. }
  223. else
  224. {
  225. ret= *bn;
  226. BN_zero(ret);
  227. }
  228. /* i is the number of digests, a bit of an over expand; */
  229. if (bn_expand(ret,i*4) == NULL) goto err;
  230. j=BN_DEC_NUM-(i%BN_DEC_NUM);
  231. if (j == BN_DEC_NUM) j=0;
  232. l=0;
  233. while (*a)
  234. {
  235. l*=10;
  236. l+= *a-'0';
  237. a++;
  238. if (++j == BN_DEC_NUM)
  239. {
  240. BN_mul_word(ret,BN_DEC_CONV);
  241. BN_add_word(ret,l);
  242. l=0;
  243. j=0;
  244. }
  245. }
  246. ret->neg=neg;
  247. bn_fix_top(ret);
  248. *bn=ret;
  249. return(num);
  250. err:
  251. if (*bn == NULL) BN_free(ret);
  252. return(0);
  253. }
  254. #ifndef OPENSSL_NO_BIO
  255. #ifndef OPENSSL_NO_FP_API
  256. int BN_print_fp(FILE *fp, const BIGNUM *a)
  257. {
  258. BIO *b;
  259. int ret;
  260. if ((b=BIO_new(BIO_s_file())) == NULL)
  261. return(0);
  262. BIO_set_fp(b,fp,BIO_NOCLOSE);
  263. ret=BN_print(b,a);
  264. BIO_free(b);
  265. return(ret);
  266. }
  267. #endif
  268. int BN_print(BIO *bp, const BIGNUM *a)
  269. {
  270. int i,j,v,z=0;
  271. int ret=0;
  272. if ((a->neg) && (BIO_write(bp,"-",1) != 1)) goto end;
  273. if ((a->top == 0) && (BIO_write(bp,"0",1) != 1)) goto end;
  274. for (i=a->top-1; i >=0; i--)
  275. {
  276. for (j=BN_BITS2-4; j >= 0; j-=4)
  277. {
  278. /* strip leading zeros */
  279. v=((int)(a->d[i]>>(long)j))&0x0f;
  280. if (z || (v != 0))
  281. {
  282. if (BIO_write(bp,&(Hex[v]),1) != 1)
  283. goto end;
  284. z=1;
  285. }
  286. }
  287. }
  288. ret=1;
  289. end:
  290. return(ret);
  291. }
  292. #endif
  293. #ifdef BN_DEBUG
  294. void bn_dump1(FILE *o, const char *a, const BN_ULONG *b,int n)
  295. {
  296. int i;
  297. fprintf(o, "%s=", a);
  298. for (i=n-1;i>=0;i--)
  299. fprintf(o, "%08lX", b[i]); /* assumes 32-bit BN_ULONG */
  300. fprintf(o, "\n");
  301. }
  302. #endif