pub/dh-kcdsa.c: Free the correct factor.
[catacomb] / math / Makefile.am
CommitLineData
0f00dc4c
MW
1### -*-makefile-*-
2###
3### Build script for mathematical infrastructure
4###
5### (c) 2013 Straylight/Edgeware
6###
7
8###----- Licensing notice ---------------------------------------------------
9###
10### This file is part of Catacomb.
11###
12### Catacomb is free software; you can redistribute it and/or modify
13### it under the terms of the GNU Library General Public License as
14### published by the Free Software Foundation; either version 2 of the
15### License, or (at your option) any later version.
16###
17### Catacomb is distributed in the hope that it will be useful,
18### but WITHOUT ANY WARRANTY; without even the implied warranty of
19### MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
20### GNU Library General Public License for more details.
21###
22### You should have received a copy of the GNU Library General Public
23### License along with Catacomb; if not, write to the Free
24### Software Foundation, Inc., 59 Temple Place - Suite 330, Boston,
25### MA 02111-1307, USA.
26
27include $(top_srcdir)/vars.am
28
29noinst_LTLIBRARIES = libmath.la
30libmath_la_SOURCES =
31nodist_libmath_la_SOURCES =
32libmath_la_LIBADD =
33
34TEST_LIBS = libmath.la
35
36###--------------------------------------------------------------------------
1c3d4cf5
MW
37### Representation of multiprecision integers.
38
39## The `mpgen' tool for dealing with these things.
40mpgen = $(srcdir)/mpgen
41EXTRA_DIST += mpgen
3eda76a3
MW
42AM_V_MPGEN = $(AM_V_MPGEN_@AM_V@)
43AM_V_MPGEN_ = $(AM_V_MPGEN_@AM_DEFAULT_V@)
44AM_V_MPGEN_0 = @echo " MPGEN $@";
1c3d4cf5
MW
45MPGEN = $(AM_V_MPGEN)$(PYTHON) $(mpgen)
46
47## The type information collected by `configure'.
48CLEANFILES += typeinfo.py
49EXTRA_DIST += typeinfo.py.in
50typeinfo.py: $(srcdir)/typeinfo.py.in Makefile
51 $(SUBST) $(srcdir)/typeinfo.py.in >typeinfo.py.new \
52 type_bits="@type_bits@" \
53 limits="@limits@" && \
54 mv typeinfo.py.new typeinfo.py
55
56## The header file containing our representation choices.
57BUILT_SOURCES += mptypes.h
58CLEANFILES += mptypes.h
59nodist_archinclude_HEADERS += mptypes.h
60mptypes.h: $(mpgen) typeinfo.py
61 $(MPGEN) mptypes >mptypes.h.in && mv mptypes.h.in mptypes.h
62
63## Limits of C types as multiprecision integers.
64BUILT_SOURCES += mplimits.h mplimits.c
65CLEANFILES += mplimits.h mplimits.c
66nodist_archinclude_HEADERS += mplimits.h
67nodist_libmath_la_SOURCES += mplimits.c
68mplimits.h: $(mpgen) typeinfo.py
69 $(MPGEN) mplimits_h >mplimits.h.in && mv mplimits.h.in mplimits.h
70mplimits.c: $(mpgen) typeinfo.py
71 $(MPGEN) mplimits_c >mplimits.c.in && mv mplimits.c.in mplimits.c
0f00dc4c 72
1c3d4cf5
MW
73###--------------------------------------------------------------------------
74### Main multiprecision integer library.
0f00dc4c
MW
75
76## Additional buffer I/O functions for mathematical objects.
77pkginclude_HEADERS += buf.h
78libmath_la_SOURCES += buf.c
79
80## Infrastructure for fast exponentiation.
81pkginclude_HEADERS += exp.h
82libmath_la_SOURCES += exp.c
83
84## Main user-visible multiprecision arithmetic.
85pkginclude_HEADERS += mp.h
1c3d4cf5 86libmath_la_SOURCES += mp-arith.c
ba57d652 87TESTS += mp-arith.t$(EXEEXT)
1c3d4cf5 88libmath_la_SOURCES += mp-const.c
0f00dc4c
MW
89libmath_la_SOURCES += mp-exp.c mp-exp.h
90libmath_la_SOURCES += mp-gcd.c
ba57d652 91TESTS += mp-gcd.t$(EXEEXT)
1c3d4cf5 92libmath_la_SOURCES += mp-io.c
0f00dc4c 93libmath_la_SOURCES += mp-jacobi.c
ba57d652 94TESTS += mp-jacobi.t$(EXEEXT)
1c3d4cf5
MW
95libmath_la_SOURCES += mp-mem.c
96libmath_la_SOURCES += mp-misc.c
0f00dc4c 97libmath_la_SOURCES += mp-modexp.c
ba57d652 98TESTS += mp-modexp.t$(EXEEXT)
0f00dc4c 99libmath_la_SOURCES += mp-modsqrt.c
ba57d652 100TESTS += mp-modsqrt.t$(EXEEXT)
0f00dc4c 101libmath_la_SOURCES += mp-sqrt.c
ba57d652 102TESTS += mp-sqrt.t$(EXEEXT)
0f00dc4c
MW
103libmath_la_SOURCES += mp-test.c
104EXTRA_DIST += t/mp
105
106## Computing Fibonacci numbers.
107pkginclude_HEADERS += mp-fibonacci.h
108libmath_la_SOURCES += mp-fibonacci.c
ba57d652 109TESTS += mp-fibonacci.t$(EXEEXT)
0f00dc4c
MW
110
111## Special memory allocation for multiprecision integers.
112pkginclude_HEADERS += mparena.h
1c3d4cf5 113libmath_la_SOURCES += mparena.c
0f00dc4c
MW
114
115## Barrett reduction, an efficient method for modular reduction.
116pkginclude_HEADERS += mpbarrett.h
117libmath_la_SOURCES += mpbarrett.c
ba57d652 118TESTS += mpbarrett.t$(EXEEXT)
0f00dc4c 119libmath_la_SOURCES += mpbarrett-exp.c mpbarrett-mexp.c mpbarrett-exp.h
ba57d652
MW
120TESTS += mpbarrett-exp.t$(EXEEXT) mpbarrett-mexp.t$(EXEEXT)
121TESTS += mpbarrett.t$(EXEEXT)
0f00dc4c
MW
122EXTRA_DIST += t/mpbarrett
123
124## Solving congruences using the Chinese Remainder Theorem.
125pkginclude_HEADERS += mpcrt.h
126libmath_la_SOURCES += mpcrt.c
ba57d652 127TESTS += mpcrt.t$(EXEEXT)
0f00dc4c
MW
128EXTRA_DIST += t/mpcrt
129
130## Conversions between machine-native and multiprecision integers.
131pkginclude_HEADERS += mpint.h
132libmath_la_SOURCES += mpint.c
ba57d652 133TESTS += mpint.t$(EXEEXT)
0f00dc4c
MW
134EXTRA_DIST += t/mpint
135
0f00dc4c
MW
136## Montgomery reduction, a clever method for modular arithmetic.
137pkginclude_HEADERS += mpmont.h
138libmath_la_SOURCES += mpmont.c
ba57d652 139TESTS += mpmont.t$(EXEEXT)
0f00dc4c 140libmath_la_SOURCES += mpmont-exp.c mpmont-mexp.c mpmont-exp.h
ba57d652 141TESTS += mpmont-exp.t$(EXEEXT) mpmont-mexp.t$(EXEEXT)
0f00dc4c
MW
142EXTRA_DIST += t/mpmont
143
144## Efficient multiplication of many small numbers.
145pkginclude_HEADERS += mpmul.h
146libmath_la_SOURCES += mpmul.c
ba57d652 147TESTS += mpmul.t$(EXEEXT)
0f00dc4c
MW
148
149## Generating random numbers.
150pkginclude_HEADERS += mprand.h
151libmath_la_SOURCES += mprand.c
152
153## Efficient reduction modulo numbers with conveninent binary
154## representations.
155pkginclude_HEADERS += mpreduce.h
156libmath_la_SOURCES += mpreduce.c mpreduce-exp.h
ba57d652 157TESTS += mpreduce.t$(EXEEXT)
0f00dc4c
MW
158EXTRA_DIST += t/mpreduce
159
160## Iteratiion over the bianry representation of multiprecision integers.
161pkginclude_HEADERS += mpscan.h
1c3d4cf5 162libmath_la_SOURCES += mpscan.c
0f00dc4c
MW
163
164## Conversion between multiprecision integers and their textual
165## representations.
166pkginclude_HEADERS += mptext.h
1c3d4cf5 167libmath_la_SOURCES += mptext.c
ba57d652 168TESTS += mptext.t$(EXEEXT)
0f00dc4c
MW
169libmath_la_SOURCES += mptext-dstr.c
170libmath_la_SOURCES += mptext-file.c
171libmath_la_SOURCES += mptext-len.c
1c3d4cf5 172libmath_la_SOURCES += mptext-string.c
0f00dc4c
MW
173EXTRA_DIST += t/mptext
174
0f00dc4c
MW
175## Low-level multiprecision arithmetic.
176pkginclude_HEADERS += mpx.h bitops.h mpw.h
1c3d4cf5 177libmath_la_SOURCES += mpx.c
ba57d652 178TESTS += mpx.t$(EXEEXT)
1c3d4cf5 179libmath_la_SOURCES += karatsuba.h mpx-kmul.c mpx-ksqr.c
ba57d652 180TESTS += mpx-kmul.t$(EXEEXT) mpx-ksqr.t$(EXEEXT)
0f00dc4c
MW
181noinst_PROGRAMS += bittest
182TESTS += bittest
183EXTRA_DIST += t/mpx
1e8abdf5 184
444083ae 185if CPUFAM_X86
7ba379a6
MW
186MPX_MUL4_SOURCES = mpx-mul4-x86-sse2.S
187check_PROGRAMS += mpx-mul4.t
188TESTS += mpx-mul4.t$(EXEEXT)
444083ae 189endif
3119b3ae 190if CPUFAM_AMD64
7ba379a6
MW
191MPX_MUL4_SOURCES = mpx-mul4-amd64-sse2.S
192check_PROGRAMS += mpx-mul4.t
193TESTS += mpx-mul4.t$(EXEEXT)
3119b3ae 194endif
7ba379a6 195libmath_la_SOURCES += $(MPX_MUL4_SOURCES)
7ba379a6
MW
196mpx_mul4_t_SOURCES = mpx-mul4-test.c $(MPX_MUL4_SOURCES)
197mpx_mul4_t_CPPFLAGS = \
198 $(AM_CPPFLAGS) \
199 -DTEST_MUL4 -DSRCDIR="\"$(srcdir)\""
200mpx_mul4_t_LDADD = $(top_builddir)/libcatacomb.la $(mLib_LIBS)
1e8abdf5 201EXTRA_DIST += t/mpx-mul4
0f00dc4c
MW
202
203## A quick-and-dirty parser, used for parsing descriptions of groups, fields,
204## etc.
205pkginclude_HEADERS += qdparse.h
206libmath_la_SOURCES += qdparse.c
207
208## Pollard's `rho' algorithm for determining discrete logarithms.
209pkginclude_HEADERS += rho.h
210libmath_la_SOURCES += rho.c
ba57d652 211TESTS += rho.t$(EXEEXT)
0f00dc4c
MW
212
213###--------------------------------------------------------------------------
214### Prime number checking, searching, and related jobs.
215
216## Generating Lim--Lee groups, i.e., unit groups of finite fields without
217## small subgroups (except for the obvious ones).
218pkginclude_HEADERS += limlee.h
219libmath_la_SOURCES += limlee.c
220
221## A table of small prime numbers.
c9cfa678
MW
222pkginclude_HEADERS += $(precomp)/math/primetab.h
223nodist_libmath_la_SOURCES += ../precomp/math/primetab.c
224PRECOMPS += $(precomp)/math/primetab.h \
225 $(precomp)/math/primetab.c
e5b61a8d 226PRECOMP_PROGS += genprimes
0f00dc4c 227genprimes_LDADD = $(mLib_LIBS)
e5b61a8d 228if !CROSS_COMPILING
c9cfa678
MW
229$(precomp)/math/primetab.h: $(precomp)/math/primetab.c
230$(precomp)/math/primetab.c:
231 $(AM_V_at)$(MKDIR_P) $(precomp)/math
ba57d652 232 $(AM_V_at)$(MAKE) genprimes$(EXEEXT)
e5b61a8d 233 $(AM_V_GEN)./genprimes -sCATACOMB_PRIMETAB_H \
c9cfa678 234 -h$(precomp)/math/primetab.h -c$(precomp)/math/primetab.c \
0f00dc4c 235 -n256 -t"unsigned short" -iprimetab
e5b61a8d 236endif
0f00dc4c
MW
237
238## Filtering candidate prime numbers by checking for small factors
239## efficiently.
240pkginclude_HEADERS += pfilt.h
241libmath_la_SOURCES += pfilt.c
242
243## Generating prime numbers (and other kinds of numbers which need searching
244## for).
245pkginclude_HEADERS += pgen.h
246libmath_la_SOURCES += pgen.c
247libmath_la_SOURCES += pgen-gcd.c
248libmath_la_SOURCES += pgen-simul.c
249libmath_la_SOURCES += pgen-stdev.c
ba57d652 250TESTS += pgen.t$(EXEEXT)
0f00dc4c
MW
251EXTRA_DIST += t/pgen
252
253## Finding primitive elements in finite fields.
254pkginclude_HEADERS += prim.h
255libmath_la_SOURCES += prim.c
256
257## Iterating over all prime numbers from a given starting point.
258pkginclude_HEADERS += primeiter.h
259libmath_la_SOURCES += primeiter.c
ba57d652 260TESTS += primeiter.t$(EXEEXT)
c9cfa678 261primeiter.lo: $(precomp)/math/wheel.h
0f00dc4c
MW
262
263## The Miller--Rabin primality test.
264pkginclude_HEADERS += rabin.h
265libmath_la_SOURCES += rabin.c
266
267## Finding `strong' primes, using Gordon's algorithm. Once upon a time,
268## products of these kinds of numbers were harder to factor.
269pkginclude_HEADERS += strongprime.h
270libmath_la_SOURCES += strongprime.c
271
272## A `wheel', used by the prime iteration machinery.
c9cfa678
MW
273pkginclude_HEADERS += $(precomp)/math/wheel.h
274nodist_libmath_la_SOURCES += ../precomp/math/wheel.c
275PRECOMPS += $(precomp)/math/wheel.h $(precomp)/math/wheel.c
e5b61a8d 276PRECOMP_PROGS += genwheel
0f00dc4c 277genwheel_LDADD = $(mLib_LIBS)
e5b61a8d 278if !CROSS_COMPILING
c9cfa678
MW
279$(precomp)/math/wheel.h: $(precomp)/math/wheel.c
280$(precomp)/math/wheel.c:
281 $(AM_V_at)$(MKDIR_P) $(precomp)/math
ba57d652 282 $(AM_V_at)$(MAKE) genwheel$(EXEEXT)
e5b61a8d 283 $(AM_V_GEN)./genwheel -sCATACOMB_WHEEL_H \
c9cfa678 284 -h$(precomp)/math/wheel.h -c$(precomp)/math/wheel.c \
0f00dc4c 285 -n5 -t"unsigned char" -iwheel
e5b61a8d 286endif
0f00dc4c
MW
287
288###--------------------------------------------------------------------------
289### Binary polynomial arithmetic.
290
291## User-visible binary polynomial arithmetic.
292pkginclude_HEADERS += gf.h
293libmath_la_SOURCES += gf-arith.c
ba57d652 294TESTS += gf-arith.t$(EXEEXT)
0f00dc4c
MW
295libmath_la_SOURCES += gf-exp.c gf-exp.h
296libmath_la_SOURCES += gf-gcd.c
ba57d652 297TESTS += gf-gcd.t$(EXEEXT)
0f00dc4c
MW
298EXTRA_DIST += t/gf
299
300## Low-level binary polynomial arithmetic.
301pkginclude_HEADERS += gfx.h
302libmath_la_SOURCES += gfx.c
ba57d652 303TESTS += gfx.t$(EXEEXT)
0f00dc4c 304libmath_la_SOURCES += gfx-kmul.c
ba57d652 305TESTS += gfx-kmul.t$(EXEEXT)
c9cfa678
MW
306libmath_la_SOURCES += gfx-sqr.c
307nodist_libmath_la_SOURCES += ../precomp/math/gfx-sqrtab.c
308PRECOMPS += $(precomp)/math/gfx-sqrtab.c
e5b61a8d
MW
309PRECOMP_PROGS += gfx-sqr-mktab
310if !CROSS_COMPILING
c9cfa678
MW
311$(precomp)/math/gfx-sqrtab.c:
312 $(AM_V_at)$(MKDIR_P) $(precomp)/math
ba57d652 313 $(AM_V_at)$(MAKE) gfx-sqr-mktab$(EXEEXT)
c9cfa678
MW
314 $(AM_V_GEN)./gfx-sqr-mktab >$(precomp)/math/gfx-sqrtab.c.new && \
315 mv $(precomp)/math/gfx-sqrtab.c.new \
316 $(precomp)/math/gfx-sqrtab.c
e5b61a8d 317endif
ba57d652 318TESTS += gfx-sqr.t$(EXEEXT)
0f00dc4c
MW
319EXTRA_DIST += t/gfx
320
321## Conversions between normal and polynomial basis representations for binary
322## fields.
323pkginclude_HEADERS += gfn.h
324libmath_la_SOURCES += gfn.c
ba57d652 325TESTS += gfn.t$(EXEEXT)
0f00dc4c
MW
326EXTRA_DIST += t/gfn
327
328## Efficient reduction modulo sparse polynomials.
329pkginclude_HEADERS += gfreduce.h
330libmath_la_SOURCES += gfreduce.c gfreduce-exp.h
ba57d652 331TESTS += gfreduce.t$(EXEEXT)
0f00dc4c
MW
332EXTRA_DIST += t/gfreduce
333
334###--------------------------------------------------------------------------
335### Abstractions for various kinds of algebraic objects.
336
337## Abstract cyclic groups.
338pkginclude_HEADERS += group.h group-guts.h
339libmath_la_SOURCES += group-dstr.c
340libmath_la_SOURCES += group-exp.c group-exp.h
341libmath_la_SOURCES += group-file.c
342libmath_la_SOURCES += group-parse.c
343libmath_la_SOURCES += group-stdops.c
344libmath_la_SOURCES += group-string.c
345libmath_la_SOURCES += g-bin.c
346libmath_la_SOURCES += g-prime.c
347libmath_la_SOURCES += g-ec.c
348EXTRA_DIST += group-test.c
ba57d652 349TESTS += group-test.t$(EXEEXT)
0f00dc4c
MW
350EXTRA_DIST += t/group
351
352## Abstract finite fields.
353pkginclude_HEADERS += field.h field-guts.h
354libmath_la_SOURCES += field.c
355libmath_la_SOURCES += field-exp.c field-exp.h
356libmath_la_SOURCES += field-parse.c
357libmath_la_SOURCES += f-binpoly.c
358libmath_la_SOURCES += f-niceprime.c
359libmath_la_SOURCES += f-prime.c
360
361## Table of built-in binary fields.
362pkginclude_HEADERS += bintab.h
1c3d4cf5 363nodist_libmath_la_SOURCES += bintab.c
0f00dc4c 364CLEANFILES += bintab.c
1c3d4cf5
MW
365EXTRA_DIST += bintab.in
366bintab.c: $(mpgen) typeinfo.py bintab.in
367 $(MPGEN) bintab $(srcdir)/bintab.in >bintab.c.new && \
368 mv bintab.c.new bintab.c
0f00dc4c
MW
369
370## Table of built-in prime fields.
371pkginclude_HEADERS += ptab.h
1c3d4cf5 372nodist_libmath_la_SOURCES += ptab.c
0f00dc4c 373CLEANFILES += ptab.c
1c3d4cf5
MW
374EXTRA_DIST += ptab.in
375ptab.c: $(mpgen) typeinfo.py ptab.in
376 $(MPGEN) ptab $(srcdir)/ptab.in >ptab.c.new && \
377 mv ptab.c.new ptab.c
0f00dc4c
MW
378
379###--------------------------------------------------------------------------
380### Elliptic curve arithmetic.
381
382## Basic elliptic curve arithmetic.
383pkginclude_HEADERS += ec.h ec-guts.h
384libmath_la_SOURCES += ec.c
385libmath_la_SOURCES += ec-exp.c ec-exp.h
386libmath_la_SOURCES += ec-info.c
ba57d652 387TESTS += ec-info.t$(EXEEXT)
0f00dc4c 388libmath_la_SOURCES += ec-bin.c
ba57d652 389TESTS += ec-bin.t$(EXEEXT)
0f00dc4c 390libmath_la_SOURCES += ec-prime.c
ba57d652 391TESTS += ec-prime.t$(EXEEXT)
0f00dc4c
MW
392EXTRA_DIST += t/ec
393
394## The standard `raw' encoding (`EC2OSP') of elliptic curve points.
395pkginclude_HEADERS += ec-raw.h
396libmath_la_SOURCES += ec-raw.c
397
398## Assistance for elliptic-curve keys.
399pkginclude_HEADERS += ec-keys.h
400libmath_la_SOURCES += ec-fetch.c
401
402## Test infrastructure for elliptic curves.
403pkginclude_HEADERS += ec-test.h
404libmath_la_SOURCES += ec-test.c
ba57d652 405TESTS += ec-test.t$(EXEEXT)
0f00dc4c 406
1c3d4cf5 407## Table of built-in elliptic-curve groups.
0f00dc4c 408pkginclude_HEADERS += ectab.h
1c3d4cf5 409nodist_libmath_la_SOURCES += ectab.c
0f00dc4c 410CLEANFILES += ectab.c
1c3d4cf5
MW
411EXTRA_DIST += ectab.in
412ectab.c: $(mpgen) typeinfo.py ectab.in
413 $(MPGEN) ectab $(srcdir)/ectab.in >ectab.c.new && \
414 mv ectab.c.new ectab.c
0f00dc4c 415
ee39a683
MW
416###--------------------------------------------------------------------------
417### Other strange things.
418
419pkginclude_HEADERS += qfarith.h
420
421pkginclude_HEADERS += f25519.h
422libmath_la_SOURCES += f25519.c
423TESTS += f25519.t$(EXEEXT)
424TESTS += f25519-p10.t$(EXEEXT)
425EXTRA_DIST += t/f25519
426
427check_PROGRAMS += f25519-p10.t
428f25519_p10_t_SOURCES = f25519.c
429f25519_p10_t_CPPFLAGS = $(AM_CPPFLAGS) -DTEST_RIG -DSRCDIR="\"$(srcdir)\""
430f25519_p10_t_CPPFLAGS += -DF25519_IMPL=10
431f25519_p10_t_LDADD = $(TEST_LIBS) $(top_builddir)/libcatacomb.la
432f25519_p10_t_LDADD += $(mLib_LIBS) $(CATACOMB_LIBS) $(LIBS)
433
266efb73
MW
434pkginclude_HEADERS += fgoldi.h
435libmath_la_SOURCES += fgoldi.c
436TESTS += fgoldi.t$(EXEEXT)
437TESTS += fgoldi-p12.t$(EXEEXT)
438EXTRA_DIST += t/fgoldi
439
440check_PROGRAMS += fgoldi-p12.t
441fgoldi_p12_t_SOURCES = fgoldi.c
442fgoldi_p12_t_CPPFLAGS = $(AM_CPPFLAGS) -DTEST_RIG -DSRCDIR="\"$(srcdir)\""
443fgoldi_p12_t_CPPFLAGS += -DFGOLDI_IMPL=12
444fgoldi_p12_t_LDADD = $(TEST_LIBS) $(top_builddir)/libcatacomb.la
445fgoldi_p12_t_LDADD += $(mLib_LIBS) $(CATACOMB_LIBS) $(LIBS)
446
d56fd9d1
MW
447pkginclude_HEADERS += scaf.h
448libmath_la_SOURCES += scaf.c
449
fc2d44af 450pkginclude_HEADERS += montladder.h
581ac808 451pkginclude_HEADERS += scmul.h
fc2d44af 452
0f00dc4c 453###----- That's all, folks --------------------------------------------------