Results 1 
4 of
4
On the design of RSA with short secret exponent
 Proc. of Asiacrypt ’99, LNCS
, 1999
"... Based on continued fractions Wiener showed that a typical RSA system can be to ..."
Abstract

Cited by 12 (2 self)
 Add to MetaCart
Based on continued fractions Wiener showed that a typical RSA system can be to
Discrete logarithms: The past and the future
 Designs, Codes, and Cryptography
, 2000
"... The first practical public key cryptosystem to be published, the DiffieHellman key exchange algorithm, was based on the assumption that discrete logarithms are hard to compute. This intractability hypothesis is also the foundation for the presumed security of a variety of other public key schemes. ..."
Abstract
 Add to MetaCart
The first practical public key cryptosystem to be published, the DiffieHellman key exchange algorithm, was based on the assumption that discrete logarithms are hard to compute. This intractability hypothesis is also the foundation for the presumed security of a variety of other public key schemes. While there have been substantial advances in discrete log algorithms in the last two decades, in general the discrete log still appears to be hard, especially for some groups, such as those from elliptic curves. Unfortunately no proofs of hardness are available in this area, so it is necessary to rely on experience and intuition in judging what parameters to use for cryptosystems. This paper presents a brief survey of the current state of the art in discrete logs. 1. Introduction Many of the popular public key cryptosystems are based on discrete exponentiation. If G is a group, such as the multiplicative group of a finite field or the group of points on an elliptic curve, and g is an elem...
An effective Method for Attack RSA Strategy
"... The protection on many public key encoding schemes depended on the intractability of detecting the integer factoring problem such as RSA scheme. However, there are great deals of researches regarding the RSA factoring modulus compared with the other type of attack the RSA scheme. So the need for mor ..."
Abstract
 Add to MetaCart
The protection on many public key encoding schemes depended on the intractability of detecting the integer factoring problem such as RSA scheme. However, there are great deals of researches regarding the RSA factoring modulus compared with the other type of attack the RSA scheme. So the need for more methods of attacks other than RSA factoring modulus to find an effective and quicker algorithm to solve this problem is still crucial. This paper introduces a new algorithmic program which approaches the RSA scheme. The suggested algorithm aims to find the private key of the RSA scheme and then factoring the modulus based on the public key of the RSA scheme. The new idea exacted to be more efficient than the already existed algorithms particularly when the public key is small, since most of public key encryption schemes select a small public encryption key e in order to improve the efficiency of encryption. Also, the suggested algorithmic program is more effective since it is faster and takes less running time.