Abstract:We give a new algorithm to attack RSA with small private exponent, when some partial information of $p+q$ is this http URL algorithm is a very simple modification of original Wiener's attack with continued fractions, and allows to factor $n$ whenever $d<n^{(1+\delta)/2}$ if we know a $\delta$-fraction of the most significant bits of $n$. The algorithm is unconditional, which is not the case in previous improvements that use Coppersmith method. As an example, ouir algorithm can be applied to break any criptosystem with modulus of $512$ bits and $d<n^{0.3}$, giving an improvement in the original attack of Wiener.
From: Jorge Urroz [view email]
[v1]
Tue, 23 Jun 2026 15:39:30 UTC (38 KB)
此内容由惯性聚合(RSS阅读器)自动聚合整理，仅供阅读参考。 原文来自 — 版权归原作者所有。