A chosen message attack on Demytko’s elliptic curve cryptosystem

被引：0

作者：

Burton S. Kaliski

机构：

[1] RSA Laboratories,

来源：

Journal of Cryptology | 1997年 / 10卷

关键词：

Elliptic curves; Chosen message attack; Demytko’s cryptosystem; Signature forgery;

D O I：

暂无

中图分类号：

学科分类号：

摘要：

One of the purported advantages of the elliptic curve cryptosystem proposed by Demytko in 1993 is resistance to signature forgery under a chosen message attack. Based on a similar result by Bleichenbacheret al. on the LUC cryptosystem, this purported advantage is shown not to hold.

引用

页码：71 / 72

页数：1

共 5 条

[1]

Koblitz N.(1987)Elliptic curve cryptosystems Mathematics of Computation 48 203-209

[2]

Montgomery P. L.(1987)Speeding the Pollard and elliptic curve methods of factorization Mathematics of Computation 48 243-264

[3]

Rivest R. L.(1978)A method for obtaining digital signatures and public-key cryptosystems Communications of the ACM 21 120-126

[4]

Shamir A.(undefined)undefined undefined undefined undefined-undefined

[5]

Adleman L.(undefined)undefined undefined undefined undefined-undefined

← 1 →