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