File: README

package info (click to toggle)
gf2x 1.3.0-3
  • links: PTS, VCS
  • area: main
  • in suites: forky, sid, trixie
  • size: 4,000 kB
  • sloc: ansic: 14,162; sh: 7,809; cpp: 1,500; makefile: 980; perl: 176
file content (15 lines) | stat: -rw-r--r-- 673 bytes parent folder | download | duplicates (3)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
This sub-package provides a generic FFT API for multiplication of
polynomials over GF(2), and an implementation of Cantor's algorithm.

Three different FFT types are defined. They define similar interfaces. In
the documentation below, XXX may be one of
    gf2x_fake_fft -- just a proxy implementation that actually calls the
                     normal multiplication operations. Don't use, as it
                     incurs extra copies.
    gf2x_cantor_fft -- use Cantor's additive FFT
    gf2x_ternary_fft -- use Schönhage's ternary FFT

Other FFT modules can conceivably be added.

The actual documentation of the api can be found in the template.h
(pseudo-) header.