Speeding up the arithmetic on Koblitz curves of genus two

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2012, Issue , 2001, Pages 106-117

  Günther, Christian ^a   Lange, Tanja ^b   Stein, Andreas ^c  

^a SIEMENS AG   (Germany)

^b TECHNICAL UNIVERSITY OF BRAUNSCHWEIG   (Germany)

^c UNIVERSITY OF WATERLOO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

GEOMETRY;

ELLIPTIC CURVE; HYPER-ELLIPTIC CURVES; JACOBIANS; KOBLITZ CURVES; SPEED UP;

CRYPTOGRAPHY;

EID: 84949195686     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44983-3_8     Document Type: Conference Paper

References (28)

1. Cantor, D. G.: Computing in the Jacobian of a Hyperelliptic Curve. Math. Comp. 48 (1987) 95-101
2. Diffie, W., Hellman, M. E.: New Directions in Cryptography. IEEE Trans. Inform. Theory 22 (1976) 644-654
3. ElGamal, T.: A Public-Key Cryptosystem and a Signature Scheme Based on Discrete Logarithms. IEEE Trans. Inform. Theory 31 (1985) 469-472
4. F rey, G., Rück, H.-G.: A Remark Concerning m-Divisibility and the Discrete Logarithm Problem in the Divisor Class Group of Curves. Math. Comp. 62 (1994) 865-874
5. Gallant, R., Lambert, R., Vanstone, S.: Improving the Parallelized Pollard Lambda Search on Binary Anomalous Curves. T o Appear in Math. Comp. http://www.certicom.com/chal/download/paper.ps
6. Gaudry, P., Hess, F., Smart, N.: Constructive and Destructive Facets of Weil Descent on Elliptic Curves, preprint, 1999.
7. Gaudry, P., Morain, F., Duursma, I.: Speeding Up the Discrete Log Computation on Curves with Automorphisms In: Proc. of The Mathematics of Public Key Cryptography. Fields-Institute Toronto (1999)
8. Gordon, D.: A Survey of Fast Exponentiation Methods. J. Algorithms 27 (1998) 129-146
9. Koblitz, N.: Elliptic Curve Cryptosystems. Math. Comp. 48 (1987) 203-209
10. Koblitz, N.: Hyperelliptic Cryptosystems. J. Cryptology 1 (1989) 139-150
11. Koblitz, N.: CM Curves with Good Cryptographic Properties. In: Advances in Cryptology–Crypto’91. LNCS, Vol. 576. Springer-V erlag, Berlin Heidelberg New York (1992) 279-287
12. Koblitz, N.: An Elliptic Curve Implementation of the Finite Field Digital Signature Algorithm. In: Advances in Cryptology –Crypto’98. Lecture Notes in Computer Science, Vol. 1462. Springer-V erlag, Berlin Heidelberg New York (1998) 327-337
13. Lange, T.: Efficient Arithmetic on Hyperelliptic Koblitz Curves. preprint, 2000.
14. Lehmer, D.H.: Factorization of Certain Cyclotomic Functions. Ann. Math. 34(1933) 461-479
15. Meier, W., Staffelbach, O.: Efficient Multiplication on Certain Nonsupersingular Elliptic Curves. In: Advances in Cryptology – Crypto ’92.LNCS, Vol. 740. Springer-Verlag, Berlin Heidelberg New York (1993) 333–344
16. Menezes, A., Wu, Y., Zuccherato, R.: An Elementary Introduction to Hyperelliptic Curves. In: Koblitz, N.: Algebraic Aspects of Cryptography. Springer-Verlag, Berlin Heidelberg New York (1998)
17. Miller, V.: Use of Elliptic Curves in Cryptography. In: Advances in Cryptology – Crypto ’85.LNCS, Vol.218.Springer-Verlag, Berlin Heidelberg New York (1986) 417–426
18. Müller, V., Stein, A., Thiel, C.: Computing Discrete Logarithms in Real Quadratic Congruence Function Fields of Large Genus. Math.Comp. 68 (1999) 807–822
19. Mumford, D.: Tata Lectures on Theta I, II. Birkhäuser-Verlag, Boston (1983/84)
20. van Oorschot, P., Wiener, M. J.: Parallel Collision Search with Cryptanalytic Applications. J. Cryptology 12 (1999) 1–28
21. Pierce, T.A.: The Numerical Factors of the Arithmetic Forms Пni=1 (1±αmi). Ann. Math. 18(1916), 53-64.
22. Pollard, J.M.: Kangaroos, Monopoly and Discrete Logarithms. To appear in J. Cryptology.
23. Solinas, J.: An Improved Algorithm for Arithmetic on a Family of Elliptic Curves. In: Advances in Cryptology – Crypto ’97.LNCS, Vol.1294.Springer-Verlag, Berlin Heidelberg New York (1997) 357–371
24. Solinas, J.: Efficient Arithmetic on Koblitz Curves. Techn. Rep ort CORR 99-09, University of Waterloo (1999), 61 pages. http://www.cacr.math.uwaterloo.ca
25. Stein, A.: Sharp Upper Bounds for Arithmetics in Hyperelliptic Function Fields. Techn. Rep ort CORR 99-23, University of Waterloo (1999), 68 pages. Available at http://www.cacr.math.uwaterloo.ca
26. Stichtenoth, H.: Algebraic Function Fields and Codes. Springer-Verlag, Berlin Heidelberg New York (1993)
27. Teske, E.: Speeding up Pollard’s rho method for computing discrete logarithms. In: Algorithmic Number Theory Seminar ANTS-III.LNCS, Vol.1423.Springer-Verlag, Berlin Heidelberg New York (1998) 541–554
28. Wiener, M., Zuccerato, R.: Faster Attacks on Elliptic Curve Cryptosystems. In: Proceedings of SAC, Workshop on Selected Areas in Cryptography. LNCS, Springer-Verlag, Berlin Heidelberg New York (1998).