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. Springer 2002 Lecture Notes in Computer Science 2369 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
- Takashi Fukuda, Keiichi Komatsu: An Application of Siegel Modular Functions to Kronecker's Limit Formula. 108-119
- Stéphane Louboutin: Efficient Computation of Class Numbers of Real Abelian Number Fields. 134-147
- Ulrich Vollmer: An Accelerated Buchmann Algorithm for Regulator Computation in Real Quadratic Fields. 148-162
Arithmetic Geometry
- Enrique González-Jiménez, Josep González, Jordi Guàrdia: Computations on Modular Jacobian Surfaces. 189-197
- Tony Shaska: Genus 2 Curves with (3, 3)-Split Jacobian and Large Automorphism Group. 205-218
- Helena A. Verrill: Transportable Modular Symbols and the Intersection Pairing. 219-233
Elliptic Curves and CM
- Noam D. Elkies: Curves Dy=x-x of Odd Analytic Rank. 244-251
- Andreas Enge, François Morain: Comparing Invariants for Class Fields of Imaginary Quadratic Fields. 252-266
Point Counting
- Hae Young Kim, Jung Youl Park, Jung Hee Cheon, Je Hong Park, Jae Heon Kim, Sang Geun Hahn: Fast Elliptic Curve Point Counting Using Gaussian Normal Basis. 292-307
- Jan Denef, Frederik Vercauteren: An Extension of Kedlaya's Algorithm to Artin-Schreier Curves in Characteristic 2. 308-323
Cryptography
- Igor Shparlinski, Ron Steinfeld: Chinese Remaindering for Algebraic Numbers in a Hidden Field. 349-356
Function Fields
- Florian Hess: An Algorithm for Computing Weierstrass Points. 357-371
- Wen-Ching W. Li, Hiren Maharaj, Henning Stichtenoth, Noam D. Elkies: New Optimal Tame Towers of Function Fields over Small Finite Fields. 372-389
- Alfred J. van der Poorten, Xuan Chuong Tran: Periodic Continued Fractions in Elliptic Function Fields. 390-404
Discrete Logarithms and Factoring
- Joshua Holden: Fixed Points and Two-Cycles of the Discrete Logarithm. 405-415
- Paul C. Leyland, Arjen K. Lenstra, Bruce Dodson, Alec Muffett, Samuel S. Wagstaff Jr.: MPQS with Three Large Primes. 446-460
- Kazuto Matsuo, Jinhui Chao, Shigeo Tsujii: An Improved Baby Step Giant Step Algorithm for Point Counting of Hyperelliptic Curves over Finite Fields. 461-474
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
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-12-07T210950 by the dblp team