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 const char *BN_version="Big Number" OPENSSL_VERSION_PTEXT;
65 /* For a 32 bit machine
74 GLOBAL int bn_limit_bits=0;
75 GLOBAL int bn_limit_num=8; /* (1<<bn_limit_bits) */
76 GLOBAL int bn_limit_bits_low=0;
77 GLOBAL int bn_limit_num_low=8; /* (1<<bn_limit_bits_low) */
78 GLOBAL int bn_limit_bits_high=0;
79 GLOBAL int bn_limit_num_high=8; /* (1<<bn_limit_bits_high) */
80 GLOBAL int bn_limit_bits_mont=0;
81 GLOBAL int bn_limit_num_mont=8; /* (1<<bn_limit_bits_mont) */
83 void BN_set_params(int mult, int high, int low, int mont)
87 if (mult > (sizeof(int)*8)-1)
94 if (high > (sizeof(int)*8)-1)
96 bn_limit_bits_high=high;
97 bn_limit_num_high=1<<high;
101 if (low > (sizeof(int)*8)-1)
103 bn_limit_bits_low=low;
104 bn_limit_num_low=1<<low;
108 if (mont > (sizeof(int)*8)-1)
109 mont=sizeof(int)*8-1;
110 bn_limit_bits_mont=mont;
111 bn_limit_num_mont=1<<mont;
115 int BN_get_params(int which)
117 if (which == 0) return(bn_limit_bits);
118 else if (which == 1) return(bn_limit_bits_high);
119 else if (which == 2) return(bn_limit_bits_low);
120 else if (which == 3) return(bn_limit_bits_mont);
124 BIGNUM *BN_value_one(void)
126 static BN_ULONG data_one=1L;
127 static BIGNUM const_one={&data_one,1,1,0};
132 char *BN_options(void)
135 static char data[16];
141 sprintf(data,"bn(%d,%d)",(int)sizeof(BN_ULLONG)*8,
142 (int)sizeof(BN_ULONG)*8);
144 sprintf(data,"bn(%d,%d)",(int)sizeof(BN_ULONG)*8,
145 (int)sizeof(BN_ULONG)*8);
151 int BN_num_bits_word(BN_ULONG l)
153 static char bits[256]={
154 0,1,2,2,3,3,3,3,4,4,4,4,4,4,4,4,
155 5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,
156 6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,
157 6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,
158 7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,
159 7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,
160 7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,
161 7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,
162 8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,
163 8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,
164 8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,
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,
172 #if defined(SIXTY_FOUR_BIT_LONG)
173 if (l & 0xffffffff00000000L)
175 if (l & 0xffff000000000000L)
177 if (l & 0xff00000000000000L)
179 return(bits[(int)(l>>56)]+56);
181 else return(bits[(int)(l>>48)]+48);
185 if (l & 0x0000ff0000000000L)
187 return(bits[(int)(l>>40)]+40);
189 else return(bits[(int)(l>>32)]+32);
194 #ifdef SIXTY_FOUR_BIT
195 if (l & 0xffffffff00000000LL)
197 if (l & 0xffff000000000000LL)
199 if (l & 0xff00000000000000LL)
201 return(bits[(int)(l>>56)]+56);
203 else return(bits[(int)(l>>48)]+48);
207 if (l & 0x0000ff0000000000LL)
209 return(bits[(int)(l>>40)]+40);
211 else return(bits[(int)(l>>32)]+32);
218 #if defined(THIRTY_TWO_BIT) || defined(SIXTY_FOUR_BIT) || defined(SIXTY_FOUR_BIT_LONG)
222 return(bits[(int)(l>>24L)]+24);
223 else return(bits[(int)(l>>16L)]+16);
228 #if defined(SIXTEEN_BIT) || defined(THIRTY_TWO_BIT) || defined(SIXTY_FOUR_BIT) || defined(SIXTY_FOUR_BIT_LONG)
230 return(bits[(int)(l>>8)]+8);
233 return(bits[(int)(l )] );
238 int BN_num_bits(BIGNUM *a)
245 if (a->top == 0) return(0);
247 i=(a->top-1)*BN_BITS2;
250 #if !defined(NO_STDIO) && !defined(WIN16)
251 fprintf(stderr,"BAD TOP VALUE\n");
255 return(i+BN_num_bits_word(l));
258 void BN_clear_free(BIGNUM *a)
262 if (a == NULL) return;
265 memset(a->d,0,a->max*sizeof(a->d[0]));
266 if (!(BN_get_flags(a,BN_FLG_STATIC_DATA)))
269 i=BN_get_flags(a,BN_FLG_MALLOCED);
270 memset(a,0,sizeof(BIGNUM));
275 void BN_free(BIGNUM *a)
277 if (a == NULL) return;
278 if ((a->d != NULL) && !(BN_get_flags(a,BN_FLG_STATIC_DATA)))
280 a->flags|=BN_FLG_FREE; /* REMOVE? */
281 if (a->flags & BN_FLG_MALLOCED)
285 void BN_init(BIGNUM *a)
287 memset(a,0,sizeof(BIGNUM));
294 if ((ret=(BIGNUM *)Malloc(sizeof(BIGNUM))) == NULL)
296 BNerr(BN_F_BN_NEW,ERR_R_MALLOC_FAILURE);
299 ret->flags=BN_FLG_MALLOCED;
308 BN_CTX *BN_CTX_new(void)
312 ret=(BN_CTX *)Malloc(sizeof(BN_CTX));
315 BNerr(BN_F_BN_CTX_NEW,ERR_R_MALLOC_FAILURE);
320 ret->flags=BN_FLG_MALLOCED;
324 void BN_CTX_init(BN_CTX *ctx)
326 memset(ctx,0,sizeof(BN_CTX));
331 void BN_CTX_free(BN_CTX *c)
338 for (i=0; i<BN_CTX_NUM; i++)
339 BN_clear_free(&(c->bn[i]));
340 if (c->flags & BN_FLG_MALLOCED)
344 BIGNUM *bn_expand2(BIGNUM *b, int words)
354 if (BN_get_flags(b,BN_FLG_STATIC_DATA))
356 BNerr(BN_F_BN_EXPAND2,BN_R_EXPAND_ON_STATIC_BIGNUM_DATA);
359 a=A=(BN_ULONG *)Malloc(sizeof(BN_ULONG)*(words+1));
362 BNerr(BN_F_BN_EXPAND2,ERR_R_MALLOC_FAILURE);
365 memset(A,0x5c,sizeof(BN_ULONG)*(words+1));
368 /* Check if the previous number needs to be copied */
371 /* This lot is an unrolled loop to copy b->top
372 * BN_ULONGs from B to A
374 for (i=b->top&(~7); i>0; i-=8)
376 A[0]=B[0]; A[1]=B[1]; A[2]=B[2]; A[3]=B[3];
377 A[4]=B[4]; A[5]=B[5]; A[6]=B[6]; A[7]=B[7];
398 /* I need the 'case 0' entry for utrix cc.
399 * If the optimiser is turned on, it does the
400 * switch table by doing
403 * goto jump_table[a];
404 * If top is 0, this makes us jump to 0xffffffc
405 * which is rather bad :-(.
416 /* Now need to zero any data between b->top and b->max */
419 j=(b->max - b->top) & ~7;
422 B[0]=0; B[1]=0; B[2]=0; B[3]=0;
423 B[4]=0; B[5]=0; B[6]=0; B[7]=0;
426 j=(b->max - b->top) & 7;
433 memcpy(a->d,b->d,sizeof(b->d[0])*b->top);
436 /* memset(&(p[b->max]),0,((words+1)-b->max)*sizeof(BN_ULONG)); */
437 /* { int i; for (i=b->max; i<words+1; i++) p[i]=i;} */
443 BIGNUM *BN_dup(BIGNUM *a)
450 if (r == NULL) return(NULL);
451 return((BIGNUM *)BN_copy(r,a));
454 BIGNUM *BN_copy(BIGNUM *a, BIGNUM *b)
461 if (a == b) return(a);
462 if (bn_wexpand(a,b->top) == NULL) return(NULL);
467 for (i=b->top&(~7); i>0; i-=8)
497 /* I need the 'case 0' entry for utrix cc.
498 * If the optimiser is turned on, it does the
499 * switch table by doing
502 * goto jump_table[a];
503 * If top is 0, this makes us jump to 0xffffffc which is
510 memcpy(a->d,b->d,sizeof(b->d[0])*b->top);
513 /* memset(&(a->d[b->top]),0,sizeof(a->d[0])*(a->max-b->top));*/
515 if ((a->top == 0) && (a->d != NULL))
521 void BN_clear(BIGNUM *a)
524 memset(a->d,0,a->max*sizeof(a->d[0]));
529 BN_ULONG BN_get_word(BIGNUM *a)
535 if (n > sizeof(BN_ULONG))
537 for (i=a->top-1; i>=0; i--)
539 #ifndef SIXTY_FOUR_BIT /* the data item > unsigned long */
540 ret<<=BN_BITS4; /* stops the compiler complaining */
548 int BN_set_word(BIGNUM *a, BN_ULONG w)
551 if (bn_expand(a,sizeof(BN_ULONG)*8) == NULL) return(0);
553 n=sizeof(BN_ULONG)/BN_BYTES;
556 a->d[0]=(BN_ULONG)w&BN_MASK2;
557 if (a->d[0] != 0) a->top=1;
560 /* the following is done instead of
561 * w>>=BN_BITS2 so compilers don't complain
562 * on builds where sizeof(long) == BN_TYPES */
563 #ifndef SIXTY_FOUR_BIT /* the data item > unsigned long */
567 a->d[i]=(BN_ULONG)w&BN_MASK2;
568 if (a->d[i] != 0) a->top=i+1;
573 /* ignore negative */
574 BIGNUM *BN_bin2bn(const unsigned char *s, int len, BIGNUM *ret)
580 if (ret == NULL) ret=BN_new();
581 if (ret == NULL) return(NULL);
589 if (bn_expand(ret,(int)(n+2)*8) == NULL)
591 i=((n-1)/BN_BYTES)+1;
592 m=((n-1)%(BN_BYTES));
604 /* need to call this due to clear byte at top if avoiding
605 * having the top bit set (-ve number) */
610 /* ignore negative */
611 int BN_bn2bin(BIGNUM *a, unsigned char *to)
620 *(to++)=(unsigned char)(l>>(8*(i%BN_BYTES)))&0xff;
625 int BN_ucmp(BIGNUM *a, BIGNUM *b)
628 BN_ULONG t1,t2,*ap,*bp;
634 if (i != 0) return(i);
637 for (i=a->top-1; i>=0; i--)
642 return(t1 > t2?1:-1);
647 int BN_cmp(BIGNUM *a, BIGNUM *b)
653 if ((a == NULL) || (b == NULL))
666 if (a->neg != b->neg)
674 else { gt= -1; lt=1; }
676 if (a->top > b->top) return(gt);
677 if (a->top < b->top) return(lt);
678 for (i=a->top-1; i>=0; i--)
682 if (t1 > t2) return(gt);
683 if (t1 < t2) return(lt);
688 int BN_set_bit(BIGNUM *a, int n)
696 if (bn_wexpand(a,i+1) == NULL) return(0);
697 for(k=a->top; k<i+1; k++)
706 int BN_clear_bit(BIGNUM *a, int n)
712 if (a->top <= i) return(0);
719 int BN_is_bit_set(BIGNUM *a, int n)
723 if (n < 0) return(0);
726 if (a->top <= i) return(0);
727 return((a->d[i]&(((BN_ULONG)1)<<j))?1:0);
730 int BN_mask_bits(BIGNUM *a, int n)
736 if (w >= a->top) return(0);
742 a->d[w]&= ~(BN_MASK2<<b);
748 int bn_cmp_words(BN_ULONG *a, BN_ULONG *b, int n)
755 if (aa != bb) return((aa > bb)?1:-1);
756 for (i=n-2; i>=0; i--)
760 if (aa != bb) return((aa > bb)?1:-1);