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...

Full description

Saved in:
Bibliographic Details
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!
_version_ 1832593191346372608
author Aleksėjus Michalkovič
Jokūbas Žitkevičius
author_facet Aleksėjus Michalkovič
Jokūbas Žitkevičius
author_sort Aleksėjus Michalkovič
collection DOAJ
description 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 search range parameter and define a shifting parameter based on the empirical results. Since these changes make our attack probabilistic, we investigate the dependence of the success on the values of the newly defined parameters.
format Article
id doaj-art-588a2d536e3147f9918a69a77fb2e771
institution Kabale University
issn 0132-2818
2335-898X
language English
publishDate 2023-11-01
publisher Vilnius University Press
record_format Article
series Lietuvos Matematikos Rinkinys
spelling doaj-art-588a2d536e3147f9918a69a77fb2e7712025-01-20T18:15:00ZengVilnius University PressLietuvos Matematikos Rinkinys0132-28182335-898X2023-11-0164A10.15388/LMR.2023.33590Investigation of an attack on the multi-prime RSA cryptosystem based on cubic equationsAleksėjus Michalkovič0Jokūbas Žitkevičius1Kaunas University of TechnologyKaunas University of Technology 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 search range parameter and define a shifting parameter based on the empirical results. Since these changes make our attack probabilistic, we investigate the dependence of the success on the values of the newly defined parameters. https://www.journals.vu.lt/LMR/article/view/33590asymmetric cryptographymulti-prime RSAinteger factorization problem
spellingShingle Aleksėjus Michalkovič
Jokūbas Žitkevičius
Investigation of an attack on the multi-prime RSA cryptosystem based on cubic equations
Lietuvos Matematikos Rinkinys
asymmetric cryptography
multi-prime RSA
integer factorization problem
title Investigation of an attack on the multi-prime RSA cryptosystem based on cubic equations
title_full Investigation of an attack on the multi-prime RSA cryptosystem based on cubic equations
title_fullStr Investigation of an attack on the multi-prime RSA cryptosystem based on cubic equations
title_full_unstemmed Investigation of an attack on the multi-prime RSA cryptosystem based on cubic equations
title_short Investigation of an attack on the multi-prime RSA cryptosystem based on cubic equations
title_sort investigation of an attack on the multi prime rsa cryptosystem based on cubic equations
topic asymmetric cryptography
multi-prime RSA
integer factorization problem
url https://www.journals.vu.lt/LMR/article/view/33590
work_keys_str_mv AT aleksejusmichalkovic investigationofanattackonthemultiprimersacryptosystembasedoncubicequations
AT jokubaszitkevicius investigationofanattackonthemultiprimersacryptosystembasedoncubicequations