Results 1 
4 of
4
Timelock puzzles and timedrelease crypto
, 1996
"... 1 Introduction Our motivation is the notion of "timedrelease crypto, " where the goal is to encrypt a message so that it can not be decrypted by anyone, not even the sender, until a predetermined amount of time has passed. The goal is to "send information into the future. " Thi ..."
Abstract

Cited by 102 (1 self)
 Add to MetaCart
1 Introduction Our motivation is the notion of "timedrelease crypto, " where the goal is to encrypt a message so that it can not be decrypted by anyone, not even the sender, until a predetermined amount of time has passed. The goal is to "send information into the future. " This problem was first discussed by Timothy May [6]. What are the applications of "timedrelease crypto"? Here are a few possibilities (some due to May):
New PublicKey Schemes Based on Elliptic Curves over the Ring Z_n
, 1991
"... Three new trapdoor oneway functions are proposed that are based on elliptic curves over the ring Z_n. The first class of functions is a naive construction, which can be used only in a digital signature scheme, and not in a publickey cryptosystem. The second, preferred class of function, does not s ..."
Abstract

Cited by 46 (0 self)
 Add to MetaCart
Three new trapdoor oneway functions are proposed that are based on elliptic curves over the ring Z_n. The first class of functions is a naive construction, which can be used only in a digital signature scheme, and not in a publickey cryptosystem. The second, preferred class of function, does not suffer from this problem and can be used for the same applications as the RSA trapdoor oneway function, including zeroknowledge identification protocols. The third class of functions has similar properties to the Rabin trapdoor oneway functions. Although the security of these proposed schemes is based on the difficulty of factoring n, like the RSA and Rabin schemes, these schemes seem to be more secure than those schemes from the viewpoint of attacks without factoring such as low multiplier attacks.
A Chosen Text Attack on the RSA Cryptosystem and Some Discrete Logarithm Schemes
, 1986
"... some discrete logarithm schemes ..."
Cryptanalysis of Koyama Scheme
, 2006
"... In this paper we analyze the security of Koyama scheme based on the singular cubic curve for some well known attacks. We provide an efficient algorithm for linearly related plaintext attack and identify isomorphic attack on Koyama scheme. Some other attacks are also discussed in this paper. ..."
Abstract
 Add to MetaCart
In this paper we analyze the security of Koyama scheme based on the singular cubic curve for some well known attacks. We provide an efficient algorithm for linearly related plaintext attack and identify isomorphic attack on Koyama scheme. Some other attacks are also discussed in this paper.