4 citations · 6 across the 2 of their papers we have counts for
6 papers
An in-place truncated Fourier transform
Nicholas Coxon
We show that simple modifications to van der Hoeven's forward and inverse truncated Fourier transforms allow the algorithms to be performed in-place, and with only a linear overhea…
Fast transforms over finite fields of characteristic two
Nicholas Coxon
An additive fast Fourier transform over a finite field of characteristic two efficiently evaluates polynomials at every element of an -linear subspace of the field. W…
Fast Hermite interpolation and evaluation over finite fields of characteristic two
Nicholas Coxon
This paper presents new fast algorithms for Hermite interpolation and evaluation over finite fields of characteristic two. The algorithms reduce the Hermite problems to instances o…
Fast systematic encoding of multiplicity codes
Nicholas Coxon
We present quasi-linear time systematic encoding algorithms for multiplicity codes. The algorithms have their origins in the fast multivariate interpolation and evaluation algorith…
Montgomery's method of polynomial selection for the number field sieve
Nicholas Coxon
The number field sieve is the most efficient known algorithm for factoring large integers that are free of small prime factors. For the polynomial selection stage of the algorithm,…
On nonlinear polynomial selection for the number field sieve
Nicholas Coxon
Nonlinear polynomial selection algorithms for the number field sieve address the problem of constructing polynomials with small coefficients by reducing to instances of the well-st…