A method of solution of the problem of taking the discrete logarithm on an elliptic curve by division of points by two

被引：1

作者：

Bessalov A.V. ^{[1
]}

机构：

[1] Military Institute of Telecommunication and Information, Kiev

来源：

Cybernetics and Systems Analysis | 2001年 / 37卷 / 6期

关键词：

Abelian group of points; Discrete logarithm problem; Elliptic curve; Taking logarithms by division by t\vo;

D O I：

10.1023/A:1014525713965

中图分类号：

学科分类号：

摘要：

A new approach is proposed to the solution of the problem of taking the discrete logarithm of an Abelian group of points of an elliptic curve. The approach is based on a procedure that divides some subgroup of points of the curve by t\vo. ©2001 Plenum Publishing Corporation.

引用

页码：820 / 823

页数：3

共 6 条

[1]

Current Public-Key Cryptographic Systems, A Certicom Whitepaper, pp. 1-16, (1997)

[2]

Pollard J.M., Monte Carlo methods for index computation (mod p),, Math. Comput, 32, pp. 918-924, (1978)

[3]

Mullin R.C., Onyszchuk I.M., Vanstone S.A., Optimal Normal Bases in GF(p"), Discr. Appl. Math., 22, pp. 149-161, (1988)

[4]

Bessalov A.V., Telizhenko A.B., Gudzenko S.V., Operations in a finite field GF(2") for complex systems of cryptographic codes,, Izv. Vyssh. Uchebn. Zaved., Radioelektr., 7, pp. 32-37, (2000)

[5]

Shanks D., Class number, a theory of factorizations, and genera,, In: Proc. Symposia in Pure Mathematics, pp. 415-440, (1971)

[6]

Knuth D.E., The Art of Computer Programming, Vol. 2: Seminumerical Algorithms, 2, (1981)

← 1 →