A Hybrid Attack on Small Private Exponent RSA via Continued Fractions and Lattices

In this study, we propose a hybrid cryptanalytic technique targeting the RSA cryptosystem when instantiated with small private exponents. By integrating the continued fraction approach with Coppersmith’s lattice-based technique, we formulate a novel vulnerability framework. Utilizing an innovative relationship extracted from continued fraction convergents, we deduce an improved upper bound for the secret key: d<N1−α/3−γ/2. In this context, α:=logNe and γ:=logN|p+q−S|, where S serves as a known approximation of the prime sum p+q. As an extension of our preliminary conference proceedings, this paper supplies comprehensive proofs for all theoretical propositions, performs a comprehensive parameter sensitivity evaluation, and provides bounds for partial prime exposure scenarios. Empirical evaluations confirm the theoretical mechanics of our framework, demonstrating that it offers improved bounds in specific partial leakage scenarios compared to traditional lattice-only baselines.

Authors

Institutions

Publication Details

Journal
Cryptography
Published
2026-06-18
DOI
https://doi.org/10.3390/cryptography10030040
Primary Topic
Cryptography and Data Security
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

A Hybrid Attack on Small Private Exponent RSA via Continued Fractions and Lattices

Mengce Zheng, Abderrahmane Nitaj, Yansong Feng, Yanbin Pan
Cryptography
Cryptography and Data Security
article

A Hybrid Attack on Small Private Exponent RSA via Continued Fractions and Lattices

Mengce Zheng, Abderrahmane Nitaj, Yansong Feng, Yanbin Pan
article en

Abstract

In this study, we propose a hybrid cryptanalytic technique targeting the RSA cryptosystem when instantiated with small private exponents. By integrating the continued fraction approach with Coppersmith’s lattice-based technique, we formulate a novel vulnerability framework. Utilizing an innovative relationship extracted from continued fraction convergents, we deduce an improved upper bound for the secret key: d<N1−α/3−γ/2. In this context, α:=logNe and γ:=logN|p+q−S|, where S serves as a known approximation of the prime sum p+q. As an extension of our preliminary conference proceedings, this paper supplies comprehensive proofs for all theoretical propositions, performs a comprehensive parameter sensitivity evaluation, and provides bounds for partial prime exposure scenarios. Empirical evaluations confirm the theoretical mechanics of our framework, demonstrating that it offers improved bounds in specific partial leakage scenarios compared to traditional lattice-only baselines.

CryptographyVol. 10(3)
Centre National de la Recherche Scientifique (FR), Zhejiang Wanli University (CN), Chinese Academy of Sciences (CN), Academy of Mathematics and Systems Science (CN), University of Chinese Academy of Sciences (CN), Université de Caen Normandie (FR)
Openalex Percentile: Top 4%
Cryptography and Data Security
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.