- fix Building without Nagra not possible at Nagra_Merlin https://trac.streamboard...
[oscam.git] / cscrypt / bn_print.c
blobe01463c2d2f3eb62a314beea35a38018928c3fe3
1 #include "bn.h"
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.
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.
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).
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.
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)"
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.
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.]
63 #include <stdio.h>
64 #include <ctype.h>
65 #include "bn_lcl.h"
66 #include "buffer.h"
67 #include "openssl_mods.h"
69 static const char *Hex = "0123456789ABCDEF";
71 /* Must 'OPENSSL_free' the returned data */
72 char *BN_bn2hex(const BIGNUM *a)
74 int i, j, v, z = 0;
75 char *buf;
76 char *p;
78 buf = (char *)OPENSSL_malloc(a->top * BN_BYTES * 2 + 2);
79 if(buf == NULL)
81 goto err;
83 p = buf;
84 if(a->neg) { *(p++) = '-'; }
85 if(a->top == 0) { *(p++) = '0'; }
86 for(i = a->top - 1; i >= 0; i--)
88 for(j = BN_BITS2 - 8; j >= 0; j -= 8)
90 /* strip leading zeros */
91 v = ((int)(a->d[i] >> (long)j)) & 0xff;
92 if(z || (v != 0))
94 *(p++) = Hex[v >> 4];
95 *(p++) = Hex[v & 0x0f];
96 z = 1;
100 *p = '\0';
101 err:
102 return (buf);
105 /* Must 'OPENSSL_free' the returned data */
106 char *BN_bn2dec(const BIGNUM *a)
108 int i = 0, num;
109 char *buf = NULL;
110 char *p;
111 BIGNUM *t = NULL;
112 BN_ULONG *bn_data = NULL, *lp;
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))
120 goto err;
122 if((t = BN_dup(a)) == NULL) { goto err; }
124 p = buf;
125 lp = bn_data;
126 if(t->neg) { *(p++) = '-'; }
127 if(t->top == 0)
129 *(p++) = '0';
130 *(p++) = '\0';
132 else
134 while(!BN_is_zero(t))
136 *lp = BN_div_word(t, BN_DEC_CONV);
137 lp++;
139 lp--;
140 /* We now have a series of blocks, BN_DEC_NUM chars
141 * in length, where the last one needs truncation.
142 * The blocks need to be reversed in order. */
143 snprintf(p, num + 3 - (p - buf), BN_DEC_FMT1, *lp);
144 while(*p) { p++; }
145 while(lp != bn_data)
147 lp--;
148 snprintf(p, num + 3 - (p - buf), BN_DEC_FMT2, *lp);
149 while(*p) { p++; }
152 err:
153 if(bn_data != NULL) { OPENSSL_free(bn_data); }
154 if(t != NULL) { BN_free(t); }
155 return (buf);
158 int BN_hex2bn(BIGNUM **bn, const char *a)
160 BIGNUM *ret = NULL;
161 BN_ULONG l = 0;
162 int neg = 0, h, i, j, k, c;
163 int m = 0;
164 int num;
166 if((a == NULL) || (*a == '\0')) { return (0); }
168 if(*a == '-')
170 neg = 1;
171 a++;
174 for(i = 0; isxdigit((unsigned char) a[i]); i++)
175 { ; }
177 num = i + neg;
178 if(bn == NULL) { return (num); }
180 /* a is the start of the hex digits, and it is 'i' long */
181 if(*bn == NULL)
183 if((ret = BN_new()) == NULL) { return (0); }
185 else
187 ret = *bn;
188 BN_zero(ret);
191 /* i is the number of hex digests; */
192 if(bn_expand(ret, i * 4) == NULL) { goto err; }
194 j = i; /* least significant 'hex' */
195 h = 0;
196 while(j > 0)
198 m = ((BN_BYTES * 2) <= j) ? (BN_BYTES * 2) : j;
199 l = 0;
200 for(;;)
202 c = a[j - m];
203 if((c >= '0') && (c <= '9')) { k = c - '0'; }
204 else if((c >= 'a') && (c <= 'f')) { k = c - 'a' + 10; }
205 else if((c >= 'A') && (c <= 'F')) { k = c - 'A' + 10; }
206 else { k = 0; } /* paranoia */
207 l = (l << 4) | k;
209 if(--m <= 0)
211 ret->d[h++] = l;
212 break;
215 j -= (BN_BYTES * 2);
217 ret->top = h;
218 bn_fix_top(ret);
219 ret->neg = neg;
221 *bn = ret;
222 return (num);
223 err:
224 if(*bn == NULL) { BN_free(ret); }
225 return (0);
228 int BN_dec2bn(BIGNUM **bn, const char *a)
230 BIGNUM *ret = NULL;
231 BN_ULONG l = 0;
232 int neg = 0, i, j;
233 int num;
235 if((a == NULL) || (*a == '\0')) { return (0); }
236 if(*a == '-')
238 neg = 1;
239 a++;
242 for(i = 0; isdigit((unsigned char) a[i]); i++)
243 { ; }
245 num = i + neg;
246 if(bn == NULL) { return (num); }
248 /* a is the start of the digits, and it is 'i' long.
249 * We chop it into BN_DEC_NUM digits at a time */
250 if(*bn == NULL)
252 if((ret = BN_new()) == NULL) { return (0); }
254 else
256 ret = *bn;
257 BN_zero(ret);
260 /* i is the number of digests, a bit of an over expand; */
261 if(bn_expand(ret, i * 4) == NULL) { goto err; }
263 j = BN_DEC_NUM - (i % BN_DEC_NUM);
264 if(j == BN_DEC_NUM) { j = 0; }
265 l = 0;
266 while(*a)
268 l *= 10;
269 l += *a - '0';
270 a++;
271 if(++j == BN_DEC_NUM)
273 BN_mul_word(ret, BN_DEC_CONV);
274 BN_add_word(ret, l);
275 l = 0;
276 j = 0;
279 ret->neg = neg;
281 bn_fix_top(ret);
282 *bn = ret;
283 return (num);
284 err:
285 if(*bn == NULL) { BN_free(ret); }
286 return (0);
289 #ifdef BN_DEBUG
290 void bn_dump1(FILE *o, const char *a, BN_ULONG *b, int n)
292 int i;
293 fprintf(o, "%s=", a);
294 for(i = n - 1; i >= 0; i--)
295 { fprintf(o, "%08lX", b[i]); } /* assumes 32-bit BN_ULONG */
296 fprintf(o, "\n");
298 #endif
299 #endif