Abstract
This paper presents a cryptanalysis attack on the RSA cryptosystem. The method, Multiple Residue Method (MRM), makes use of an algorithm which determines the value of ϕ(n) and hence, for a given modulus n where n = p×q, the prime factors can be uncovered. This algorithm calculates and stores all possible residues of p, q and (p + q) in different moduli. It then applies the Chinese Remainder Theorem (CRT) to different combinations of residues until the correct value is calculated, [6]. Further properties in relation to this structure show that improvements in the search process, within the residue of all parameters involved, can be effectively achieved. Besides, it has been established that the security of the RSA is no greater than the difficulty of factoring the modulus n into a product of two secret primes p and q. However, the MRM approaches the factorisation problem from a different angle. This method is aimed at finding towards the ϕ(n) in O(2-j ×n), where j is the number of prime moduli. It may also be directed towards the computation of the sum (p + q) and, in the realistic case for the RSA, reduces to O(2-j×√n).
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Diffie, W., Hellman, M.E.: Privacy and Authentication: An Introduction to Cryptography. Proc. of the IEEE, Vol. 67, No. 3, (1979) 397–427
Rivest, R.L., Shamir, A., Adleman, L.: Method for Obtaining Digital Signatures and Public-key Cryptosystems. Com. of the ACM, Vol. 21, No. 2, (1978) 120–126
Pollard, J.M.: Theorems on Factoring and Primarily Testing. Proc. Cambridge Philos. Soc., Vol. 76, (1974) 521–528
Williams, H.C.: A p+1 Method of Factoring. Math. of Comp., Vol. 39, No. 159, (1982) 225–234
Wiener, M.J.: Cryptanalysis of Short RSA Secret Exponents. IEEE Trans. on Information Theory, Vol. 36, No. 3, (1990) 553–558
Tabatabaian, S.J., Hinton, O.R., Gorgui-Naguib, R.N.: The Use of a Novel Multiple Squared Residue Method in the Cryptanalysis of the RSA. Proc. of the Int. Symp. on Information Theory and Its Applications (ISITA’90) in Coop. with IEEE Information Theory Society, (1990) 975–978
Knuth, D.E.: The Art of Computer Programming-Vol. II: Seminumerical Algorithms. Second Edition, Addison-Wesley Publications Co. (1981)
Hashemian, R.: Square Rooting Algorithms for Integer and floating-point Number. IEEE Trans., Comput. Vol. 39, NO. 8 (1990) 1025–1029
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Tabatabaian, S.J., Ikeshiro, S., Gumussoy, M., Dhanda, M.S. (2001). A New Search Pattern in Multiple Residue Method (MRM) and Its Importance in the Cryptanalysis of the RSA. In: Honary, B. (eds) Cryptography and Coding. Cryptography and Coding 2001. Lecture Notes in Computer Science, vol 2260. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45325-3_35
Download citation
DOI: https://doi.org/10.1007/3-540-45325-3_35
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43026-1
Online ISBN: 978-3-540-45325-3
eBook Packages: Springer Book Archive