More Generalized Mersenne Numbers

  • Jaewook Chung
  • Anwar Hasan
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3006)


In 1999, Jerome Solinas introduced families of moduli called the generalized Mersenne numbers. The generalized Mersenne numbers are expressed in a polynomial form, p = f(t), where t is a power of 2. It is shown that such p’s lead to fast modular reduction methods which use only a few integer additions and subtractions. We further generalize this idea by allowing any integer for t. We show that more generalized Mersenne numbers still lead to a significant improvement over well-known modular multiplication techniques. While each generalized Mersenne number requires a dedicated implementation, more generalized Mersenne numbers allow flexible implementations that work for more than one modulus. We also show that it is possible to perform long integer modular arithmetic without using multiple precision operations when t is chosen properly. Moreover, based on our results, we propose efficient arithmetic methods for XTR cryptosystem.


Generalized Mersenne Numbers RSA XTR Montgomery Karatsuba-Ofman Modular Reduction 


  1. 1.
    Bailey, D.V., Paar, C.: Efficient arithmetic in finite field extensions with application in elliptic curve cryptography. Journal of Cryptology 14(3), 153–176 (2001)zbMATHMathSciNetGoogle Scholar
  2. 2.
    Crandall, R.E.: Method and apparatus for public key exchange in a cryptographic system (october 27, 1992) U.S. Paent # 5,159,632 Google Scholar
  3. 3.
    Knuth, D.E.: Seminumerical Algorithms. Addison-Wesley, Reading (1981)zbMATHGoogle Scholar
  4. 4.
    Lenstra, A.K., Verheul, E.R.: The XTR public key system. In: Bellare, M. (ed.) CRYPTO 2000. LNCS, vol. 1880, pp. 1–19. Springer, Heidelberg (2000)CrossRefGoogle Scholar
  5. 5.
    Menezes, A.J., van Oorschot, P.C., Vanstone, S.A.: Handbook of Applied Cryptography. CRC Press, Boca Raton (1997)zbMATHGoogle Scholar
  6. 6.
    National Institute of Standards and Technology. Digital signature standard (DSS). FIPS Publication 186-2 (February 2000)Google Scholar
  7. 7.
    National Institute of Standards and Technology. Recommended elliptic curves for federal government use (July 1999)Google Scholar
  8. 8.
    Solinas, J.A.: Generalized Mersenne numbers. Technical Report CORR 99-39, Centre for Applied Cryptographic Research, University of Waterloo (1999),

Copyright information

© Springer-Verlag Berlin Heidelberg 2004

Authors and Affiliations

  • Jaewook Chung
    • 1
  • Anwar Hasan
    • 1
  1. 1.Centre for Applied Cryptographic ResearchUniversity of WaterlooCanada

Personalised recommendations