3 * $Id: gfx-kmul.c,v 1.3 2004/03/27 17:54:11 mdw Exp $
5 * Karatsuba's multiplication algorithm on binary polynomials
7 * (c) 2000 Straylight/Edgeware
10 /*----- Licensing notice --------------------------------------------------*
12 * This file is part of Catacomb.
14 * Catacomb is free software; you can redistribute it and/or modify
15 * it under the terms of the GNU Library General Public License as
16 * published by the Free Software Foundation; either version 2 of the
17 * License, or (at your option) any later version.
19 * Catacomb is distributed in the hope that it will be useful,
20 * but WITHOUT ANY WARRANTY; without even the implied warranty of
21 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
22 * GNU Library General Public License for more details.
24 * You should have received a copy of the GNU Library General Public
25 * License along with Catacomb; if not, write to the Free
26 * Software Foundation, Inc., 59 Temple Place - Suite 330, Boston,
30 /*----- Revision history --------------------------------------------------*
32 * $Log: gfx-kmul.c,v $
33 * Revision 1.3 2004/03/27 17:54:11 mdw
34 * Standard curves and curve checking.
36 * Revision 1.2 2002/10/09 00:36:03 mdw
37 * Fix bounds on workspace for Karatsuba operations.
39 * Revision 1.1 2000/10/08 15:49:37 mdw
40 * First glimmerings of binary polynomial arithmetic.
44 /*----- Header files ------------------------------------------------------*/
50 #include "karatsuba.h"
52 /*----- Tweakables --------------------------------------------------------*/
59 /*----- Main code ---------------------------------------------------------*/
61 /* --- @gfx_kmul@ --- *
63 * Arguments: @mpw *dv, *dvl@ = pointer to destination buffer
64 * @const mpw *av, *avl@ = pointer to first argument
65 * @const mpw *bv, *bvl@ = pointer to second argument
66 * @mpw *sv, *svl@ = pointer to scratch workspace
70 * Use: Multiplies two binary polynomials using Karatsuba's
71 * algorithm. This is rather faster than traditional long
72 * multiplication (e.g., @gfx_umul@) on polynomials with large
73 * degree, although more expensive on small ones.
75 * The destination must be twice as large as the larger
76 * argument. The scratch space must be twice as large as the
80 void gfx_kmul(mpw
*dv
, mpw
*dvl
,
81 const mpw
*av
, const mpw
*avl
,
82 const mpw
*bv
, const mpw
*bvl
,
88 /* --- Dispose of easy cases to @mpx_umul@ --- *
90 * Karatsuba is only a win on large numbers, because of all the
91 * recursiveness and bookkeeping. The recursive calls make a quick check
92 * to see whether to bottom out to @gfx_umul@ which should help quite a
93 * lot, but sometimes the only way to know is to make sure...
99 if (avl
- av
<= GFK_THRESH
|| bvl
- bv
<= GFK_THRESH
) {
100 gfx_mul(dv
, dvl
, av
, avl
, bv
, bvl
);
104 /* --- How the algorithm works --- *
106 * Let %$A = xb + y$% and %$B = ub + v$%. Then, simply by expanding,
107 * %$AB = x u b^2 + b(x v + y u) + y v$%. That's not helped any, because
108 * I've got four multiplications, each four times easier than the one I
109 * started with. However, note that I can rewrite the coefficient of %$b$%
110 * as %$xv + yu = (x + y)(u + v) - xu - yv$%. The terms %$xu$% and %$yv$%
111 * I've already calculated, and that leaves only one more multiplication to
112 * do. So now I have three multiplications, each four times easier, and
116 /* --- First things --- *
118 * Sort out where to break the factors in half. I'll choose the midpoint
119 * of the larger one, since this minimizes the amount of work I have to do
123 if (avl
- av
> bvl
- bv
) {
124 m
= (avl
- av
+ 1) >> 1;
131 m
= (bvl
- bv
+ 1) >> 1;
139 /* --- Sort out the middle term --- */
142 mpw
*bsv
= sv
+ m
, *ssv
= bsv
+ m
;
143 mpw
*rdv
= dv
+ m
, *rdvl
= rdv
+ 2 * m
;
147 UXOR2(sv
, bsv
, av
, avm
, avm
, avl
);
148 UXOR2(bsv
, ssv
, bv
, bvm
, bvm
, bvl
);
150 gfx_kmul(rdv
, rdvl
, sv
, bsv
, bsv
, ssv
, ssv
, svl
);
152 gfx_mul(rdv
, rdvl
, sv
, bsv
, bsv
, ssv
);
155 /* --- Sort out the other two terms --- */
158 mpw
*svm
= sv
+ m
, *ssv
= svm
+ m
;
162 if (avl
== avm
|| bvl
== bvm
)
163 MPX_ZERO(rdv
+ m
, dvl
);
166 gfx_kmul(sv
, ssv
, avm
, avl
, bvm
, bvl
, ssv
, svl
);
168 gfx_mul(sv
, ssv
, avm
, avl
, bvm
, bvl
);
169 MPX_COPY(rdv
+ m
, dvl
, svm
, ssv
);
175 gfx_kmul(sv
, ssv
, av
, avm
, bv
, bvm
, ssv
, svl
);
177 gfx_mul(sv
, ssv
, av
, avm
, bv
, bvm
);
178 MPX_COPY(dv
, tdv
, sv
, svm
);
184 /*----- Test rig ----------------------------------------------------------*/
188 #include <mLib/alloc.h>
189 #include <mLib/testrig.h>
191 #define ALLOC(v, vl, sz) do { \
193 mpw *_vv = xmalloc(MPWS(_sz)); \
194 mpw *_vvl = _vv + _sz; \
199 #define LOAD(v, vl, d) do { \
200 const dstr *_d = (d); \
202 ALLOC(_v, _vl, MPW_RQ(_d->len)); \
203 mpx_loadb(_v, _vl, _d->buf, _d->len); \
208 #define MAX(x, y) ((x) > (y) ? (x) : (y))
210 static void dumpmp(const char *msg
, const mpw
*v
, const mpw
*vl
)
215 fprintf(stderr
, " %08lx", (unsigned long)*--vl
);
219 static int mul(dstr
*v
)
232 m
= MAX(al
- a
, bl
- b
) + 1;
236 gfx_kmul(d
, dl
, a
, al
, b
, bl
, s
, sl
);
237 if (!mpx_ueq(d
, dl
, c
, cl
)) {
238 fprintf(stderr
, "\n*** mul failed\n");
241 dumpmp("expected", c
, cl
);
242 dumpmp(" result", d
, dl
);
246 free(a
); free(b
); free(c
); free(d
); free(s
);
250 static test_chunk defs
[] = {
251 { "mul", mul
, { &type_hex
, &type_hex
, &type_hex
, 0 } },
255 int main(int argc
, char *argv
[])
257 test_run(argc
, argv
, defs
, SRCDIR
"/tests/gfx");
263 /*----- That's all, folks -------------------------------------------------*/