Cryptanalysis Attacks on Multi Prime Power Modulus Through Analyzing Prime Difference
DOI:
https://doi.org/10.57233/ijsgs.v9i1.405Keywords:
RSA modulus, short decryption attack., Multi Prime power, Continued fraction, prime differenceAbstract
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 .
Downloads
Published
How to Cite
Issue
Section
License
Copyright (c) 2023 Author(s)

This work is licensed under a Creative Commons Attribution 4.0 International License.








