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

共 23 条

[21] Counting the order of the group of points of an elliptic curve over a finite field based on Shanks’s algorithm [J].

Maria Zelenova .

P-Adic Numbers, Ultrametric Analysis, and Applications, 2011, 3 (2) :157-164

[22] Counting the Order of the Group of Points of an Elliptic Curve Over a Finite Field Based on Shanks's Algorithm [J].

Zelenova, Maria .

P-ADIC NUMBERS ULTRAMETRIC ANALYSIS AND APPLICATIONS, 2011, 3 (02) :157-164

[23] Efficient Image Encryption Scheme Using Henon Map, Dynamic S-Boxes and Elliptic Curve Cryptography [J].

Ibrahim, Saleh ;

Alharbi, Ayman .

IEEE ACCESS, 2020, 8 :194289-194302

← 1 2 3 →