Published in

International Journal on Cryptography and Information Security, 4(3), p. 11-21

DOI: 10.5121/ijcis.2013.3402

Links

Tools

Export citation

Search in Google Scholar

A new attack on RSA with a composed decryption exponent

Journal article published in 2014 by Abderrahmane Nitaj, Mohamed Douh Mohamed, Mohamed Ould Douh
This paper is made freely available by the publisher.
This paper is made freely available by the publisher.

Full text: Download

Question mark in circle
Preprint: policy unknown
Question mark in circle
Postprint: policy unknown
Question mark in circle
Published version: policy unknown
Data provided by SHERPA/RoMEO

Abstract

In this paper, we consider an RSA modulus N = pq, where the prime factors p, q areof the same size. We present an attack on RSA when the decryption exponent d is in theform d = M d1 + d0 where M is a given positive integer and d1 and d0 are two suitablysmall unknown integers. In 1999, Boneh and Durfee presented an attack on RSA whend