Fast biased polynomial transforms for two-dimensional convolutions

The fast biased polynomial transforms are defined directly on the ZN¿1 ring instead of a conventional cyclotomic polynomial ring. Such biased polynomial transforms may be combined with very efficient fast FFT algorithms. Two-dimensional convolutions may be carried out without using the complicated Chinese remainder theorem, complex mapping and column-row reordering processes.