Advertisement

Attacks and Threats on RSA

  • Sreemoyee BiswasEmail author
  • Namita Tiwari
Conference paper
Part of the Advances in Intelligent Systems and Computing book series (AISC, volume 755)

Abstract

This paper in a nutshell introduces the conventional RSA algorithm and its application in small devices. It also states that there are numerous attacks possible when RSA is used with small parameter values to reduce the time required for encryption and decryption. The paper also includes a description of each such attack. It is also stated that most of the attacks mentioned in the paper are not enough to question the security and credibility of RSA when used with large values of its parameters such as value of primes, product of primes, value of modulus, encryption exponent, and decryption exponent.

References

  1. 1.
    Aggarwal, D., Maurer, U.: Breaking RSA generically is equivalent to factoring. In: Joux, A. (eds.) Advances in Cryptology—EUROCRYPT 2009 (2009).  https://doi.org/10.1007/978-3-642-01001-9_2
  2. 2.
    Bellare, M., Rogaway, P.: Optimal asymmetric encryption padding how to encrypt with RSA. In: Advances in Cryptology—EUROCRYPT’94 (1994)Google Scholar
  3. 3.
    Boneh, D., DeMillo, R.A., Lipton, R.J.: On the importance of checking cryptographic protocols for faults. In: Fumy, W. (eds.) Advances in Cryptology—EUROCRYPT’97 (1997).  https://doi.org/10.1007/3-540-69053-0_4
  4. 4.
    Chaun-ling, J.: Application of RSA asymmetrical encryption algorithm in digital signature. Commun. Tech. 42, 192–196 (2008)Google Scholar
  5. 5.
    Forouzan, B.A., Mukhopadhyay, D.: Cryptography and Network Security (SIE), 2nd edn. McGraw Hill Education, New Delhi, India (2010)Google Scholar
  6. 6.
    Kai-cheng, L.: Computer Cryptography—The Confidentiality and Security of Data in the Computer Network, 3rd edn. Tsinghua University Press, Beijing, China (2003)Google Scholar
  7. 7.
    Lamprecht, C., van Moorsel, A., Tomlinson, P., Thomas, N.: Investigating the efficiency of cryptographic algorithms in online transactions. Int. J. Simul. Syst. Sci. Technol. 7, 63–75 (2006)Google Scholar
  8. 8.
    Manger, J.: A chosen ciphertext attack on RSA optimal asymmetric encryption padding (OAEP) as standardized in PKCS #1 v2.0. In: Kilian, J. (eds.) Advances in Cryptology—CRYPTO 2001 (2001).  https://doi.org/10.1007/3-540-44647-8_14
  9. 9.
    Nguyen, T.D., Nguyen, T.D., Tran, L.D.: Attacks on low private exponent RSA: an experimental study. In: 13th International Conference on Computational Science and Its Applications (2013).  https://doi.org/10.1109/ICCSA.2013.32
  10. 10.
    Rivest, R.L., Shamir, A., Adleman, L.: A method for obtaining digital signatures and public-key cryptosystem. Commun. ACM 21, 120–126 (1978)MathSciNetCrossRefGoogle Scholar
  11. 11.
    Sun, H.M., Wu, M.E., Steinfeld, R., Guo, J., Wang, H.: Cryptanalysis of short exponent RSA with primes sharing least significant bits. In: Franklin M.K., Hui L.C.K., Wong D.S. (eds.) Cryptology and Network Security, CANS 2008 (2008).  https://doi.org/10.1007/978-3-540-89641-8_4
  12. 12.
    Xiaolin, Y., Nanzhong, C., Zhigang, J., Xiaobo, C.: Trusted communication system based on RSA authentication. In: 2nd International Workshop on Education Technology and Computer Science (2010).  https://doi.org/10.1109/ETCS.2010.460

Copyright information

© Springer Nature Singapore Pte Ltd. 2019

Authors and Affiliations

  1. 1.Department of Computer Science and EngineeringMaulana Azad National Institute of TechnologyBhopalIndia

Personalised recommendations