Advertisement
Published in:
01-07-2013 | Computational mathematics
A new attack on RSA with two or three decryption exponents
Published in: Journal of Applied Mathematics and Computing | Issue 1-2/2013
Log inActivate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
Abstract
Let N=pq be an RSA modulus, i.e. the product of two large unknown primes of equal bit-size. In this paper, we describe an attack on RSA in the presence of two or three exponents e
i
with the same modulus N and satisfying equations e
i
x
i
−ϕ(N)y
i
=z
i
, where ϕ(N)=(p−1)(q−1) and x
i
, y
i
, z
i
are unknown parameters. The new attack is an extension of Guo’s continued fraction attack as well as the Blömer and May lattice-reduction basis attack.