Safest-Value of the Number of Primes in RSA Modulus and an Improvised Generalized Multi-Moduli RSA
Several attacks on the well-known RSA cryptosystem that can be extended to a multi-prime version of RSA reveal that it is preferable to use the modulus having more prime factors. On the contrary, the larger the number of prime factors of the modulus, the greater the risk of its factorization, due to...
Saved in:
| Main Authors: | Jay Mehta, Hitarth Rana |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
MDPI AG
2025-05-01
|
| Series: | Mathematics |
| Subjects: | |
| Online Access: | https://www.mdpi.com/2227-7390/13/10/1690 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
A Modified Key Generation Algorithm to Rebalanced-RSA and RPower-RSA
by: İsrafil Okumuş, et al.
Published: (2024-12-01) -
Investigation of an attack on the multi-prime RSA cryptosystem based on cubic equations
by: Aleksėjus Michalkovič, et al.
Published: (2023-11-01) -
A New Approach Combining RSA and ElGamal Algorithms: Advancements in Encryption and Digital Signatures Using Gaussian Integers
by: Yahia Awad, et al.
Published: (2025-03-01) -
Improved Cryptanalysis of Some RSA Variants
by: Mohammed Rahmani, et al.
Published: (2025-04-01) -
Partial Exposure Attacks on a New RSA Variant
by: Mohammed Rahmani, et al.
Published: (2024-10-01)