The equivalence between elliptic curve and quadratic function field discrete logarithms in characteristic 2

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

Volumn 1423, Issue , 1998, Pages 621-638

  Zuccherato, Robert J ^a  

^a Entrust Technologies   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

GEOMETRY; NUMBER THEORY; POLYNOMIAL APPROXIMATION;

CHARACTERISTIC 2; DISCRETE LOGARITHM PROBLEMS; DISCRETE LOGARITHMS; ELLIPTIC CURVE; FUNCTION FIELDS; NON-SUPERSINGULAR; POLYNOMIAL-TIME; QUADRATIC FUNCTION;

FUNCTIONS;

EID: 84947723337     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0054897     Document Type: Conference Paper

References (19)

1. W.A. Adams and M.J. Razar, Multiples of points on elliptic curves and continued fractions, Proc. London Math. Soc. 41 (1980), pp. 481-498.
2. W. Diffie and M.E. Heilman, New directions in cryptography, IEEE Trans. Inform. Theory 22 (1976), pp. 644-654.
3. T. ElGamal, A public key cryptosystem and a signature scheme based on discrete logarithms, IEEE Thins. Inform. Theory 31 (1985), pp. 469-472.
4. N. Koblitz, Elliptic curve cryptosystems, Math. Comp. 48 (1987), pp. 203-209.
5. A.J. Menezes, Elliptic Curve Public Key Cryptosystems, Kluwer, Boston, 1993.
6. V. Miller, Uses of elliptic curves in cryptography, Advances in Cryptology - CRYPTO '85, Lecture Notes in Computer Science 218 (1986), Springer-Verlag, pp. 417-426.
7. V. Müller, A. Stein and C. Thiel, Computing discrete logarithms in real quadratic congruence function fields of large genus, preprint.
8. V. Müller, S.A. Vanstone and R.J. Zuccherato, Discrete logarithm based cryptosystems in quadratic function fields of characteristic 2, to appear in Designs, Codes and Cryptography.
9. S. Pohlig and M. Heilman, An improved algorithm for computing logarithms over GF(p) and its cryptographic significance, IEEE Trans. Inform. Theory 24 (1978), pp. 918-924.
10. R. Scheidler, Cryptography in real quadratic congruence function fields, Proceedings of Pragocrypt 1996, CTU Publishing House, Prague, Czech Republic (1996).
11. R. Scheidler, J.A. Buchmann and H.C. Williams, A key exchange protocol using real quadratic fields, J. Cryptology 7 (1994) pp. 171-199.
12. R. Scheidler, A. Stein and H.C. Williams, Key-exchange in real quadratic congruence function fields, Des. Codes Cryptogr. 7 (1996), pp. 153-174.
13. R. Schoof, Elliptic curves over finite fields and the computation of square roots mod p, Math. Comp. 44 (1985), pp. 483-494.
14. D. Shanks, The infrastructure of a real quadratic field and its applications, Proc. 1972 Number Theory Conf, Boulder, Colorado, 1972, pp. 217-224.
15. A. Stein, Equivalences between elliptic curves and real quadratic congruence function fields, Proceedings of Pragocrypt 1996, CTU Publishing House, Prague, Czech Republic (1996).
16. A. Stein and H.C. Williams, Baby step-giant step in real quadratic function fields, preprint.
17. B. Weiss and H.G. Zimmer, Artin’s Theorie der quadratischen Kongruenzfunkionenkörper und ihre Anwendung auf die Berechnung der Einheiten- und Klassen-grupen, Mitt. Math. Ges. Hamburg XII (1991), pp. 261-286.
18. R.J. Zuccherato, The continued fraction algorithm and regulator for quadratic function fields of characteristic 2, Journal of Algebra 190 (1997), pp. 563-587.
19. R.J. Zuccherato, New Applications of Elliptic Curves and Function Fields in Cryptography, Ph.D. Thesis, Department of Combinatorics and Optimization, University of Waterloo, Canada (1997).