Abstract
Montgomery multiplication is used to speed up modular multiplications involved in public-key cryptosystems. However, it requires conversion of parameters into N-residue representation. These additional pre-computations can be costly for low resource devices like smart cards. In this paper, we propose a new, more efficient method, suitable for smart card implementations of most of public-key cryptosystems. Our approach essentially consists in modifying the representation of the key and the algorithm embedded in smart card in order to take advantage of the Montgomery multiplication properties.
Chapter PDF
Similar content being viewed by others
References
Montgomery, P.L.: Modular multiplication without trial division. Mathematics of computation 44 (1985)
Knuth, D.E.: The Art of Computer Programming. In: Seminumerical Algorithms, 3rd edn., vol. 2, Addison-Wesley, Reading (1999)
Menezes, A.J., van Oorschot, P.C., Vanstone, S.A.: Handbook of Applied Cryptography. CRC Press, Boca Raton (1997)
Rivest, R., Shamir, A., Adleman, L.: A method for obtaining digital signatures and public-key cryptosystems. Comm. of the ACM 21, 120–126 (1978)
Couvreur, C., Quisquater, J.-J.: Fast decipherement algorithm for RSA public-key cryptosystem. Electronic Letters 18(21), 905–907 (1982)
Guillou, L.C., Ugon, M., Quisquater, J.-J.: Cryptographic authentication protocols for smart card. Computer Networks, 437–451 (2001)
ANSI X9.62. Public key cryptography for the financial services industry: The Elliptic Curve Digital Signature Algorithm, ECDSA (1999)
Kaliski, B.: The Montgomery Inverse and its application. IEEE Transactions on Computers 44, 1064 (1995)
Naccache, D., M’Raihi, D.: Montgomery-Suitable Cryptosystems. Algebraic Coding 781, 75–81 (1994)
Feige, U., Fiat, A., Shamir, A.: Zero-knowledge proofs of identity. Journal of Cryptology 1, 77–94 (1988)
Handschuh, H., Paillier, P.: Smart Card Crypto-Coprocessors for Public-Key Cryptography. CryptoBytes 4(1), 6–11 (1998)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 IFIP International Federation for Information Processing
About this paper
Cite this paper
Boscher, A., Naciri, R. (2006). Optimal Use of Montgomery Multiplication on Smart Cards. In: Domingo-Ferrer, J., Posegga, J., Schreckling, D. (eds) Smart Card Research and Advanced Applications. CARDIS 2006. Lecture Notes in Computer Science, vol 3928. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11733447_18
Download citation
DOI: https://doi.org/10.1007/11733447_18
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-33311-1
Online ISBN: 978-3-540-33312-8
eBook Packages: Computer ScienceComputer Science (R0)