More Generalized Mersenne Numbers
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.
KeywordsGeneralized Mersenne Numbers RSA XTR Montgomery Karatsuba-Ofman Modular Reduction
- 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
- 6.National Institute of Standards and Technology. Digital signature standard (DSS). FIPS Publication 186-2 (February 2000)Google Scholar
- 7.National Institute of Standards and Technology. Recommended elliptic curves for federal government use (July 1999)Google Scholar
- 8.Solinas, J.A.: Generalized Mersenne numbers. Technical Report CORR 99-39, Centre for Applied Cryptographic Research, University of Waterloo (1999), http://cacr.uwaterloo.ca/techreports/1999/corr99-39.ps