cscrypt/bn_print.c

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