Abstract
In SAC 2003, J. Chung and A. Hasan introduced a new class of specific moduli for cryptography, called the more generalized Mersenne numbers, in reference to J. Solinas’ generalized Mersenne numbers proposed in 1999. This paper pursues the quest. The main idea is a new representation, called Modular Number System (MNS), which allows efficient implementation of the modular arithmetic operations required in cryptography. We propose a modular multiplication which only requires n 2 multiplications and 3(2n 2 – n + 1) additions, where n is the size (in words) of the operands. Our solution is thus more efficient than Montgomery for a very large class of numbers that do not belong to the large Mersenne family.
Chapter PDF
Similar content being viewed by others
References
Barrett, P.: Implementing the rivest shamir and adleman public key encryption algorithm on a standard digital signal processor. In: Odlyzko, A.M. (ed.) CRYPTO 1986. LNCS, vol. 263, pp. 311–323. Springer, Heidelberg (1987)
Chung, J., Hasan, A.: More generalized mersenne numbers. In: Matsui, M., Zuccherato, R.J. (eds.) SAC 2003. LNCS, vol. 3006. Springer, Heidelberg (2004)
Crandall, R.: Method and apparatus for public key exchange in a cryptographic system. U.S. Patent number 5159632 (1992)
Hankerson, D., Menezes, A., Vanstone, S.: Guide to Elliptic Curve Cryptography. Springer, Heidelberg (2004)
Koç, Ç.K., Acar, T., Kaliski Jr., B.S.: Analyzing and comparing montgomery multiplication algorithms. IEEE Micro 16(3), 26–33 (1996)
Menezes, A.J., Van Oorschot, P.C., Vanstone, S.A.: Handbook of applied cryptography,2000 N.W. Corporate Blvd., Boca Raton, FL 33431-9868, USA. CRC Press, Boca Raton (1997)
Montgomery, P.L.: Modular multiplication without trial division. Mathematics of Computation 44(170), 519–521 (1985)
Solinas, J.: Generalized mersenne numbers. Research Report CORR-99-39, Center for Applied Cryptographic Research, Canada. University of Waterloo, Waterloo (1999)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bajard, JC., Imbert, L., Plantard, T. (2004). Modular Number Systems: Beyond the Mersenne Family. In: Handschuh, H., Hasan, M.A. (eds) Selected Areas in Cryptography. SAC 2004. Lecture Notes in Computer Science, vol 3357. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30564-4_11
Download citation
DOI: https://doi.org/10.1007/978-3-540-30564-4_11
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-24327-4
Online ISBN: 978-3-540-30564-4
eBook Packages: Computer ScienceComputer Science (R0)