CONSTRUCTING PUBLIC- KEY CRYPTOGRAPHIC SCHEMES BASED ON CLASS GROUP ACTION ON A SET OF ISOGENOUS ELLIPTIC CURVES

被引：73

作者：

Stolbunov, Anton ^{[1
]}

机构：

[1] Norwegian Univ Sci & Technol, Dept Telemat, N-7491 Trondheim, Norway

来源：

ADVANCES IN MATHEMATICS OF COMMUNICATIONS | 2010年 / 4卷 / 02期

关键词：

Public-key cryptography; group action; elliptic curve; isogeny; ideal class group; finite field; DISCRETE LOGARITHMS; COMPUTATION; ALGORITHMS;

D O I：

10.3934/amc.2010.4.215

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

We propose a public-key encryption scheme and key agreement protocols based on a group action on a set. We construct an implementation of these schemes for the action of the class group CL(OK) of an imaginary quadratic field K on the set ELLp,n (OK) of isomorphism classes of elliptic curves over F-p with n points and the endomorphism ring O-K. This introduces a novel way of using elliptic curves for constructing asymmetric cryptography.

引用

页码：215 / 235

页数：21

共 46 条

[1] [Anonymous], 1989, J. Amer. Math. Soc.
[2] [Anonymous], 1989, A Wiley-Interscience Publication
[3] [Anonymous], 1999, LMS Journal of Computation and Mathematics
[4] ON LOVASZ LATTICE REDUCTION AND THE NEAREST LATTICE POINT PROBLEM
BABAI, L
[J]. COMBINATORICA, 1986, 6 (01) : 1 - 13
[5] Belabas K, 2008, MATH COMPUT, V77, P1185, DOI 10.1090/S0025-5718-07-02003-0
[6] Bellare M, 1998, LECT NOTES COMPUT SC, V1462, P26, DOI 10.1007/BFb0055718
[7] IMPROVEMENTS IN THE COMPUTATION OF IDEAL CLASS GROUPS OF IMAGINARY QUADRATIC NUMBER FIELDS
Biasse, Jean-Francois
[J]. ADVANCES IN MATHEMATICS OF COMMUNICATIONS, 2010, 4 (02) : 141 - 154
[8] Bini D., 1994, Fundamental algorithms, Progress in Theoretical Computer Science, V1
[9] BROKER R, ARXIV10010402
[10] CACHIN C, 1997, IEEE INT S INF THEOR, P91

← 1 2 3 4 5 →