Two recently developed ideas, the conversion of a DFT to convolution and the implementation of short convolutions with a minimum of multiplications, are combined to give efficient algorithms for long transforms. Three transform algorithms are compared in terms of number of multiplications and additions. Timing for a prime factor FFT algorithm using high speed convolution, which was programmed for an IBM 37 and an 88 microprocessor, is presented.