Abstract
Several asymmetric cryptographic systems such as the RSA system [6] require modular exponentiation of large integers. This paper discusses a modular routine described in [2], which is suited for smart cards. It is based on the Mohan-Adiga algorithm [5]. This algorithm is comparatively fast, if the leading half of the bits of the modulus is 1. It will be shown that this restriction has some severe implications on the number of suitable primes and on the security of the system. If one decrements the number of leading 1’s then the security level of the system is increased while the speed is decreased.
Chapter PDF
Similar content being viewed by others
Bibliography
W. Fumy and A. Pfau, On the Complexity of Asymmetric Smart Card Authentication, Proceedings Smart Card 2000, 1989.
H.-J. Knobloch, A Smart Card Implementation of the Fiat Shamir-Identificaton Scheme, in: Advances in Cryptology-Proceedings of Eurocrypt’ 88, Lecture Notes in Computer Science 330, Springer-Verlag 1988, 87–95.
E. Knuth, The Art of Computerprogramming, vol. 2, Seminumerical Algorithms, Addison-Wesley Publishing Company, Reading, 1980.
A. K. Lenstra and A. K. Manasse, Factoring with two large primes, Abstracts of Eurocrypt’ 90.
S. B. Mohan and B. S. Adiga, Fast Algorithms for Implementing RSA Public Key Cryptosystem, Electronic Letters (1985) vol. 21, no. 7, 761.
R. Rivest, A. Shamir and A. Adleman, A Method for Obtaining Digital Signatures and Public Key Cryptosystems, Commun. ACM (1978) 120–126.
C. Guillou and J.-J. Quisquater, Precautions Taken Against Various Potential Attacks in ISO/IEC DP 9796, Abstracts of Eurocrypt’ 90.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1991 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Meister, G. (1991). On an Implementation of the Mohan-Adiga Algorithm. In: Damgård, I.B. (eds) Advances in Cryptology — EUROCRYPT ’90. EUROCRYPT 1990. Lecture Notes in Computer Science, vol 473. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46877-3_48
Download citation
DOI: https://doi.org/10.1007/3-540-46877-3_48
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-53587-4
Online ISBN: 978-3-540-46877-6
eBook Packages: Springer Book Archive