A low-memory algorithm for point counting on picard curves

Designs, Codes, and Cryptography

Volumn 38, Issue 3, 2006, Pages 383-393

  Weng, Annegret ^a  

^a ÉCOLE POLYTECHNIQUE   (France)

Author keywords

Curve cryptography; Picard curves; Point counting

Indexed keywords

CRYPTOGRAPHY; STORAGE ALLOCATION (COMPUTER);

CURVE CRYPTOGRAPHY; PICARD CURVES; POINT COUNTING;

ALGORITHMS;

EID: 31344446940     PISSN: 09251022     EISSN: None     Source Type: Journal    
DOI: 10.1007/s10623-005-1598-y     Document Type: Article

References (8)

1. M. Bauer, E. Teske and A. Weng, Point counting on Picard curves, Math. Comp., posted on March 31, 2005 PII S 0025-5718(05)01758-8, to appear in print.
2. H. Cohen, A Course in Computational Algebraic Number Theory Graduate Texts in Mathematics 138, 3rd edition. Springer (1996)
3. P. Gaudry and É. Schost, A Low-Memory Parallel Version of Matsuo, Chao and Tsujn's Algorithm. ANTS VI, LNCS 3076, Springer (2004) pp 208-222
4. K. Matsuo, J. Chao and S. Tsujii, An improved baby step giant step algorithm for point counting of hyperelliptic curves over finite fields In C. Flecker and D. Kohel (eds.), ANTS V, LNCS, Vol. 2369, Springer (2002) pp 461-474.
5. S. Pohlig and M. Hellman, An improved algorithm for computing logarithms over CF(p) and its cryptographic significance, IEEE Trans. Inform Theory. Vol. 24 (1978) pp 106-110.
6. I. M. Pollard, Monte Carlo methods for indes computation (mod p). Math Comp., Vol. 32 (143) (1978) pp 918-924
7. N. Thénault, Indes calculus attack for hyperelliptic curves of small genus. In G. Laih, (ed), Advances in cryptology, Asiacrypt 2003, LNCS 2894, Springer (2003) pp 75-92
8. P. C. van Oorschot and M. J. Wiener, Parallel collision search with cryptanalytic applications, J. Cryptol. Vol. 12 (1999) pp. 1-28.