A low-memory algorithm for point counting on Picard curves

被引:2
|
作者
Weng, A [1 ]
机构
[1] Ecole Polytech, Lab Informat, LIX, F-91128 Palaiseau, France
关键词
curve cryptography; Picard curves; point counting;
D O I
10.1007/s10623-005-1598-y
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
Combining the ideas of Bauer, Teske and Weng, [ 1] and Gaudry, Schost [ 3], we give a low memory algorithm for computing the number of points on the Jacobian of a Picard curve. It is efficient enough to handle Picard curves over finite prime fields F-p, where p is a prime with 58 bits. We present an example where the Jacobian has a prime group order of size 2(174).
引用
收藏
页码:383 / 393
页数:11
相关论文
共 50 条
  • [21] Point counting in families of hyperelliptic curves
    Hubrechts, Hendrik
    FOUNDATIONS OF COMPUTATIONAL MATHEMATICS, 2008, 8 (01) : 137 - 169
  • [22] Using media processors for low-memory AES implementation
    Irwin, J
    Page, D
    IEEE INTERNATIONAL CONFERENCE ON APPLICATION-SPECIFIC SYSTEMS, ARCHITECTURES, AND PROCESSORS, PROCEEDINGS, 2003, : 144 - 154
  • [23] Low-complexity and low-memory entropy coder for image compression
    Zhao, DB
    Chan, YK
    Gao, W
    IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS FOR VIDEO TECHNOLOGY, 2001, 11 (10) : 1140 - 1145
  • [24] Generating secure genus two hyperelliptic curves using Elkies' point counting algorithm
    Kanayama, N
    Nagao, K
    Uchiyama, S
    IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 2003, E86A (04) : 919 - 927
  • [25] A low-memory alternative for time-dependent Dijkstra
    Van den Eynde, Simon
    Audenaert, Jeroen Verbrugghe Pieter
    Ben Derudder
    Colle, Didier
    Pickavet, Mario
    2020 IEEE 23RD INTERNATIONAL CONFERENCE ON INTELLIGENT TRANSPORTATION SYSTEMS (ITSC), 2020,
  • [26] Principled Dictionary Pruning for Low-Memory Corpus Compression
    Tong, Jiancong
    Wirth, Anthony
    Zobel, Justin
    SIGIR'14: PROCEEDINGS OF THE 37TH INTERNATIONAL ACM SIGIR CONFERENCE ON RESEARCH AND DEVELOPMENT IN INFORMATION RETRIEVAL, 2014, : 283 - 292
  • [27] RANDOMIZED SKETCHING ALGORITHMS FOR LOW-MEMORY DYNAMIC OPTIMIZATION
    Muthukumar, Ramchandran
    Kouri, Drew P.
    Udell, Madeleine
    SIAM JOURNAL ON OPTIMIZATION, 2021, 31 (02) : 1242 - 1275
  • [28] LLEC: An image coder with low-complexity and low-memory requirement
    Zhao, DB
    Gao, W
    Shan, SG
    Chan, YK
    ADVANCES IN MUTLIMEDIA INFORMATION PROCESSING - PCM 2001, PROCEEDINGS, 2001, 2195 : 957 - 962
  • [29] Point counting on reductions of CM elliptic curves
    Rubin, K.
    Silverberg, A.
    JOURNAL OF NUMBER THEORY, 2009, 129 (12) : 2903 - 2923
  • [30] Curves, dynamical systems, and weighted point counting
    Cornelissen, Gunther
    PROCEEDINGS OF THE NATIONAL ACADEMY OF SCIENCES OF THE UNITED STATES OF AMERICA, 2013, 110 (24) : 9669 - 9673