Investigation of an attack on the multi-prime RSA cryptosystem based on cubic equations
In this paper we consider a modification of the attack on the classic RSA cryptosystem aimed at factoring the public modulus n, which is a product of three primes. To improve the performance of the modified attack we introduce additional parameters. We present the theoretical upper bound on the sea...
Saved in:
| Main Authors: | Aleksėjus Michalkovič, Jokūbas Žitkevičius |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Vilnius University Press
2023-11-01
|
| Series: | Lietuvos Matematikos Rinkinys |
| Subjects: | |
| Online Access: | https://www.journals.vu.lt/LMR/article/view/33590 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Safest-Value of the Number of Primes in RSA Modulus and an Improvised Generalized Multi-Moduli RSA
by: Jay Mehta, et al.
Published: (2025-05-01) -
Comparison between RSA and CAST-128 with Adaptive Key for Video Frames Encryption with Highest Average Entropy
by: Enas Tariq Khudair, et al.
Published: (2022-12-01) -
An Improved Attack on the RSA Variant Based on Cubic Pell Equation
by: Mohammed Rahmani, et al.
Published: (2025-06-01) -
Partial Exposure Attacks Against a Family of RSA-like Cryptosystems
by: George Teşeleanu
Published: (2024-12-01) -
Factorization of big integer and the security of RSA
by: Yan-bing REN
Published: (2017-05-01)