Rader–Brenner Algorithm for Computing New Mersenne Number Transform

Error-free convolutions and correlations can be efficiently computed using number theoretic transforms. One particular transform, which is known as the new Mersenne number transform (NMNT), can be used for the calculation of long-length convolutions/correlations. In this brief, a new decimation-in-time algorithm for the fast calculation of the NMNT based on the Rader-Brenner approach is proposed. The structure of the NMNT can be further improved by means of the developed algorithm, which involves multiplication by constants that are simpler than vector rotation. In terms of arithmetic operation, the proposed algorithm achieves the lowest number of multiplication among all known butterfly-style algorithms. An example of large integer multiplication is given to prove the validity of the developed algorithm.

[1]  C. Burrus,et al.  Number theoretic transforms to implement fast digital convolution , 1975 .

[2]  V. Dimitrov,et al.  Generalized Fermat-Mersenne number theoretic transform , 1994 .

[3]  Adi Shamir,et al.  A method for obtaining digital signatures and public-key cryptosystems , 1978, CACM.

[4]  C. Rader,et al.  A new principle for fast Fourier transformation , 1976 .

[5]  M. Aziz,et al.  Radix-4 algorithm for the new Mersenne number transform , 2000, WCC 2000 - ICSP 2000. 2000 5th International Conference on Signal Processing Proceedings. 16th World Computer Congress 2000.

[6]  Martin Vetterli,et al.  Fast Fourier transforms: a tutorial review and a state of the art , 1990 .

[7]  Vassil S. Dimitrov,et al.  Fragile watermarking using finite field trigonometrical transforms , 2009, Signal Process. Image Commun..

[8]  Soo-Chang Pei,et al.  Closed-Form Orthogonal Number Theoretic Transform Eigenvectors and the Fast Fractional NTT , 2011, IEEE Transactions on Signal Processing.

[9]  Igor E. Shparlinski.  Number Theoretic Methods in Cryptography: Complexity lower bounds , 1999 .

[10]  C. Pomerance,et al.  Prime Numbers: A Computational Perspective , 2002 .

[11]  Richard Conway.  Modified Overlap Technique Using Fermat and Mersenne Transforms , 2006, IEEE Transactions on Circuits and Systems II: Express Briefs.

[12]  C. Burrus,et al.  Fast one-dimensional digital convolution by multidimensional techniques , 1974 .

[13]  Said Boussakta,et al.  Pipeline Architectures for Radix-2 New Mersenne Number Transform , 2009, IEEE Transactions on Circuits and Systems I: Regular Papers.

[14]  Igor E. Shparlinski,et al.  Number Theoretic Methods in Cryptography , 1999 .

[15]  Chris K. Caldwell,et al.  Prime Curios!: The Dictionary of Prime Number Trivia , 2009 .

[16]  A. G. J. Holt,et al.  New transform using the Mersenne numbers , 1995 .

[17]  R. Blahut.  Algebraic Codes for Data Transmission , 2002 .

[18]  Anindya De,et al.  Fast Integer Multiplication Using Modular Arithmetic , 2013, SIAM J. Comput..

[19]  Andrew E. Yagle.  Fast algorithms for matrix multiplication using pseudo-number-theoretic transforms , 1995, IEEE Trans. Signal Process..

[20]  Said Boussakta,et al.  Fast Parallel-Prefix Architectures for Modulo 2n-1 Addition with a Single Representation of Zero , 2007, IEEE Transactions on Computers.

[21]  Richard E. Blahut,et al.  Algebraic Codes for Data Transmission: Dedication , 2003 .

[22]  R. Nevin.  Application of the Rader-Brenner FFT algorithm to number-theoretic transforms , 1977 .