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(NO_ASM) || !defined(__i386) /* Assembler implementation exists only for x86 */
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);
413 bn_mul_comba8(r,a,b);
416 # endif /* BN_MUL_COMBA */
417 if (n2 < BN_MUL_RECURSIVE_SIZE_NORMAL)
419 /* This should not happen */
420 bn_mul_normal(r,a,n2,b,n2);
423 /* r=(a[0]-a[1])*(b[1]-b[0]) */
424 c1=bn_cmp_part_words(a,&(a[n]),tna,n-tna);
425 c2=bn_cmp_part_words(&(b[n]),b,tnb,tnb-n);
430 bn_sub_part_words(t, &(a[n]),a, tna,tna-n); /* - */
431 bn_sub_part_words(&(t[n]),b, &(b[n]),tnb,n-tnb); /* - */
437 bn_sub_part_words(t, &(a[n]),a, tna,tna-n); /* - */
438 bn_sub_part_words(&(t[n]),&(b[n]),b, tnb,tnb-n); /* + */
447 bn_sub_part_words(t, a, &(a[n]),tna,n-tna); /* + */
448 bn_sub_part_words(&(t[n]),b, &(b[n]),tnb,n-tnb); /* - */
455 bn_sub_part_words(t, a, &(a[n]),tna,n-tna);
456 bn_sub_part_words(&(t[n]),&(b[n]),b, tnb,tnb-n);
461 if (n == 4 && dna == 0 && dnb == 0) /* XXX: bn_mul_comba4 could take
462 extra args to do this well */
465 bn_mul_comba4(&(t[n2]),t,&(t[n]));
467 memset(&(t[n2]),0,8*sizeof(BN_ULONG));
469 bn_mul_comba4(r,a,b);
470 bn_mul_comba4(&(r[n2]),&(a[n]),&(b[n]));
472 else if (n == 8 && dna == 0 && dnb == 0) /* XXX: bn_mul_comba8 could
473 take extra args to do this
477 bn_mul_comba8(&(t[n2]),t,&(t[n]));
479 memset(&(t[n2]),0,16*sizeof(BN_ULONG));
481 bn_mul_comba8(r,a,b);
482 bn_mul_comba8(&(r[n2]),&(a[n]),&(b[n]));
485 # endif /* BN_MUL_COMBA */
489 bn_mul_recursive(&(t[n2]),t,&(t[n]),n,0,0,p);
491 memset(&(t[n2]),0,n2*sizeof(BN_ULONG));
492 bn_mul_recursive(r,a,b,n,0,0,p);
493 bn_mul_recursive(&(r[n2]),&(a[n]),&(b[n]),n,dna,dnb,p);
496 /* t[32] holds (a[0]-a[1])*(b[1]-b[0]), c1 is the sign
497 * r[10] holds (a[0]*b[0])
498 * r[32] holds (b[1]*b[1])
501 c1=(int)(bn_add_words(t,r,&(r[n2]),n2));
503 if (neg) /* if t[32] is negative */
505 c1-=(int)(bn_sub_words(&(t[n2]),t,&(t[n2]),n2));
509 /* Might have a carry */
510 c1+=(int)(bn_add_words(&(t[n2]),&(t[n2]),t,n2));
513 /* t[32] holds (a[0]-a[1])*(b[1]-b[0])+(a[0]*b[0])+(a[1]*b[1])
514 * r[10] holds (a[0]*b[0])
515 * r[32] holds (b[1]*b[1])
516 * c1 holds the carry bits
518 c1+=(int)(bn_add_words(&(r[n]),&(r[n]),&(t[n2]),n2));
526 /* The overflow will stop before we over write
527 * words we should not overwrite */
528 if (ln < (BN_ULONG)c1)
540 /* n+tn is the word length
541 * t needs to be n*4 is size, as does r */
542 void bn_mul_part_recursive(BN_ULONG *r, BN_ULONG *a, BN_ULONG *b, int n,
543 int tna, int tnb, BN_ULONG *t)
546 unsigned int c1,c2,neg,zero;
550 fprintf(stderr," bn_mul_part_recursive (%d+%d) * (%d+%d)\n",
555 bn_mul_normal(r,a,n+tna,b,n+tnb);
559 /* r=(a[0]-a[1])*(b[1]-b[0]) */
560 c1=bn_cmp_part_words(a,&(a[n]),tna,n-tna);
561 c2=bn_cmp_part_words(&(b[n]),b,tnb,tnb-n);
566 bn_sub_part_words(t, &(a[n]),a, tna,tna-n); /* - */
567 bn_sub_part_words(&(t[n]),b, &(b[n]),tnb,n-tnb); /* - */
573 bn_sub_part_words(t, &(a[n]),a, tna,tna-n); /* - */
574 bn_sub_part_words(&(t[n]),&(b[n]),b, tnb,tnb-n); /* + */
583 bn_sub_part_words(t, a, &(a[n]),tna,n-tna); /* + */
584 bn_sub_part_words(&(t[n]),b, &(b[n]),tnb,n-tnb); /* - */
591 bn_sub_part_words(t, a, &(a[n]),tna,n-tna);
592 bn_sub_part_words(&(t[n]),&(b[n]),b, tnb,tnb-n);
595 /* The zero case isn't yet implemented here. The speedup
596 would probably be negligible. */
600 bn_mul_comba4(&(t[n2]),t,&(t[n]));
601 bn_mul_comba4(r,a,b);
602 bn_mul_normal(&(r[n2]),&(a[n]),tn,&(b[n]),tn);
603 memset(&(r[n2+tn*2]),0,sizeof(BN_ULONG)*(n2-tn*2));
609 bn_mul_comba8(&(t[n2]),t,&(t[n]));
610 bn_mul_comba8(r,a,b);
611 bn_mul_normal(&(r[n2]),&(a[n]),tna,&(b[n]),tnb);
612 memset(&(r[n2+tna+tnb]),0,sizeof(BN_ULONG)*(n2-tna-tnb));
617 bn_mul_recursive(&(t[n2]),t,&(t[n]),n,0,0,p);
618 bn_mul_recursive(r,a,b,n,0,0,p);
620 /* If there is only a bottom half to the number,
628 bn_mul_recursive(&(r[n2]),&(a[n]),&(b[n]),
630 memset(&(r[n2+i*2]),0,sizeof(BN_ULONG)*(n2-i*2));
632 else if (j > 0) /* eg, n == 16, i == 8 and tn == 11 */
634 bn_mul_part_recursive(&(r[n2]),&(a[n]),&(b[n]),
636 memset(&(r[n2+tna+tnb]),0,
637 sizeof(BN_ULONG)*(n2-tna-tnb));
639 else /* (j < 0) eg, n == 16, i == 8 and tn == 5 */
641 memset(&(r[n2]),0,sizeof(BN_ULONG)*n2);
642 if (tna < BN_MUL_RECURSIVE_SIZE_NORMAL
643 && tnb < BN_MUL_RECURSIVE_SIZE_NORMAL)
645 bn_mul_normal(&(r[n2]),&(a[n]),tna,&(b[n]),tnb);
652 if (i < tna && i < tnb)
654 bn_mul_part_recursive(&(r[n2]),
659 else if (i <= tna && i <= tnb)
661 bn_mul_recursive(&(r[n2]),
671 /* t[32] holds (a[0]-a[1])*(b[1]-b[0]), c1 is the sign
672 * r[10] holds (a[0]*b[0])
673 * r[32] holds (b[1]*b[1])
676 c1=(int)(bn_add_words(t,r,&(r[n2]),n2));
678 if (neg) /* if t[32] is negative */
680 c1-=(int)(bn_sub_words(&(t[n2]),t,&(t[n2]),n2));
684 /* Might have a carry */
685 c1+=(int)(bn_add_words(&(t[n2]),&(t[n2]),t,n2));
688 /* t[32] holds (a[0]-a[1])*(b[1]-b[0])+(a[0]*b[0])+(a[1]*b[1])
689 * r[10] holds (a[0]*b[0])
690 * r[32] holds (b[1]*b[1])
691 * c1 holds the carry bits
693 c1+=(int)(bn_add_words(&(r[n]),&(r[n]),&(t[n2]),n2));
701 /* The overflow will stop before we over write
702 * words we should not overwrite */
715 /* a and b must be the same size, which is n2.
716 * r needs to be n2 words and t needs to be n2*2
718 void bn_mul_low_recursive(BN_ULONG *r, BN_ULONG *a, BN_ULONG *b, int n2,
724 fprintf(stderr," bn_mul_low_recursive %d * %d\n",n2,n2);
727 bn_mul_recursive(r,a,b,n,0,0,&(t[0]));
728 if (n >= BN_MUL_LOW_RECURSIVE_SIZE_NORMAL)
730 bn_mul_low_recursive(&(t[0]),&(a[0]),&(b[n]),n,&(t[n2]));
731 bn_add_words(&(r[n]),&(r[n]),&(t[0]),n);
732 bn_mul_low_recursive(&(t[0]),&(a[n]),&(b[0]),n,&(t[n2]));
733 bn_add_words(&(r[n]),&(r[n]),&(t[0]),n);
737 bn_mul_low_normal(&(t[0]),&(a[0]),&(b[n]),n);
738 bn_mul_low_normal(&(t[n]),&(a[n]),&(b[0]),n);
739 bn_add_words(&(r[n]),&(r[n]),&(t[0]),n);
740 bn_add_words(&(r[n]),&(r[n]),&(t[n]),n);
744 /* a and b must be the same size, which is n2.
745 * r needs to be n2 words and t needs to be n2*2
746 * l is the low words of the output.
749 void bn_mul_high(BN_ULONG *r, BN_ULONG *a, BN_ULONG *b, BN_ULONG *l, int n2,
755 BN_ULONG ll,lc,*lp,*mp;
758 fprintf(stderr," bn_mul_high %d * %d\n",n2,n2);
762 /* Calculate (al-ah)*(bh-bl) */
764 c1=bn_cmp_words(&(a[0]),&(a[n]),n);
765 c2=bn_cmp_words(&(b[n]),&(b[0]),n);
769 bn_sub_words(&(r[0]),&(a[n]),&(a[0]),n);
770 bn_sub_words(&(r[n]),&(b[0]),&(b[n]),n);
776 bn_sub_words(&(r[0]),&(a[n]),&(a[0]),n);
777 bn_sub_words(&(r[n]),&(b[n]),&(b[0]),n);
786 bn_sub_words(&(r[0]),&(a[0]),&(a[n]),n);
787 bn_sub_words(&(r[n]),&(b[0]),&(b[n]),n);
794 bn_sub_words(&(r[0]),&(a[0]),&(a[n]),n);
795 bn_sub_words(&(r[n]),&(b[n]),&(b[0]),n);
800 /* t[10] = (a[0]-a[1])*(b[1]-b[0]) */
801 /* r[10] = (a[1]*b[1]) */
805 bn_mul_comba8(&(t[0]),&(r[0]),&(r[n]));
806 bn_mul_comba8(r,&(a[n]),&(b[n]));
811 bn_mul_recursive(&(t[0]),&(r[0]),&(r[n]),n,0,0,&(t[n2]));
812 bn_mul_recursive(r,&(a[n]),&(b[n]),n,0,0,&(t[n2]));
816 * s1 == low(ah*bh)+low((al-ah)*(bh-bl))+low(al*bl)+high(al*bl)
817 * We know s0 and s1 so the only unknown is high(al*bl)
818 * high(al*bl) == s1 - low(ah*bh+s0+(al-ah)*(bh-bl))
819 * high(al*bl) == s1 - (r[0]+l[0]+t[0])
824 c1=(int)(bn_add_words(lp,&(r[0]),&(l[0]),n));
833 neg=(int)(bn_sub_words(&(t[n2]),lp,&(t[0]),n));
836 bn_add_words(&(t[n2]),lp,&(t[0]),n);
842 bn_sub_words(&(t[n2+n]),&(l[n]),&(t[n2]),n);
849 lp[i]=((~mp[i])+1)&BN_MASK2;
854 * t[10] = (a[0]-a[1])*(b[1]-b[0]) neg is the sign
855 * r[10] = (a[1]*b[1])
858 * R[21] = al*bl + ah*bh + (a[0]-a[1])*(b[1]-b[0])
861 /* R[1]=t[3]+l[0]+r[0](+-)t[0] (have carry/borrow)
862 * R[2]=r[0]+t[3]+r[1](+-)t[1] (have carry/borrow)
863 * R[3]=r[1]+(carry/borrow)
868 c1= (int)(bn_add_words(lp,&(t[n2+n]),&(l[0]),n));
875 c1+=(int)(bn_add_words(&(t[n2]),lp, &(r[0]),n));
877 c1-=(int)(bn_sub_words(&(t[n2]),&(t[n2]),&(t[0]),n));
879 c1+=(int)(bn_add_words(&(t[n2]),&(t[n2]),&(t[0]),n));
881 c2 =(int)(bn_add_words(&(r[0]),&(r[0]),&(t[n2+n]),n));
882 c2+=(int)(bn_add_words(&(r[0]),&(r[0]),&(r[n]),n));
884 c2-=(int)(bn_sub_words(&(r[0]),&(r[0]),&(t[n]),n));
886 c2+=(int)(bn_add_words(&(r[0]),&(r[0]),&(t[n]),n));
888 if (c1 != 0) /* Add starting at r[0], could be +ve or -ve */
895 ll=(r[i]+lc)&BN_MASK2;
905 r[i++]=(ll-lc)&BN_MASK2;
910 if (c2 != 0) /* Add starting at r[1] */
917 ll=(r[i]+lc)&BN_MASK2;
927 r[i++]=(ll-lc)&BN_MASK2;
933 #endif /* BN_RECURSION */
935 int BN_mul(BIGNUM *r, const BIGNUM *a, const BIGNUM *b, BN_CTX *ctx)
940 #if defined(BN_MUL_COMBA) || defined(BN_RECURSION)
949 fprintf(stderr,"BN_mul %d * %d\n",a->top,b->top);
959 if ((al == 0) || (bl == 0))
967 if ((r == a) || (r == b))
969 if ((rr = BN_CTX_get(ctx)) == NULL) goto err;
973 rr->neg=a->neg^b->neg;
975 #if defined(BN_MUL_COMBA) || defined(BN_RECURSION)
984 if (bn_wexpand(rr,8) == NULL) goto err;
986 bn_mul_comba4(rr->d,a->d,b->d);
992 if (bn_wexpand(rr,16) == NULL) goto err;
994 bn_mul_comba8(rr->d,a->d,b->d);
998 #endif /* BN_MUL_COMBA */
1000 if ((al >= BN_MULL_SIZE_NORMAL) && (bl >= BN_MULL_SIZE_NORMAL))
1002 if (i >= -1 && i <= 1)
1005 /* Find out the power of two lower or equal
1006 to the longest of the two numbers */
1009 j = BN_num_bits_word((BN_ULONG)al);
1013 j = BN_num_bits_word((BN_ULONG)bl);
1017 assert(j <= al || j <= bl);
1019 t = BN_CTX_get(ctx);
1020 if (al > j || bl > j)
1024 bn_mul_part_recursive(rr->d,a->d,b->d,
1027 else /* al <= j || bl <= j */
1031 bn_mul_recursive(rr->d,a->d,b->d,
1038 if (i == 1 && !BN_get_flags(b,BN_FLG_STATIC_DATA))
1040 BIGNUM *tmp_bn = (BIGNUM *)b;
1041 bn_wexpand(tmp_bn,al);
1046 else if (i == -1 && !BN_get_flags(a,BN_FLG_STATIC_DATA))
1048 BIGNUM *tmp_bn = (BIGNUM *)a;
1049 bn_wexpand(tmp_bn,bl);
1056 /* symmetric and > 4 */
1058 j=BN_num_bits_word((BN_ULONG)al);
1061 t = BN_CTX_get(ctx);
1062 if (al == j) /* exact multiple */
1066 bn_mul_recursive(rr->d,a->d,b->d,al,t->d);
1072 bn_mul_part_recursive(rr->d,a->d,b->d,al-j,j,t->d);
1079 #endif /* BN_RECURSION */
1080 if (bn_wexpand(rr,top) == NULL) goto err;
1082 bn_mul_normal(rr->d,a->d,al,b->d,bl);
1084 #if defined(BN_MUL_COMBA) || defined(BN_RECURSION)
1088 if (r != rr) BN_copy(r,rr);
1095 void bn_mul_normal(BN_ULONG *r, BN_ULONG *a, int na, BN_ULONG *b, int nb)
1100 fprintf(stderr," bn_mul_normal %d * %d\n",na,nb);
1108 itmp=na; na=nb; nb=itmp;
1109 ltmp=a; a=b; b=ltmp;
1115 (void)bn_mul_words(r,a,na,0);
1119 rr[0]=bn_mul_words(r,a,na,b[0]);
1123 if (--nb <= 0) return;
1124 rr[1]=bn_mul_add_words(&(r[1]),a,na,b[1]);
1125 if (--nb <= 0) return;
1126 rr[2]=bn_mul_add_words(&(r[2]),a,na,b[2]);
1127 if (--nb <= 0) return;
1128 rr[3]=bn_mul_add_words(&(r[3]),a,na,b[3]);
1129 if (--nb <= 0) return;
1130 rr[4]=bn_mul_add_words(&(r[4]),a,na,b[4]);
1137 void bn_mul_low_normal(BN_ULONG *r, BN_ULONG *a, BN_ULONG *b, int n)
1140 fprintf(stderr," bn_mul_low_normal %d * %d\n",n,n);
1142 bn_mul_words(r,a,n,b[0]);
1146 if (--n <= 0) return;
1147 bn_mul_add_words(&(r[1]),a,n,b[1]);
1148 if (--n <= 0) return;
1149 bn_mul_add_words(&(r[2]),a,n,b[2]);
1150 if (--n <= 0) return;
1151 bn_mul_add_words(&(r[3]),a,n,b[3]);
1152 if (--n <= 0) return;
1153 bn_mul_add_words(&(r[4]),a,n,b[4]);