4.5 Article

Small Private Exponent Attacks on RSA Using Continued Fractions and Multicore Systems

相关参考文献

注意:仅列出部分参考文献,下载原文获取全部文献信息。
Article Computer Science, Theory & Methods

Improving small private exponent attack on the Murru-Saettone cryptosystem

Dieaa Nassr et al.

Summary: This paper introduces the construction and attack methods of the Murru-Saettone cryptosystem, which is an RSA-like cryptosystem constructed using a non-standard product. Three attack methods against this cryptosystem are proposed using continued fractions.

THEORETICAL COMPUTER SCIENCE (2022)

Article

Speeding Up Fermat’s Factoring Method using Precomputation

Hatem M. Bahig

Annals of Emerging Technologies in Computing (2022)

Article Computer Science, Information Systems

Security Issues of Novel RSA Variant

Abderrahmane Nitaj et al.

Summary: This paper provides a detailed analysis of the security of the Murru-Saettone variant of the RSA cryptosystem. The authors propose attacks on this variant when the prime difference is small and present two approaches: utilizing the continued fraction algorithm and employing Coppersmith's method and lattice basis reduction. The attacks improve recent cryptanalyses on the cubic Pell equation variant of RSA and demonstrate that under a small prime difference scenario, the number of susceptible private exponents for this variant is significantly larger than the standard RSA.

IEEE ACCESS (2022)

Article Computer Science, Hardware & Architecture

A New Side-Channel Attack on Reduction of RSA-CRT Montgomery Method Based

S. Kaedi et al.

Summary: The article introduces an implementation of the RSA-CRT algorithm based on Montgomery multiplication, known as RSA-CRT-MMB, which aims to address challenges in multiplications for long key sizes. A new power analysis side-channel attack on RSA-CRT-MMB, named MRED on MMB, is presented, along with a new countermeasure to prevent the attack without overloading hardware area or running time. The correctness and efficiency of the proposed scheme, 2048-bit RSA-CRT-MMB, are confirmed through practical experiments, demonstrating a total running time of 250ms and minimal hardware resource usage.

JOURNAL OF CIRCUITS SYSTEMS AND COMPUTERS (2021)

Article Computer Science, Theory & Methods

A Unified Method for Private Exponent Attacks on RSA Using Lattices

Hatem M. Bahig et al.

INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE (2020)

Article Multidisciplinary Sciences

A New LSB Attack on Special-Structured RSA Primes

Amir Hamzah Abd Ghafar et al.

SYMMETRY-BASEL (2020)

Article Computer Science, Theory & Methods

A generalized attack on RSA type cryptosystems

Martin Bunder et al.

THEORETICAL COMPUTER SCIENCE (2017)

Article Computer Science, Interdisciplinary Applications

Cryptanalysis of RSA with small prime difference

B de Weger

APPLICABLE ALGEBRA IN ENGINEERING COMMUNICATION AND COMPUTING (2002)

Article Computer Science, Information Systems

Cryptanalysis of RSA with private key d less than N0.292

D Boneh et al.

IEEE TRANSACTIONS ON INFORMATION THEORY (2000)