Further Cryptanalysis of a Type of RSA Variants

被引:6
作者
Shi, Gongyu [1 ]
Wang, Geng [1 ]
Gu, Dawu [1 ]
机构
[1] Shanghai Jiao Tong Univ, Sch Elect Informat & Elect Engn, Shanghai 200240, Peoples R China
来源
INFORMATION SECURITY, ISC 2022 | 2022年 / 13640卷
关键词
Cryptanalysis; RSA variants; Coppersmith's method; Lattice reduction; KEY EXPOSURE ATTACKS; LOW EXPONENT; POLYNOMIALS; EQUATIONS; ROOTS;
D O I
10.1007/978-3-031-22390-7_9
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
To enhance the security or the efficiency of the standard RSA cryptosystem, some variants have been proposed based on elliptic curves, Gaussian integers or Lucas sequences. A typical type of these variants which we called Type-A variants have the specified modified Euler's totient function psi(N) = (p(2) - 1)(q(2) - 1). But in 2018, based on cubic Pell equation, Murru and Saettone presented a new RSA-like cryptosystem, and it is another type of RSA variants which we called Type-B variants, since their scheme has psi(N) = (p(2) + p+ 1)(q(2) + q+ 1). For RSA-like cryptosystems, four key-related attacks have been widely analyzed, i.e., the small private key attack, the multiple private keys attack, the partial key exposure attack and the small prime difference attack. These attacks are well-studied on both standard RSA and Type-A variants. Recently, the small private key attack on Type-B variants has also been analyzed. In this paper, we make further cryptanalysis of Type-B variants, that is, we propose the first theoretical results of multiple private keys attack, partial key exposure attack as well as small prime difference attack on Type-B variants, and the validity of our attacks are verified by experiments. Our results show that for all three attacks, Type-B variants are less secure than standard RSA.
引用
收藏
页码:133 / 152
页数:20
相关论文
共 32 条
[1]  
Aono Yoshinori, 2013, Information Security and Privacy. 18th Australasian Conference, ACISP 2013. Proceedings: LNCS 7959, P88, DOI 10.1007/978-3-642-39059-3_7
[2]  
Blömer J, 2003, LECT NOTES COMPUT SC, V2729, P27
[3]  
Blömer J, 2001, LECT NOTES COMPUT SC, V2146, P4
[4]  
Boneh D, 1998, LECT NOTES COMPUT SC, V1514, P25
[5]   Cryptanalysis of RSA with private key d less than N0.292 [J].
Boneh, D ;
Durfee, G .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2000, 46 (04) :1339-1349
[6]  
Bunder Martin, 2016, Information Security and Privacy. 21st Australasian Conference, ACISP 2016. Proceedings: LNCS 9723, P258, DOI 10.1007/978-3-319-40367-0_16
[7]   An efficient probabilistic public-key cryptosystern over quadratic fields quotients [J].
Castagnos, Guilhem .
FINITE FIELDS AND THEIR APPLICATIONS, 2007, 13 (03) :563-576
[8]   Cryptanalysis of RSA Variants with Primes Sharing Most Significant Bits [J].
Cherkaoui-Semmouni, Meryem ;
Nitaj, Abderrahmane ;
Susilo, Willy ;
Tonien, Joseph .
INFORMATION SECURITY (ISC 2021), 2021, 13118 :42-53
[9]   Small solutions to polynomial equations, and low exponent RSA vulnerabilities [J].
Coppersmith, D .
JOURNAL OF CRYPTOLOGY, 1997, 10 (04) :233-260
[10]   Cryptanalysis of RSA with small prime difference [J].
de Weger, B .
APPLICABLE ALGEBRA IN ENGINEERING COMMUNICATION AND COMPUTING, 2002, 13 (01) :17-28