Results 1 -
3 of
3
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 9 (1 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 Diffie-Hellman 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 Diffie-Hellman 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...
