61 citations · 439 across the 46 of their papers we have counts for
Showing cs.CRShow all
2 papers · 1 filter
cs.CR2008★ 7 cited
A variant of Wiener's attack on RSA
Andrej Dujella
Wiener's attack is a well-known polynomial-time attack on a RSA cryptosystem with small secret decryption exponent d, which works if d<n^{0.25}, where n=pq is the modulus of the cr…
cs.CR2004★ 33 cited
Continued fractions and RSA with small secret exponent
Andrej Dujella
Extending the classical Legendre's result, we describe all solutions of the inequality |x - a/b| < c/b^2 in terms of convergents of continued fraction expansion of x. Namely, we sh…