Quasi-quadratic elliptic curve point counting using rigid cohomology

被引：1

作者：

Hubrechts, Hendrik ^{[1
]}

机构：

[1] Katholieke Univ Leuven, Dept Math, B-3001 Heverlee, Belgium

来源：

JOURNAL OF SYMBOLIC COMPUTATION | 2009年 / 44卷 / 09期

关键词：

Elliptic curve; Point counting; Rigid cohomology; Cryptography; HYPERELLIPTIC CURVES; ZETA-FUNCTIONS; CRYPTOGRAPHY; COMPUTATION; ALGORITHM;

D O I：

10.1016/j.jsc.2008.02.015

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

Let E be a nonsupersingular elliptic curve over the finite field with p(n) elements. We present a deterministic algorithm that computes the zeta function and hence the number of points of such a curve E in time quasi-quadratic in n. An older algorithm having the same time complexity uses the canonical lift of E, whereas our algorithm uses rigid cohomology combined with a deformation approach. An implementation in small odd characteristic turns Out to give very good results. (C) 2009 Elsevier Ltd. All rights reserved.

引用

页码：1255 / 1267

页数：13

共 28 条

[1] A p-Adic Quasi-Quadratic Time Point Counting Algorithm
Carls, Robert
Lubicz, David
INTERNATIONAL MATHEMATICS RESEARCH NOTICES, 2009, 2009 (04) : 698 - 735
[2] A quasi quadratic time algorithm for hyperelliptic curve point counting
Reynald Lercier
David Lubicz
The Ramanujan Journal, 2006, 12 : 399 - 423
[3] A quasi quadratic time algorithm for hyperelliptic curve point counting
Lercier, Reynald
Lubicz, David
RAMANUJAN JOURNAL, 2006, 12 (03): : 399 - 423
[4] Fast elliptic curve point counting using Gaussian normal basis
Kim, HY
Park, JY
Cheon, JH
Park, JH
Kim, JH
Hahn, SG
ALGORITHMIC NUMBER THEORY, 2002, 2369 : 292 - 307
[5] Point of infinite order on an elliptic curve over a quadratic field
1600, World Scientific and Engineering Academy and Society, Ag. Ioannou Theologou 17-23, Zographou, Athens, 15773, Greece (13):
[6] A POINT COUNTING ALGORITHM USING COHOMOLOGY WITH COMPACT SUPPORT
Chatel, Gweltaz
Lubicz, David
LMS JOURNAL OF COMPUTATION AND MATHEMATICS, 2009, 12 : 295 - 325
[7] Elliptic curve point counting over finite fields with Gaussian normal basis
Park, JH
Park, JY
Hahn, SG
PROCEEDINGS OF THE JAPAN ACADEMY SERIES A-MATHEMATICAL SCIENCES, 2003, 79 (01) : 5 - 8
[8] The AGM-X0(N) Heegner point lifting algorithm and elliptic curve point counting
Kohel, DR
ADVANCES IN CRYPTOLOGY - ASIACRYPT 2003, 2003, 2894 : 124 - 136
[9] Counting points on elliptic curves over finite fields of small characteristic in quasi quadratic time
Lercier, R
Lubicz, D
ADVANCES IN CRYPTOLOGY-EUROCRYPT 2003, 2003, 2656 : 360 - 373
[10] Elliptic curve point multiplication algorithm using precomputation
Mimi, H. (hani_mimi@yahoo.com), 1600, World Scientific and Engineering Academy and Society, Ag. Ioannou Theologou 17-23, Zographou, Athens, 15773, Greece (12):

← 1 2 3 →