Cryptanalysis Attacks on Multi Prime Power Modulus Through Analyzing Prime Difference (original) (raw)

Abstract

The Security of Rivest, Shamir and Adleman Cryptosystem known as RSA and its variants rely on the difficulty of integer factorization problem. This paper presents a short decryption exponent attack on RSA variant based on the key equation where prime difference was carefully analyzed and came up with an approximation of as which enabled us to obtain an improved bound that led to the polynomial time factorization of the variant .

Key takeaways

sparkles

AI

  1. This paper presents a short decryption exponent attack on an RSA variant, enhancing security analysis.
  2. The authors analyze prime differences to derive improved bounds for polynomial time factorization.
  3. Findings indicate that the short decryption exponent bound exceeds 1/4, surpassing previous limits.
  4. The study contributes to understanding vulnerabilities in multi prime power modulus cryptosystems.
  5. RSA's security fundamentally relies on the integer factorization problem, essential for cryptographic applications.

Loading...

Loading Preview

Sorry, preview is currently unavailable. You can download the paper by clicking the button above.

References (11)

  1. Asbullah, M. A., and Ariffin, M. R. K. (2015). New Attack on RSA with Modulus N = p2q Using Continued Fraction. Journal of Physics, Conference Series, Pp 2 -8. https://iopscience.iop.org/article/10.1088/17 42-6596/622/1/012019
  2. Chen, C. Y., Hsueh, C. C;, and Lin, Y. F. (2009). A Generalization of de Weger's Method. IEEA, 1, 344 -47.
  3. Lenstra, A. K., Lenstra, H. W., and Lovasz, L. (1982). Factoring Polynomials with Rational Coefficients. Mathemasche, Annelen, 261, 515 -534. http://doi.org/10.1007/BF01457454
  4. Lu, Y., Peng, L., and Sarkar, S. (2017). Cryptanalysis of RSA Variant with Moduli. De Gruvter, 11(2), 117 -130.
  5. Nitaj, A. (2013). Diophantine and Lattice Cryptanalysis of the RSA Cryptosystem. In Artificial Intelligence, Evolutionary Computing and Metheuristics; Springer, 139-168. https://link.springer.com/chapter/10.1007/97
  6. Olzak, T. (2012). Chapter 7: The role of Cryptography in information security https://resources.infosecinstitute.com
  7. Shehu, S., and Ariffin, M. R. (2017). New Attack on Prime Power r N p q = Using Good Approximation of ( ).
  8.  Malaysian Journal of mathematical Sciences II(s), 121 -138. https://mjms.upm.edu.my/fullpaper/2017- August-11(S)/Shehu,%20S.-121-138.
  9. Shehu, S., Abubakar, S. I., and Ibrahim, Z. (2020). Polynomial time Attacks for Modulus 22 N p q = . Journal of Applied Mathematics and Computation, 4(4), 230 -240. https://wap.hillpublisher.com/ArticleDetails. aspx?cid=439.
  10. Takagi, T. (1998). Fast RSA -Type Cryptosystem Modulo k N p q = . In Advance in Cryptography-CRYPTO '98, Lecture note in Computer Science, Pp 317 -326 Springer. https://link.springer.com/chapter/10.1007/bf b0055738
  11. Wiener, M. (1990). Cryptanalysis of Short RSA Secret Exponents. IEEE Trans. Inform. Theory, 36, 553 -558. https://link.springer.com/chapter/10.1007/3- 540-46885-4_36