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.]
64 /* Here follows specialised variants of bn_add_words() and
65 bn_sub_words(). They have the property performing operations on
66 arrays of different sizes. The sizes of those arrays is expressed through
67 cl, which is the common length ( basicall, min(len(a),len(b)) ), and dl,
68 which is the delta between the two lengths, calculated as len(a)-len(b).
69 All lengths are the number of BN_ULONGs... For the operations that require
70 a result array as parameter, it must have the length cl+abs(dl).
71 These functions should probably end up in bn_asm.c as soon as there are
72 assembler counterparts for the systems that use assembler files. */
74 BN_ULONG bn_sub_part_words(BN_ULONG *r,
75 const BN_ULONG *a, const BN_ULONG *b,
81 c = bn_sub_words(r, a, b, cl);
93 fprintf(stderr, " bn_sub_part_words %d + %d (dl < 0, c = %d)\n", cl, dl, c);
98 r[0] = (0-t-c)&BN_MASK2;
100 if (++dl >= 0) break;
103 r[1] = (0-t-c)&BN_MASK2;
105 if (++dl >= 0) break;
108 r[2] = (0-t-c)&BN_MASK2;
110 if (++dl >= 0) break;
113 r[3] = (0-t-c)&BN_MASK2;
115 if (++dl >= 0) break;
125 fprintf(stderr, " bn_sub_part_words %d + %d (dl > 0, c = %d)\n", cl, dl, c);
130 r[0] = (t-c)&BN_MASK2;
132 if (--dl <= 0) break;
135 r[1] = (t-c)&BN_MASK2;
137 if (--dl <= 0) break;
140 r[2] = (t-c)&BN_MASK2;
142 if (--dl <= 0) break;
145 r[3] = (t-c)&BN_MASK2;
147 if (--dl <= 0) break;
156 fprintf(stderr, " bn_sub_part_words %d + %d (dl > 0, c == 0)\n", cl, dl);
160 switch (save_dl - dl)
164 if (--dl <= 0) break;
167 if (--dl <= 0) break;
170 if (--dl <= 0) break;
179 fprintf(stderr, " bn_sub_part_words %d + %d (dl > 0, copy)\n", cl, dl);
184 if (--dl <= 0) break;
186 if (--dl <= 0) break;
188 if (--dl <= 0) break;
190 if (--dl <= 0) break;
200 BN_ULONG bn_add_part_words(BN_ULONG *r,
201 const BN_ULONG *a, const BN_ULONG *b,
207 c = bn_add_words(r, a, b, cl);
220 fprintf(stderr, " bn_add_part_words %d + %d (dl < 0, c = %d)\n", cl, dl, c);
227 if (++dl >= 0) break;
232 if (++dl >= 0) break;
237 if (++dl >= 0) break;
242 if (++dl >= 0) break;
251 fprintf(stderr, " bn_add_part_words %d + %d (dl < 0, c == 0)\n", cl, dl);
255 switch (dl - save_dl)
259 if (++dl >= 0) break;
262 if (++dl >= 0) break;
265 if (++dl >= 0) break;
274 fprintf(stderr, " bn_add_part_words %d + %d (dl < 0, copy)\n", cl, dl);
279 if (++dl >= 0) break;
281 if (++dl >= 0) break;
283 if (++dl >= 0) break;
285 if (++dl >= 0) break;
296 fprintf(stderr, " bn_add_part_words %d + %d (dl > 0)\n", cl, dl);
303 if (--dl <= 0) break;
308 if (--dl <= 0) break;
313 if (--dl <= 0) break;
318 if (--dl <= 0) break;
325 fprintf(stderr, " bn_add_part_words %d + %d (dl > 0, c == 0)\n", cl, dl);
331 switch (save_dl - dl)
335 if (--dl <= 0) break;
338 if (--dl <= 0) break;
341 if (--dl <= 0) break;
350 fprintf(stderr, " bn_add_part_words %d + %d (dl > 0, copy)\n", cl, dl);
355 if (--dl <= 0) break;
357 if (--dl <= 0) break;
359 if (--dl <= 0) break;
361 if (--dl <= 0) break;
372 /* Karatsuba recursive multiplication algorithm
373 * (cf. Knuth, The Art of Computer Programming, Vol. 2) */
375 /* r is 2*n2 words in size,
376 * a and b are both n2 words in size.
377 * n2 must be a power of 2.
378 * We multiply and return the result.
379 * t must be 2*n2 words in size
382 * a[0]*b[0]+a[1]*b[1]+(a[0]-a[1])*(b[1]-b[0])
385 void bn_mul_recursive(BN_ULONG *r, BN_ULONG *a, BN_ULONG *b, int n2,
386 int dna, int dnb, BN_ULONG *t)
389 int tna=n+dna, tnb=n+dnb;
390 unsigned int neg,zero;
394 fprintf(stderr," bn_mul_recursive %d * %d\n",n2,n2);
400 bn_mul_comba4(r,a,b);
406 bn_mul_comba8(r,a,b);
409 # endif /* BN_MUL_COMBA */
410 if (n2 < BN_MUL_RECURSIVE_SIZE_NORMAL)
412 /* This should not happen */
413 bn_mul_normal(r,a,n2,b,n2);
416 /* r=(a[0]-a[1])*(b[1]-b[0]) */
417 c1=bn_cmp_part_words(a,&(a[n]),tna,n-tna);
418 c2=bn_cmp_part_words(&(b[n]),b,tnb,tnb-n);
423 bn_sub_part_words(t, &(a[n]),a, tna,tna-n); /* - */
424 bn_sub_part_words(&(t[n]),b, &(b[n]),tnb,n-tnb); /* - */
430 bn_sub_part_words(t, &(a[n]),a, tna,tna-n); /* - */
431 bn_sub_part_words(&(t[n]),&(b[n]),b, tnb,tnb-n); /* + */
440 bn_sub_part_words(t, a, &(a[n]),tna,n-tna); /* + */
441 bn_sub_part_words(&(t[n]),b, &(b[n]),tnb,n-tnb); /* - */
448 bn_sub_part_words(t, a, &(a[n]),tna,n-tna);
449 bn_sub_part_words(&(t[n]),&(b[n]),b, tnb,tnb-n);
457 bn_mul_comba4(&(t[n2]),t,&(t[n]));
459 memset(&(t[n2]),0,8*sizeof(BN_ULONG));
461 bn_mul_comba4(r,a,b);
462 bn_mul_comba4(&(r[n2]),&(a[n]),&(b[n]));
467 bn_mul_comba8(&(t[n2]),t,&(t[n]));
469 memset(&(t[n2]),0,16*sizeof(BN_ULONG));
471 bn_mul_comba8(r,a,b);
472 bn_mul_comba8(&(r[n2]),&(a[n]),&(b[n]));
475 # endif /* BN_MUL_COMBA */
479 bn_mul_recursive(&(t[n2]),t,&(t[n]),n,0,0,p);
481 memset(&(t[n2]),0,n2*sizeof(BN_ULONG));
482 bn_mul_recursive(r,a,b,n,0,0,p);
483 bn_mul_recursive(&(r[n2]),&(a[n]),&(b[n]),n,dna,dnb,p);
486 /* t[32] holds (a[0]-a[1])*(b[1]-b[0]), c1 is the sign
487 * r[10] holds (a[0]*b[0])
488 * r[32] holds (b[1]*b[1])
491 c1=(int)(bn_add_words(t,r,&(r[n2]),n2));
493 if (neg) /* if t[32] is negative */
495 c1-=(int)(bn_sub_words(&(t[n2]),t,&(t[n2]),n2));
499 /* Might have a carry */
500 c1+=(int)(bn_add_words(&(t[n2]),&(t[n2]),t,n2));
503 /* t[32] holds (a[0]-a[1])*(b[1]-b[0])+(a[0]*b[0])+(a[1]*b[1])
504 * r[10] holds (a[0]*b[0])
505 * r[32] holds (b[1]*b[1])
506 * c1 holds the carry bits
508 c1+=(int)(bn_add_words(&(r[n]),&(r[n]),&(t[n2]),n2));
516 /* The overflow will stop before we over write
517 * words we should not overwrite */
518 if (ln < (BN_ULONG)c1)
530 /* n+tn is the word length
531 * t needs to be n*4 is size, as does r */
532 void bn_mul_part_recursive(BN_ULONG *r, BN_ULONG *a, BN_ULONG *b, int n,
533 int tna, int tnb, BN_ULONG *t)
536 unsigned int c1,c2,neg,zero;
540 fprintf(stderr," bn_mul_part_recursive (%d+%d) * (%d+%d)\n",
545 bn_mul_normal(r,a,n+tna,b,n+tnb);
549 /* r=(a[0]-a[1])*(b[1]-b[0]) */
550 c1=bn_cmp_part_words(a,&(a[n]),tna,n-tna);
551 c2=bn_cmp_part_words(&(b[n]),b,tnb,tnb-n);
556 bn_sub_part_words(t, &(a[n]),a, tna,tna-n); /* - */
557 bn_sub_part_words(&(t[n]),b, &(b[n]),tnb,n-tnb); /* - */
563 bn_sub_part_words(t, &(a[n]),a, tna,tna-n); /* - */
564 bn_sub_part_words(&(t[n]),&(b[n]),b, tnb,tnb-n); /* + */
573 bn_sub_part_words(t, a, &(a[n]),tna,n-tna); /* + */
574 bn_sub_part_words(&(t[n]),b, &(b[n]),tnb,n-tnb); /* - */
581 bn_sub_part_words(t, a, &(a[n]),tna,n-tna);
582 bn_sub_part_words(&(t[n]),&(b[n]),b, tnb,tnb-n);
585 /* The zero case isn't yet implemented here. The speedup
586 would probably be negligible. */
590 bn_mul_comba4(&(t[n2]),t,&(t[n]));
591 bn_mul_comba4(r,a,b);
592 bn_mul_normal(&(r[n2]),&(a[n]),tn,&(b[n]),tn);
593 memset(&(r[n2+tn*2]),0,sizeof(BN_ULONG)*(n2-tn*2));
599 bn_mul_comba8(&(t[n2]),t,&(t[n]));
600 bn_mul_comba8(r,a,b);
601 bn_mul_normal(&(r[n2]),&(a[n]),tna,&(b[n]),tnb);
602 memset(&(r[n2+tna+tnb]),0,sizeof(BN_ULONG)*(n2-tna-tnb));
607 bn_mul_recursive(&(t[n2]),t,&(t[n]),n,0,0,p);
608 bn_mul_recursive(r,a,b,n,0,0,p);
610 /* If there is only a bottom half to the number,
618 bn_mul_recursive(&(r[n2]),&(a[n]),&(b[n]),
620 memset(&(r[n2+i*2]),0,sizeof(BN_ULONG)*(n2-i*2));
622 else if (j > 0) /* eg, n == 16, i == 8 and tn == 11 */
624 bn_mul_part_recursive(&(r[n2]),&(a[n]),&(b[n]),
626 memset(&(r[n2+tna+tnb]),0,
627 sizeof(BN_ULONG)*(n2-tna-tnb));
629 else /* (j < 0) eg, n == 16, i == 8 and tn == 5 */
631 memset(&(r[n2]),0,sizeof(BN_ULONG)*n2);
632 if (tna < BN_MUL_RECURSIVE_SIZE_NORMAL
633 && tnb < BN_MUL_RECURSIVE_SIZE_NORMAL)
635 bn_mul_normal(&(r[n2]),&(a[n]),tna,&(b[n]),tnb);
642 if (i < tna && i < tnb)
644 bn_mul_part_recursive(&(r[n2]),
649 else if (i <= tna && i <= tnb)
651 bn_mul_recursive(&(r[n2]),
661 /* t[32] holds (a[0]-a[1])*(b[1]-b[0]), c1 is the sign
662 * r[10] holds (a[0]*b[0])
663 * r[32] holds (b[1]*b[1])
666 c1=(int)(bn_add_words(t,r,&(r[n2]),n2));
668 if (neg) /* if t[32] is negative */
670 c1-=(int)(bn_sub_words(&(t[n2]),t,&(t[n2]),n2));
674 /* Might have a carry */
675 c1+=(int)(bn_add_words(&(t[n2]),&(t[n2]),t,n2));
678 /* t[32] holds (a[0]-a[1])*(b[1]-b[0])+(a[0]*b[0])+(a[1]*b[1])
679 * r[10] holds (a[0]*b[0])
680 * r[32] holds (b[1]*b[1])
681 * c1 holds the carry bits
683 c1+=(int)(bn_add_words(&(r[n]),&(r[n]),&(t[n2]),n2));
691 /* The overflow will stop before we over write
692 * words we should not overwrite */
705 /* a and b must be the same size, which is n2.
706 * r needs to be n2 words and t needs to be n2*2
708 void bn_mul_low_recursive(BN_ULONG *r, BN_ULONG *a, BN_ULONG *b, int n2,
714 fprintf(stderr," bn_mul_low_recursive %d * %d\n",n2,n2);
717 bn_mul_recursive(r,a,b,n,0,0,&(t[0]));
718 if (n >= BN_MUL_LOW_RECURSIVE_SIZE_NORMAL)
720 bn_mul_low_recursive(&(t[0]),&(a[0]),&(b[n]),n,&(t[n2]));
721 bn_add_words(&(r[n]),&(r[n]),&(t[0]),n);
722 bn_mul_low_recursive(&(t[0]),&(a[n]),&(b[0]),n,&(t[n2]));
723 bn_add_words(&(r[n]),&(r[n]),&(t[0]),n);
727 bn_mul_low_normal(&(t[0]),&(a[0]),&(b[n]),n);
728 bn_mul_low_normal(&(t[n]),&(a[n]),&(b[0]),n);
729 bn_add_words(&(r[n]),&(r[n]),&(t[0]),n);
730 bn_add_words(&(r[n]),&(r[n]),&(t[n]),n);
734 /* a and b must be the same size, which is n2.
735 * r needs to be n2 words and t needs to be n2*2
736 * l is the low words of the output.
739 void bn_mul_high(BN_ULONG *r, BN_ULONG *a, BN_ULONG *b, BN_ULONG *l, int n2,
745 BN_ULONG ll,lc,*lp,*mp;
748 fprintf(stderr," bn_mul_high %d * %d\n",n2,n2);
752 /* Calculate (al-ah)*(bh-bl) */
754 c1=bn_cmp_words(&(a[0]),&(a[n]),n);
755 c2=bn_cmp_words(&(b[n]),&(b[0]),n);
759 bn_sub_words(&(r[0]),&(a[n]),&(a[0]),n);
760 bn_sub_words(&(r[n]),&(b[0]),&(b[n]),n);
766 bn_sub_words(&(r[0]),&(a[n]),&(a[0]),n);
767 bn_sub_words(&(r[n]),&(b[n]),&(b[0]),n);
776 bn_sub_words(&(r[0]),&(a[0]),&(a[n]),n);
777 bn_sub_words(&(r[n]),&(b[0]),&(b[n]),n);
784 bn_sub_words(&(r[0]),&(a[0]),&(a[n]),n);
785 bn_sub_words(&(r[n]),&(b[n]),&(b[0]),n);
790 /* t[10] = (a[0]-a[1])*(b[1]-b[0]) */
791 /* r[10] = (a[1]*b[1]) */
795 bn_mul_comba8(&(t[0]),&(r[0]),&(r[n]));
796 bn_mul_comba8(r,&(a[n]),&(b[n]));
801 bn_mul_recursive(&(t[0]),&(r[0]),&(r[n]),n,0,0,&(t[n2]));
802 bn_mul_recursive(r,&(a[n]),&(b[n]),n,0,0,&(t[n2]));
806 * s1 == low(ah*bh)+low((al-ah)*(bh-bl))+low(al*bl)+high(al*bl)
807 * We know s0 and s1 so the only unknown is high(al*bl)
808 * high(al*bl) == s1 - low(ah*bh+s0+(al-ah)*(bh-bl))
809 * high(al*bl) == s1 - (r[0]+l[0]+t[0])
814 c1=(int)(bn_add_words(lp,&(r[0]),&(l[0]),n));
823 neg=(int)(bn_sub_words(&(t[n2]),lp,&(t[0]),n));
826 bn_add_words(&(t[n2]),lp,&(t[0]),n);
832 bn_sub_words(&(t[n2+n]),&(l[n]),&(t[n2]),n);
839 lp[i]=((~mp[i])+1)&BN_MASK2;
844 * t[10] = (a[0]-a[1])*(b[1]-b[0]) neg is the sign
845 * r[10] = (a[1]*b[1])
848 * R[21] = al*bl + ah*bh + (a[0]-a[1])*(b[1]-b[0])
851 /* R[1]=t[3]+l[0]+r[0](+-)t[0] (have carry/borrow)
852 * R[2]=r[0]+t[3]+r[1](+-)t[1] (have carry/borrow)
853 * R[3]=r[1]+(carry/borrow)
858 c1= (int)(bn_add_words(lp,&(t[n2+n]),&(l[0]),n));
865 c1+=(int)(bn_add_words(&(t[n2]),lp, &(r[0]),n));
867 c1-=(int)(bn_sub_words(&(t[n2]),&(t[n2]),&(t[0]),n));
869 c1+=(int)(bn_add_words(&(t[n2]),&(t[n2]),&(t[0]),n));
871 c2 =(int)(bn_add_words(&(r[0]),&(r[0]),&(t[n2+n]),n));
872 c2+=(int)(bn_add_words(&(r[0]),&(r[0]),&(r[n]),n));
874 c2-=(int)(bn_sub_words(&(r[0]),&(r[0]),&(t[n]),n));
876 c2+=(int)(bn_add_words(&(r[0]),&(r[0]),&(t[n]),n));
878 if (c1 != 0) /* Add starting at r[0], could be +ve or -ve */
885 ll=(r[i]+lc)&BN_MASK2;
895 r[i++]=(ll-lc)&BN_MASK2;
900 if (c2 != 0) /* Add starting at r[1] */
907 ll=(r[i]+lc)&BN_MASK2;
917 r[i++]=(ll-lc)&BN_MASK2;
923 #endif /* BN_RECURSION */
925 int BN_mul(BIGNUM *r, const BIGNUM *a, const BIGNUM *b, BN_CTX *ctx)
930 #if defined(BN_MUL_COMBA) || defined(BN_RECURSION)
939 fprintf(stderr,"BN_mul %d * %d\n",a->top,b->top);
949 if ((al == 0) || (bl == 0))
957 if ((r == a) || (r == b))
959 if ((rr = BN_CTX_get(ctx)) == NULL) goto err;
963 rr->neg=a->neg^b->neg;
965 #if defined(BN_MUL_COMBA) || defined(BN_RECURSION)
974 if (bn_wexpand(rr,8) == NULL) goto err;
976 bn_mul_comba4(rr->d,a->d,b->d);
982 if (bn_wexpand(rr,16) == NULL) goto err;
984 bn_mul_comba8(rr->d,a->d,b->d);
988 #endif /* BN_MUL_COMBA */
990 if ((al >= BN_MULL_SIZE_NORMAL) && (bl >= BN_MULL_SIZE_NORMAL))
992 if (i >= -1 && i <= 1)
995 /* Find out the power of two lower or equal
996 to the longest of the two numbers */
999 j = BN_num_bits_word((BN_ULONG)al);
1003 j = BN_num_bits_word((BN_ULONG)bl);
1007 assert(j <= al || j <= bl);
1009 t = BN_CTX_get(ctx);
1010 if (al > j || bl > j)
1014 bn_mul_part_recursive(rr->d,a->d,b->d,
1017 else /* al <= j || bl <= j */
1021 bn_mul_recursive(rr->d,a->d,b->d,
1028 if (i == 1 && !BN_get_flags(b,BN_FLG_STATIC_DATA))
1030 BIGNUM *tmp_bn = (BIGNUM *)b;
1031 bn_wexpand(tmp_bn,al);
1036 else if (i == -1 && !BN_get_flags(a,BN_FLG_STATIC_DATA))
1038 BIGNUM *tmp_bn = (BIGNUM *)a;
1039 bn_wexpand(tmp_bn,bl);
1046 /* symmetric and > 4 */
1048 j=BN_num_bits_word((BN_ULONG)al);
1051 t = BN_CTX_get(ctx);
1052 if (al == j) /* exact multiple */
1056 bn_mul_recursive(rr->d,a->d,b->d,al,t->d);
1062 bn_mul_part_recursive(rr->d,a->d,b->d,al-j,j,t->d);
1069 #endif /* BN_RECURSION */
1070 if (bn_wexpand(rr,top) == NULL) goto err;
1072 bn_mul_normal(rr->d,a->d,al,b->d,bl);
1074 #if defined(BN_MUL_COMBA) || defined(BN_RECURSION)
1078 if (r != rr) BN_copy(r,rr);
1085 void bn_mul_normal(BN_ULONG *r, BN_ULONG *a, int na, BN_ULONG *b, int nb)
1090 fprintf(stderr," bn_mul_normal %d * %d\n",na,nb);
1098 itmp=na; na=nb; nb=itmp;
1099 ltmp=a; a=b; b=ltmp;
1103 rr[0]=bn_mul_words(r,a,na,b[0]);
1107 if (--nb <= 0) return;
1108 rr[1]=bn_mul_add_words(&(r[1]),a,na,b[1]);
1109 if (--nb <= 0) return;
1110 rr[2]=bn_mul_add_words(&(r[2]),a,na,b[2]);
1111 if (--nb <= 0) return;
1112 rr[3]=bn_mul_add_words(&(r[3]),a,na,b[3]);
1113 if (--nb <= 0) return;
1114 rr[4]=bn_mul_add_words(&(r[4]),a,na,b[4]);
1121 void bn_mul_low_normal(BN_ULONG *r, BN_ULONG *a, BN_ULONG *b, int n)
1124 fprintf(stderr," bn_mul_low_normal %d * %d\n",n,n);
1126 bn_mul_words(r,a,n,b[0]);
1130 if (--n <= 0) return;
1131 bn_mul_add_words(&(r[1]),a,n,b[1]);
1132 if (--n <= 0) return;
1133 bn_mul_add_words(&(r[2]),a,n,b[2]);
1134 if (--n <= 0) return;
1135 bn_mul_add_words(&(r[3]),a,n,b[3]);
1136 if (--n <= 0) return;
1137 bn_mul_add_words(&(r[4]),a,n,b[4]);