1 /* crypto/bn/bn_lib.c */
2 /* Copyright (C) 1995-1998 Eric Young (eay@cryptsoft.com)
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.
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).
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.
23 * Redistribution and use in source and binary forms, with or without
24 * modification, are permitted provided that the following conditions
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)"
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
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.]
63 char *BN_version="Big Number part of SSLeay/OpenSSL 0.9.1c 23-Dec-1998";
65 /* For a 32 bit machine
75 int bn_limit_num=8; /* (1<<bn_limit_bits) */
76 int bn_limit_bits_low=0;
77 int bn_limit_num_low=8; /* (1<<bn_limit_bits_low) */
78 int bn_limit_bits_high=0;
79 int bn_limit_num_high=8; /* (1<<bn_limit_bits_high) */
80 int bn_limit_bits_mont=0;
81 int bn_limit_num_mont=8; /* (1<<bn_limit_bits_mont) */
83 void BN_set_params(mult,high,low,mont)
84 int mult,high,low,mont;
88 if (mult > (sizeof(int)*8)-1)
95 if (high > (sizeof(int)*8)-1)
97 bn_limit_bits_high=high;
98 bn_limit_num_high=1<<high;
102 if (low > (sizeof(int)*8)-1)
104 bn_limit_bits_low=low;
105 bn_limit_num_low=1<<low;
109 if (mont > (sizeof(int)*8)-1)
110 mont=sizeof(int)*8-1;
111 bn_limit_bits_mont=mont;
112 bn_limit_num_mont=1<<mont;
116 int BN_get_params(which)
119 if (which == 0) return(bn_limit_bits);
120 else if (which == 1) return(bn_limit_bits_high);
121 else if (which == 2) return(bn_limit_bits_low);
122 else if (which == 3) return(bn_limit_bits_mont);
126 BIGNUM *BN_value_one()
128 static BN_ULONG data_one=1L;
129 static BIGNUM const_one={&data_one,1,1,0};
137 static char data[16];
143 sprintf(data,"bn(%d,%d)",(int)sizeof(BN_ULLONG)*8,
144 (int)sizeof(BN_ULONG)*8);
146 sprintf(data,"bn(%d,%d)",(int)sizeof(BN_ULONG)*8,
147 (int)sizeof(BN_ULONG)*8);
153 int BN_num_bits_word(l)
156 static char bits[256]={
157 0,1,2,2,3,3,3,3,4,4,4,4,4,4,4,4,
158 5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,
159 6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,
160 6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,
161 7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,
162 7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,
163 7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,
164 7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,
165 8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,
166 8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,
167 8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,
168 8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,
169 8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,
170 8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,
171 8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,
172 8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,
175 #if defined(SIXTY_FOUR_BIT_LONG)
176 if (l & 0xffffffff00000000L)
178 if (l & 0xffff000000000000L)
180 if (l & 0xff00000000000000L)
182 return(bits[(int)(l>>56)]+56);
184 else return(bits[(int)(l>>48)]+48);
188 if (l & 0x0000ff0000000000L)
190 return(bits[(int)(l>>40)]+40);
192 else return(bits[(int)(l>>32)]+32);
197 #ifdef SIXTY_FOUR_BIT
198 if (l & 0xffffffff00000000LL)
200 if (l & 0xffff000000000000LL)
202 if (l & 0xff00000000000000LL)
204 return(bits[(int)(l>>56)]+56);
206 else return(bits[(int)(l>>48)]+48);
210 if (l & 0x0000ff0000000000LL)
212 return(bits[(int)(l>>40)]+40);
214 else return(bits[(int)(l>>32)]+32);
221 #if defined(THIRTY_TWO_BIT) || defined(SIXTY_FOUR_BIT) || defined(SIXTY_FOUR_BIT_LONG)
225 return(bits[(int)(l>>24L)]+24);
226 else return(bits[(int)(l>>16L)]+16);
231 #if defined(SIXTEEN_BIT) || defined(THIRTY_TWO_BIT) || defined(SIXTY_FOUR_BIT) || defined(SIXTY_FOUR_BIT_LONG)
233 return(bits[(int)(l>>8)]+8);
236 return(bits[(int)(l )] );
249 if (a->top == 0) return(0);
251 i=(a->top-1)*BN_BITS2;
254 #if !defined(NO_STDIO) && !defined(WIN16)
255 fprintf(stderr,"BAD TOP VALUE\n");
259 return(i+BN_num_bits_word(l));
262 void BN_clear_free(a)
267 if (a == NULL) return;
270 memset(a->d,0,a->max*sizeof(a->d[0]));
271 if (!(BN_get_flags(a,BN_FLG_STATIC_DATA)))
274 i=BN_get_flags(a,BN_FLG_MALLOCED);
275 memset(a,0,sizeof(BIGNUM));
283 if (a == NULL) return;
284 if ((a->d != NULL) && !(BN_get_flags(a,BN_FLG_STATIC_DATA)))
286 a->flags|=BN_FLG_FREE; /* REMOVE? */
287 if (a->flags & BN_FLG_MALLOCED)
294 memset(a,0,sizeof(BIGNUM));
301 if ((ret=(BIGNUM *)Malloc(sizeof(BIGNUM))) == NULL)
303 BNerr(BN_F_BN_NEW,ERR_R_MALLOC_FAILURE);
306 ret->flags=BN_FLG_MALLOCED;
319 ret=(BN_CTX *)Malloc(sizeof(BN_CTX));
322 BNerr(BN_F_BN_CTX_NEW,ERR_R_MALLOC_FAILURE);
327 ret->flags=BN_FLG_MALLOCED;
331 void BN_CTX_init(ctx)
334 memset(ctx,0,sizeof(BN_CTX));
344 for (i=0; i<BN_CTX_NUM; i++)
345 BN_clear_free(&(c->bn[i]));
346 if (c->flags & BN_FLG_MALLOCED)
350 BIGNUM *bn_expand2(b, words)
362 if (BN_get_flags(b,BN_FLG_STATIC_DATA))
364 BNerr(BN_F_BN_EXPAND2,BN_R_EXPAND_ON_STATIC_BIGNUM_DATA);
367 a=A=(BN_ULONG *)Malloc(sizeof(BN_ULONG)*(words+1));
370 BNerr(BN_F_BN_EXPAND2,ERR_R_MALLOC_FAILURE);
373 memset(A,0x5c,sizeof(BN_ULONG)*(words+1));
378 for (i=b->top&(~7); i>0; i-=8)
380 A[0]=B[0]; A[1]=B[1]; A[2]=B[2]; A[3]=B[3];
381 A[4]=B[4]; A[5]=B[5]; A[6]=B[6]; A[7]=B[7];
402 /* I need the 'case 0' entry for utrix cc.
403 * If the optimiser is turned on, it does the
404 * switch table by doing
407 * goto jump_table[a];
408 * If top is 0, this makes us jump to 0xffffffc
409 * which is rather bad :-(.
416 for (i=b->top; i<j; i+=8)
418 B[0]=0; B[1]=0; B[2]=0; B[3]=0;
419 B[4]=0; B[5]=0; B[6]=0; B[7]=0;
428 memcpy(a->d,b->d,sizeof(b->d[0])*b->top);
431 /* memset(&(p[b->max]),0,((words+1)-b->max)*sizeof(BN_ULONG)); */
432 /* { int i; for (i=b->max; i<words+1; i++) p[i]=i;} */
450 if (r == NULL) return(NULL);
451 return((BIGNUM *)BN_copy(r,a));
454 BIGNUM *BN_copy(a, b)
463 if (a == b) return(a);
464 if (bn_wexpand(a,b->top) == NULL) return(NULL);
469 for (i=b->top&(~7); i>0; i-=8)
499 /* I need the 'case 0' entry for utrix cc.
500 * If the optimiser is turned on, it does the
501 * switch table by doing
504 * goto jump_table[a];
505 * If top is 0, this makes us jump to 0xffffffc which is
512 memcpy(a->d,b->d,sizeof(b->d[0])*b->top);
515 /* memset(&(a->d[b->top]),0,sizeof(a->d[0])*(a->max-b->top));*/
517 if ((a->top == 0) && (a->d != NULL))
527 memset(a->d,0,a->max*sizeof(a->d[0]));
532 BN_ULONG BN_get_word(a)
539 if (n > sizeof(BN_ULONG))
541 for (i=a->top-1; i>=0; i--)
543 #ifndef SIXTY_FOUR_BIT /* the data item > unsigned long */
544 ret<<=BN_BITS4; /* stops the compiler complaining */
557 if (bn_expand(a,sizeof(BN_ULONG)*8) == NULL) return(0);
559 n=sizeof(BN_ULONG)/BN_BYTES;
562 a->d[0]=(BN_ULONG)w&BN_MASK2;
563 if (a->d[0] != 0) a->top=1;
566 /* the following is done instead of
567 * w>>=BN_BITS2 so compilers don't complain
568 * on builds where sizeof(long) == BN_TYPES */
569 #ifndef SIXTY_FOUR_BIT /* the data item > unsigned long */
573 a->d[i]=(BN_ULONG)w&BN_MASK2;
574 if (a->d[i] != 0) a->top=i+1;
579 /* ignore negative */
580 BIGNUM *BN_bin2bn(s, len, ret)
589 if (ret == NULL) ret=BN_new();
590 if (ret == NULL) return(NULL);
598 if (bn_expand(ret,(int)(n+2)*8) == NULL)
600 i=((n-1)/BN_BYTES)+1;
601 m=((n-1)%(BN_BYTES));
613 /* need to call this due to clear byte at top if avoiding
614 * having the top bit set (-ve number) */
619 /* ignore negative */
631 *(to++)=(unsigned char)(l>>(8*(i%BN_BYTES)))&0xff;
641 BN_ULONG t1,t2,*ap,*bp;
647 if (i != 0) return(i);
650 for (i=a->top-1; i>=0; i--)
655 return(t1 > t2?1:-1);
668 if ((a == NULL) || (b == NULL))
681 if (a->neg != b->neg)
689 else { gt= -1; lt=1; }
691 if (a->top > b->top) return(gt);
692 if (a->top < b->top) return(lt);
693 for (i=a->top-1; i>=0; i--)
697 if (t1 > t2) return(gt);
698 if (t1 < t2) return(lt);
713 if (bn_wexpand(a,i+1) == NULL) return(0);
714 for(k=a->top; k<i+1; k++)
723 int BN_clear_bit(a, n)
731 if (a->top <= i) return(0);
738 int BN_is_bit_set(a, n)
744 if (n < 0) return(0);
747 if (a->top <= i) return(0);
748 return((a->d[i]&(((BN_ULONG)1)<<j))?1:0);
751 int BN_mask_bits(a,n)
759 if (w >= a->top) return(0);
765 a->d[w]&= ~(BN_MASK2<<b);
771 int bn_cmp_words(a,b,n)
780 if (aa != bb) return((aa > bb)?1:-1);
781 for (i=n-2; i>=0; i--)
785 if (aa != bb) return((aa > bb)?1:-1);