1 /* crypto/bn/bn_mul.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.]
60 # undef NDEBUG /* avoid conflicting definitions */
69 #if defined(OPENSSL_NO_ASM) || !defined(OPENSSL_BN_ASM_PART_WORDS)
70 /* Here follows specialised variants of bn_add_words() and
71 bn_sub_words(). They have the property performing operations on
72 arrays of different sizes. The sizes of those arrays is expressed through
73 cl, which is the common length ( basicall, min(len(a),len(b)) ), and dl,
74 which is the delta between the two lengths, calculated as len(a)-len(b).
75 All lengths are the number of BN_ULONGs... For the operations that require
76 a result array as parameter, it must have the length cl+abs(dl).
77 These functions should probably end up in bn_asm.c as soon as there are
78 assembler counterparts for the systems that use assembler files. */
80 BN_ULONG
bn_sub_part_words(BN_ULONG
*r
,
81 const BN_ULONG
*a
, const BN_ULONG
*b
,
87 c
= bn_sub_words(r
, a
, b
, cl
);
99 fprintf(stderr
, " bn_sub_part_words %d + %d (dl < 0, c = %d)\n", cl
, dl
, c
);
104 r
[0] = (0-t
-c
)&BN_MASK2
;
106 if (++dl
>= 0) break;
109 r
[1] = (0-t
-c
)&BN_MASK2
;
111 if (++dl
>= 0) break;
114 r
[2] = (0-t
-c
)&BN_MASK2
;
116 if (++dl
>= 0) break;
119 r
[3] = (0-t
-c
)&BN_MASK2
;
121 if (++dl
>= 0) break;
131 fprintf(stderr
, " bn_sub_part_words %d + %d (dl > 0, c = %d)\n", cl
, dl
, c
);
136 r
[0] = (t
-c
)&BN_MASK2
;
138 if (--dl
<= 0) break;
141 r
[1] = (t
-c
)&BN_MASK2
;
143 if (--dl
<= 0) break;
146 r
[2] = (t
-c
)&BN_MASK2
;
148 if (--dl
<= 0) break;
151 r
[3] = (t
-c
)&BN_MASK2
;
153 if (--dl
<= 0) break;
162 fprintf(stderr
, " bn_sub_part_words %d + %d (dl > 0, c == 0)\n", cl
, dl
);
166 switch (save_dl
- dl
)
170 if (--dl
<= 0) break;
173 if (--dl
<= 0) break;
176 if (--dl
<= 0) break;
185 fprintf(stderr
, " bn_sub_part_words %d + %d (dl > 0, copy)\n", cl
, dl
);
190 if (--dl
<= 0) break;
192 if (--dl
<= 0) break;
194 if (--dl
<= 0) break;
196 if (--dl
<= 0) break;
207 BN_ULONG
bn_add_part_words(BN_ULONG
*r
,
208 const BN_ULONG
*a
, const BN_ULONG
*b
,
214 c
= bn_add_words(r
, a
, b
, cl
);
227 fprintf(stderr
, " bn_add_part_words %d + %d (dl < 0, c = %d)\n", cl
, dl
, c
);
234 if (++dl
>= 0) break;
239 if (++dl
>= 0) break;
244 if (++dl
>= 0) break;
249 if (++dl
>= 0) break;
258 fprintf(stderr
, " bn_add_part_words %d + %d (dl < 0, c == 0)\n", cl
, dl
);
262 switch (dl
- save_dl
)
266 if (++dl
>= 0) break;
269 if (++dl
>= 0) break;
272 if (++dl
>= 0) break;
281 fprintf(stderr
, " bn_add_part_words %d + %d (dl < 0, copy)\n", cl
, dl
);
286 if (++dl
>= 0) break;
288 if (++dl
>= 0) break;
290 if (++dl
>= 0) break;
292 if (++dl
>= 0) break;
303 fprintf(stderr
, " bn_add_part_words %d + %d (dl > 0)\n", cl
, dl
);
310 if (--dl
<= 0) break;
315 if (--dl
<= 0) break;
320 if (--dl
<= 0) break;
325 if (--dl
<= 0) break;
332 fprintf(stderr
, " bn_add_part_words %d + %d (dl > 0, c == 0)\n", cl
, dl
);
338 switch (save_dl
- dl
)
342 if (--dl
<= 0) break;
345 if (--dl
<= 0) break;
348 if (--dl
<= 0) break;
357 fprintf(stderr
, " bn_add_part_words %d + %d (dl > 0, copy)\n", cl
, dl
);
362 if (--dl
<= 0) break;
364 if (--dl
<= 0) break;
366 if (--dl
<= 0) break;
368 if (--dl
<= 0) break;
379 /* Karatsuba recursive multiplication algorithm
380 * (cf. Knuth, The Art of Computer Programming, Vol. 2) */
382 /* r is 2*n2 words in size,
383 * a and b are both n2 words in size.
384 * n2 must be a power of 2.
385 * We multiply and return the result.
386 * t must be 2*n2 words in size
389 * a[0]*b[0]+a[1]*b[1]+(a[0]-a[1])*(b[1]-b[0])
392 void bn_mul_recursive(BN_ULONG
*r
, BN_ULONG
*a
, BN_ULONG
*b
, int n2
,
393 int dna
, int dnb
, BN_ULONG
*t
)
396 int tna
=n
+dna
, tnb
=n
+dnb
;
397 unsigned int neg
,zero
;
401 fprintf(stderr
," bn_mul_recursive %d * %d\n",n2
,n2
);
407 bn_mul_comba4(r
,a
,b
);
411 /* Only call bn_mul_comba 8 if n2 == 8 and the
412 * two arrays are complete [steve]
414 if (n2
== 8 && dna
== 0 && dnb
== 0)
416 bn_mul_comba8(r
,a
,b
);
419 # endif /* BN_MUL_COMBA */
420 /* Else do normal multiply */
421 if (n2
< BN_MUL_RECURSIVE_SIZE_NORMAL
)
423 bn_mul_normal(r
,a
,n2
+dna
,b
,n2
+dnb
);
425 memset(&r
[2*n2
+ dna
+ dnb
], 0,
426 sizeof(BN_ULONG
) * -(dna
+ dnb
));
429 /* r=(a[0]-a[1])*(b[1]-b[0]) */
430 c1
=bn_cmp_part_words(a
,&(a
[n
]),tna
,n
-tna
);
431 c2
=bn_cmp_part_words(&(b
[n
]),b
,tnb
,tnb
-n
);
436 bn_sub_part_words(t
, &(a
[n
]),a
, tna
,tna
-n
); /* - */
437 bn_sub_part_words(&(t
[n
]),b
, &(b
[n
]),tnb
,n
-tnb
); /* - */
443 bn_sub_part_words(t
, &(a
[n
]),a
, tna
,tna
-n
); /* - */
444 bn_sub_part_words(&(t
[n
]),&(b
[n
]),b
, tnb
,tnb
-n
); /* + */
453 bn_sub_part_words(t
, a
, &(a
[n
]),tna
,n
-tna
); /* + */
454 bn_sub_part_words(&(t
[n
]),b
, &(b
[n
]),tnb
,n
-tnb
); /* - */
461 bn_sub_part_words(t
, a
, &(a
[n
]),tna
,n
-tna
);
462 bn_sub_part_words(&(t
[n
]),&(b
[n
]),b
, tnb
,tnb
-n
);
467 if (n
== 4 && dna
== 0 && dnb
== 0) /* XXX: bn_mul_comba4 could take
468 extra args to do this well */
471 bn_mul_comba4(&(t
[n2
]),t
,&(t
[n
]));
473 memset(&(t
[n2
]),0,8*sizeof(BN_ULONG
));
475 bn_mul_comba4(r
,a
,b
);
476 bn_mul_comba4(&(r
[n2
]),&(a
[n
]),&(b
[n
]));
478 else if (n
== 8 && dna
== 0 && dnb
== 0) /* XXX: bn_mul_comba8 could
479 take extra args to do this
483 bn_mul_comba8(&(t
[n2
]),t
,&(t
[n
]));
485 memset(&(t
[n2
]),0,16*sizeof(BN_ULONG
));
487 bn_mul_comba8(r
,a
,b
);
488 bn_mul_comba8(&(r
[n2
]),&(a
[n
]),&(b
[n
]));
491 # endif /* BN_MUL_COMBA */
495 bn_mul_recursive(&(t
[n2
]),t
,&(t
[n
]),n
,0,0,p
);
497 memset(&(t
[n2
]),0,n2
*sizeof(BN_ULONG
));
498 bn_mul_recursive(r
,a
,b
,n
,0,0,p
);
499 bn_mul_recursive(&(r
[n2
]),&(a
[n
]),&(b
[n
]),n
,dna
,dnb
,p
);
502 /* t[32] holds (a[0]-a[1])*(b[1]-b[0]), c1 is the sign
503 * r[10] holds (a[0]*b[0])
504 * r[32] holds (b[1]*b[1])
507 c1
=(int)(bn_add_words(t
,r
,&(r
[n2
]),n2
));
509 if (neg
) /* if t[32] is negative */
511 c1
-=(int)(bn_sub_words(&(t
[n2
]),t
,&(t
[n2
]),n2
));
515 /* Might have a carry */
516 c1
+=(int)(bn_add_words(&(t
[n2
]),&(t
[n2
]),t
,n2
));
519 /* t[32] holds (a[0]-a[1])*(b[1]-b[0])+(a[0]*b[0])+(a[1]*b[1])
520 * r[10] holds (a[0]*b[0])
521 * r[32] holds (b[1]*b[1])
522 * c1 holds the carry bits
524 c1
+=(int)(bn_add_words(&(r
[n
]),&(r
[n
]),&(t
[n2
]),n2
));
532 /* The overflow will stop before we over write
533 * words we should not overwrite */
534 if (ln
< (BN_ULONG
)c1
)
546 /* n+tn is the word length
547 * t needs to be n*4 is size, as does r */
548 void bn_mul_part_recursive(BN_ULONG
*r
, BN_ULONG
*a
, BN_ULONG
*b
, int n
,
549 int tna
, int tnb
, BN_ULONG
*t
)
556 fprintf(stderr
," bn_mul_part_recursive (%d+%d) * (%d+%d)\n",
561 bn_mul_normal(r
,a
,n
+tna
,b
,n
+tnb
);
565 /* r=(a[0]-a[1])*(b[1]-b[0]) */
566 c1
=bn_cmp_part_words(a
,&(a
[n
]),tna
,n
-tna
);
567 c2
=bn_cmp_part_words(&(b
[n
]),b
,tnb
,tnb
-n
);
572 bn_sub_part_words(t
, &(a
[n
]),a
, tna
,tna
-n
); /* - */
573 bn_sub_part_words(&(t
[n
]),b
, &(b
[n
]),tnb
,n
-tnb
); /* - */
579 bn_sub_part_words(t
, &(a
[n
]),a
, tna
,tna
-n
); /* - */
580 bn_sub_part_words(&(t
[n
]),&(b
[n
]),b
, tnb
,tnb
-n
); /* + */
589 bn_sub_part_words(t
, a
, &(a
[n
]),tna
,n
-tna
); /* + */
590 bn_sub_part_words(&(t
[n
]),b
, &(b
[n
]),tnb
,n
-tnb
); /* - */
597 bn_sub_part_words(t
, a
, &(a
[n
]),tna
,n
-tna
);
598 bn_sub_part_words(&(t
[n
]),&(b
[n
]),b
, tnb
,tnb
-n
);
601 /* The zero case isn't yet implemented here. The speedup
602 would probably be negligible. */
606 bn_mul_comba4(&(t
[n2
]),t
,&(t
[n
]));
607 bn_mul_comba4(r
,a
,b
);
608 bn_mul_normal(&(r
[n2
]),&(a
[n
]),tn
,&(b
[n
]),tn
);
609 memset(&(r
[n2
+tn
*2]),0,sizeof(BN_ULONG
)*(n2
-tn
*2));
615 bn_mul_comba8(&(t
[n2
]),t
,&(t
[n
]));
616 bn_mul_comba8(r
,a
,b
);
617 bn_mul_normal(&(r
[n2
]),&(a
[n
]),tna
,&(b
[n
]),tnb
);
618 memset(&(r
[n2
+tna
+tnb
]),0,sizeof(BN_ULONG
)*(n2
-tna
-tnb
));
623 bn_mul_recursive(&(t
[n2
]),t
,&(t
[n
]),n
,0,0,p
);
624 bn_mul_recursive(r
,a
,b
,n
,0,0,p
);
626 /* If there is only a bottom half to the number,
634 bn_mul_recursive(&(r
[n2
]),&(a
[n
]),&(b
[n
]),
636 memset(&(r
[n2
+i
*2]),0,sizeof(BN_ULONG
)*(n2
-i
*2));
638 else if (j
> 0) /* eg, n == 16, i == 8 and tn == 11 */
640 bn_mul_part_recursive(&(r
[n2
]),&(a
[n
]),&(b
[n
]),
642 memset(&(r
[n2
+tna
+tnb
]),0,
643 sizeof(BN_ULONG
)*(n2
-tna
-tnb
));
645 else /* (j < 0) eg, n == 16, i == 8 and tn == 5 */
647 memset(&(r
[n2
]),0,sizeof(BN_ULONG
)*n2
);
648 if (tna
< BN_MUL_RECURSIVE_SIZE_NORMAL
649 && tnb
< BN_MUL_RECURSIVE_SIZE_NORMAL
)
651 bn_mul_normal(&(r
[n2
]),&(a
[n
]),tna
,&(b
[n
]),tnb
);
658 if (i
< tna
&& i
< tnb
)
660 bn_mul_part_recursive(&(r
[n2
]),
665 else if (i
<= tna
&& i
<= tnb
)
667 bn_mul_recursive(&(r
[n2
]),
677 /* t[32] holds (a[0]-a[1])*(b[1]-b[0]), c1 is the sign
678 * r[10] holds (a[0]*b[0])
679 * r[32] holds (b[1]*b[1])
682 c1
=(int)(bn_add_words(t
,r
,&(r
[n2
]),n2
));
684 if (neg
) /* if t[32] is negative */
686 c1
-=(int)(bn_sub_words(&(t
[n2
]),t
,&(t
[n2
]),n2
));
690 /* Might have a carry */
691 c1
+=(int)(bn_add_words(&(t
[n2
]),&(t
[n2
]),t
,n2
));
694 /* t[32] holds (a[0]-a[1])*(b[1]-b[0])+(a[0]*b[0])+(a[1]*b[1])
695 * r[10] holds (a[0]*b[0])
696 * r[32] holds (b[1]*b[1])
697 * c1 holds the carry bits
699 c1
+=(int)(bn_add_words(&(r
[n
]),&(r
[n
]),&(t
[n2
]),n2
));
707 /* The overflow will stop before we over write
708 * words we should not overwrite */
709 if (ln
< (BN_ULONG
)c1
)
721 /* a and b must be the same size, which is n2.
722 * r needs to be n2 words and t needs to be n2*2
724 void bn_mul_low_recursive(BN_ULONG
*r
, BN_ULONG
*a
, BN_ULONG
*b
, int n2
,
730 fprintf(stderr
," bn_mul_low_recursive %d * %d\n",n2
,n2
);
733 bn_mul_recursive(r
,a
,b
,n
,0,0,&(t
[0]));
734 if (n
>= BN_MUL_LOW_RECURSIVE_SIZE_NORMAL
)
736 bn_mul_low_recursive(&(t
[0]),&(a
[0]),&(b
[n
]),n
,&(t
[n2
]));
737 bn_add_words(&(r
[n
]),&(r
[n
]),&(t
[0]),n
);
738 bn_mul_low_recursive(&(t
[0]),&(a
[n
]),&(b
[0]),n
,&(t
[n2
]));
739 bn_add_words(&(r
[n
]),&(r
[n
]),&(t
[0]),n
);
743 bn_mul_low_normal(&(t
[0]),&(a
[0]),&(b
[n
]),n
);
744 bn_mul_low_normal(&(t
[n
]),&(a
[n
]),&(b
[0]),n
);
745 bn_add_words(&(r
[n
]),&(r
[n
]),&(t
[0]),n
);
746 bn_add_words(&(r
[n
]),&(r
[n
]),&(t
[n
]),n
);
750 /* a and b must be the same size, which is n2.
751 * r needs to be n2 words and t needs to be n2*2
752 * l is the low words of the output.
755 void bn_mul_high(BN_ULONG
*r
, BN_ULONG
*a
, BN_ULONG
*b
, BN_ULONG
*l
, int n2
,
761 BN_ULONG ll
,lc
,*lp
,*mp
;
764 fprintf(stderr
," bn_mul_high %d * %d\n",n2
,n2
);
768 /* Calculate (al-ah)*(bh-bl) */
770 c1
=bn_cmp_words(&(a
[0]),&(a
[n
]),n
);
771 c2
=bn_cmp_words(&(b
[n
]),&(b
[0]),n
);
775 bn_sub_words(&(r
[0]),&(a
[n
]),&(a
[0]),n
);
776 bn_sub_words(&(r
[n
]),&(b
[0]),&(b
[n
]),n
);
782 bn_sub_words(&(r
[0]),&(a
[n
]),&(a
[0]),n
);
783 bn_sub_words(&(r
[n
]),&(b
[n
]),&(b
[0]),n
);
792 bn_sub_words(&(r
[0]),&(a
[0]),&(a
[n
]),n
);
793 bn_sub_words(&(r
[n
]),&(b
[0]),&(b
[n
]),n
);
800 bn_sub_words(&(r
[0]),&(a
[0]),&(a
[n
]),n
);
801 bn_sub_words(&(r
[n
]),&(b
[n
]),&(b
[0]),n
);
806 /* t[10] = (a[0]-a[1])*(b[1]-b[0]) */
807 /* r[10] = (a[1]*b[1]) */
811 bn_mul_comba8(&(t
[0]),&(r
[0]),&(r
[n
]));
812 bn_mul_comba8(r
,&(a
[n
]),&(b
[n
]));
817 bn_mul_recursive(&(t
[0]),&(r
[0]),&(r
[n
]),n
,0,0,&(t
[n2
]));
818 bn_mul_recursive(r
,&(a
[n
]),&(b
[n
]),n
,0,0,&(t
[n2
]));
822 * s1 == low(ah*bh)+low((al-ah)*(bh-bl))+low(al*bl)+high(al*bl)
823 * We know s0 and s1 so the only unknown is high(al*bl)
824 * high(al*bl) == s1 - low(ah*bh+s0+(al-ah)*(bh-bl))
825 * high(al*bl) == s1 - (r[0]+l[0]+t[0])
830 c1
=(int)(bn_add_words(lp
,&(r
[0]),&(l
[0]),n
));
839 neg
=(int)(bn_sub_words(&(t
[n2
]),lp
,&(t
[0]),n
));
842 bn_add_words(&(t
[n2
]),lp
,&(t
[0]),n
);
848 bn_sub_words(&(t
[n2
+n
]),&(l
[n
]),&(t
[n2
]),n
);
855 lp
[i
]=((~mp
[i
])+1)&BN_MASK2
;
860 * t[10] = (a[0]-a[1])*(b[1]-b[0]) neg is the sign
861 * r[10] = (a[1]*b[1])
864 * R[21] = al*bl + ah*bh + (a[0]-a[1])*(b[1]-b[0])
867 /* R[1]=t[3]+l[0]+r[0](+-)t[0] (have carry/borrow)
868 * R[2]=r[0]+t[3]+r[1](+-)t[1] (have carry/borrow)
869 * R[3]=r[1]+(carry/borrow)
874 c1
= (int)(bn_add_words(lp
,&(t
[n2
+n
]),&(l
[0]),n
));
881 c1
+=(int)(bn_add_words(&(t
[n2
]),lp
, &(r
[0]),n
));
883 c1
-=(int)(bn_sub_words(&(t
[n2
]),&(t
[n2
]),&(t
[0]),n
));
885 c1
+=(int)(bn_add_words(&(t
[n2
]),&(t
[n2
]),&(t
[0]),n
));
887 c2
=(int)(bn_add_words(&(r
[0]),&(r
[0]),&(t
[n2
+n
]),n
));
888 c2
+=(int)(bn_add_words(&(r
[0]),&(r
[0]),&(r
[n
]),n
));
890 c2
-=(int)(bn_sub_words(&(r
[0]),&(r
[0]),&(t
[n
]),n
));
892 c2
+=(int)(bn_add_words(&(r
[0]),&(r
[0]),&(t
[n
]),n
));
894 if (c1
!= 0) /* Add starting at r[0], could be +ve or -ve */
901 ll
=(r
[i
]+lc
)&BN_MASK2
;
911 r
[i
++]=(ll
-lc
)&BN_MASK2
;
916 if (c2
!= 0) /* Add starting at r[1] */
923 ll
=(r
[i
]+lc
)&BN_MASK2
;
933 r
[i
++]=(ll
-lc
)&BN_MASK2
;
939 #endif /* BN_RECURSION */
941 int BN_mul(BIGNUM
*r
, const BIGNUM
*a
, const BIGNUM
*b
, BN_CTX
*ctx
)
946 #if defined(BN_MUL_COMBA) || defined(BN_RECURSION)
955 fprintf(stderr
,"BN_mul %d * %d\n",a
->top
,b
->top
);
965 if ((al
== 0) || (bl
== 0))
973 if ((r
== a
) || (r
== b
))
975 if ((rr
= BN_CTX_get(ctx
)) == NULL
) goto err
;
979 rr
->neg
=a
->neg
^b
->neg
;
981 #if defined(BN_MUL_COMBA) || defined(BN_RECURSION)
990 if (bn_wexpand(rr
,8) == NULL
) goto err
;
992 bn_mul_comba4(rr
->d
,a
->d
,b
->d
);
998 if (bn_wexpand(rr
,16) == NULL
) goto err
;
1000 bn_mul_comba8(rr
->d
,a
->d
,b
->d
);
1004 #endif /* BN_MUL_COMBA */
1006 if ((al
>= BN_MULL_SIZE_NORMAL
) && (bl
>= BN_MULL_SIZE_NORMAL
))
1008 if (i
>= -1 && i
<= 1)
1011 /* Find out the power of two lower or equal
1012 to the longest of the two numbers */
1015 j
= BN_num_bits_word((BN_ULONG
)al
);
1019 j
= BN_num_bits_word((BN_ULONG
)bl
);
1023 assert(j
<= al
|| j
<= bl
);
1025 t
= BN_CTX_get(ctx
);
1026 if (al
> j
|| bl
> j
)
1030 bn_mul_part_recursive(rr
->d
,a
->d
,b
->d
,
1033 else /* al <= j || bl <= j */
1037 bn_mul_recursive(rr
->d
,a
->d
,b
->d
,
1044 if (i
== 1 && !BN_get_flags(b
,BN_FLG_STATIC_DATA
))
1046 BIGNUM
*tmp_bn
= (BIGNUM
*)b
;
1047 if (bn_wexpand(tmp_bn
,al
) == NULL
) goto err
;
1052 else if (i
== -1 && !BN_get_flags(a
,BN_FLG_STATIC_DATA
))
1054 BIGNUM
*tmp_bn
= (BIGNUM
*)a
;
1055 if (bn_wexpand(tmp_bn
,bl
) == NULL
) goto err
;
1062 /* symmetric and > 4 */
1064 j
=BN_num_bits_word((BN_ULONG
)al
);
1067 t
= BN_CTX_get(ctx
);
1068 if (al
== j
) /* exact multiple */
1070 if (bn_wexpand(t
,k
*2) == NULL
) goto err
;
1071 if (bn_wexpand(rr
,k
*2) == NULL
) goto err
;
1072 bn_mul_recursive(rr
->d
,a
->d
,b
->d
,al
,t
->d
);
1076 if (bn_wexpand(t
,k
*4) == NULL
) goto err
;
1077 if (bn_wexpand(rr
,k
*4) == NULL
) goto err
;
1078 bn_mul_part_recursive(rr
->d
,a
->d
,b
->d
,al
-j
,j
,t
->d
);
1085 #endif /* BN_RECURSION */
1086 if (bn_wexpand(rr
,top
) == NULL
) goto err
;
1088 bn_mul_normal(rr
->d
,a
->d
,al
,b
->d
,bl
);
1090 #if defined(BN_MUL_COMBA) || defined(BN_RECURSION)
1094 if (r
!= rr
) BN_copy(r
,rr
);
1102 void bn_mul_normal(BN_ULONG
*r
, BN_ULONG
*a
, int na
, BN_ULONG
*b
, int nb
)
1107 fprintf(stderr
," bn_mul_normal %d * %d\n",na
,nb
);
1115 itmp
=na
; na
=nb
; nb
=itmp
;
1116 ltmp
=a
; a
=b
; b
=ltmp
;
1122 (void)bn_mul_words(r
,a
,na
,0);
1126 rr
[0]=bn_mul_words(r
,a
,na
,b
[0]);
1130 if (--nb
<= 0) return;
1131 rr
[1]=bn_mul_add_words(&(r
[1]),a
,na
,b
[1]);
1132 if (--nb
<= 0) return;
1133 rr
[2]=bn_mul_add_words(&(r
[2]),a
,na
,b
[2]);
1134 if (--nb
<= 0) return;
1135 rr
[3]=bn_mul_add_words(&(r
[3]),a
,na
,b
[3]);
1136 if (--nb
<= 0) return;
1137 rr
[4]=bn_mul_add_words(&(r
[4]),a
,na
,b
[4]);
1144 void bn_mul_low_normal(BN_ULONG
*r
, BN_ULONG
*a
, BN_ULONG
*b
, int n
)
1147 fprintf(stderr
," bn_mul_low_normal %d * %d\n",n
,n
);
1149 bn_mul_words(r
,a
,n
,b
[0]);
1153 if (--n
<= 0) return;
1154 bn_mul_add_words(&(r
[1]),a
,n
,b
[1]);
1155 if (--n
<= 0) return;
1156 bn_mul_add_words(&(r
[2]),a
,n
,b
[2]);
1157 if (--n
<= 0) return;
1158 bn_mul_add_words(&(r
[3]),a
,n
,b
[3]);
1159 if (--n
<= 0) return;
1160 bn_mul_add_words(&(r
[4]),a
,n
,b
[4]);