5. ANTS 2002:
Sydney, NSW, Australia
Claus Fieker, David R. Kohel (Eds.):
Algorithmic Number Theory, 5th International Symposium, ANTS-V, Sydney, Australia, July 7-12, 2002, Proceedings.
Lecture Notes in Computer Science 2369 Springer 2002, ISBN 3-540-43863-7
Invited Talks
- Manjul Bhargava:
Gauss Composition and Generalizations.
1-8

- John Coates:
Elliptic Curves - The Crossroads of Theory and Computation.
9-19

- Antoine Joux:
The Weil and Tate Pairings as Building Blocks for Public Key Cryptosystems.
20-32

- Bjorn Poonen:
Using Elliptic Curves of Rank One towards the Undecidability of Hilbert's Tenth Problem over Rings of Algebraic Integers.
33-41

- Takakazu Satoh:
On p-adic Point Counting Algorithms for Elliptic Curves over Finite Fields.
43-66

Number Theory
Arithmetic Geometry
Elliptic Curves and CM
Point Counting
Cryptography
Function Fields
Discrete Logarithms and Factoring
Gröbner Bases
- Allan K. Steel:
A New Scheme for Computing with Algebraically Closed Fields.
491-505

Complexity
- J. Maurice Rojas:
Additive Complexity and Roots of Polynomials over Number Fields and \mathfrak{p} -adic Fields.
506-516

Last update Sun May 19 21:34:30 2013
CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page