In this paper, we consider an RSA modulus N=pq, where the prime factors p, q are of the same size. We ...

In this paper, we consider an RSA modulus N=pq, where the prime factors p, q are of the same size. We

present an attack on RSA when the decryption exponent d is in the form d=Md1+d0 where M is a given

positive integer and d1 and d0 are two suitably small unknown integers. In 1999, Boneh and Durfee

presented an attack on RSA when

0.292 d < N . When d=Md1+d0, our attack enables one to overcome

Boneh and Durfee's bound and to factor the RSA modulus

### Statistics

### Views

- Total Views
- 241
- Views on SlideShare
- 241
- Embed Views

### Actions

- Likes
- 0
- Downloads
- 2
- Comments
- 0

### Accessibility

### Categories

### Upload Details

Uploaded via SlideShare as Adobe PDF

### Usage Rights

© All Rights Reserved

No comments yet1Full NameComment goes here.