\begin{thebibliography}{1}

\bibitem{B85:Fast}
R.~E. Blahut,
\newblock {\em Fast Algorithms for Digital Signal Processing},
\newblock Addison-Wesley publishing Company, 1985.

\bibitem{AHU74:Design}
J.~E.~Hopcroft A.~V.~Aho and J.~D. Ullman,
\newblock {\em The Design and Analysis of Computer Algorithms},
\newblock Addison-Wesley publishing Company, 1974.

\bibitem{P76:Implementation}
J.~M. Pollard,
\newblock ``Implementation of number theoretic transform,''
\newblock {\em Electronics Letters}, vol. 12, no. 15, pp. 378--379, July 1976.

\bibitem{L76:Simplified}
L.M. Leibowitz,
\newblock ``A simplified binary arithmetic for the {F}ermat number transform,''
\newblock {\em IEEE Transactions on Acoustics, Speech, and Signal Processing},
  vol. 24, pp. 356--359, 1976.

\bibitem{WJM96:Efficient}
G.~A.~Jullien Z.~Wang and W.~C. Miller,
\newblock ``An efficient tree architecture for modulo $2^n+1$ multiplication,''
\newblock {\em J. VLSI Signal Processing Systems}, vol. 14, no. 3, pp.
  241--248, Dec. 1996.

\bibitem{Z99:Efficient}
R.~Zimmermann,
\newblock ``Efficient {VLSI} implementation of modulo $(2^n \pm 1)$ addition
  and multiplication,''
\newblock in {\em Proceedings of the 14th IEEE Symposium on Computer
  Architecture}, 1999, pp. 158--167.

\bibitem{N82:Fast}
H.~J. Naussbaumer,
\newblock {\em Fast Fourier Transform and Convolution Algorithms},
\newblock Springer, Berlin, Germany, 1982.

\bibitem{N94:Differentially}
K.~Nyberg,
\newblock ``Differentially uniform mappings for cryptography,''
\newblock in {\em Advances in Cryptology, Proceedings Eurocrypt'93, LNCS 765,
  T. Helleseth, Ed.} 1994, pp. 55--64, Springer, Berlin, Germany.

\end{thebibliography}
