Google
Google Scholar
MS Academic
CiteSeerX
CORE
Semantic Scholar5. ANTS 2002: Sydney, NSW, Australia
Claus Fieker, David R. Kohel:
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
- Bjorn Poonen:
Using Elliptic Curves of Rank One towards the Undecidability of Hilbert's Tenth Problem over Rings of Algebraic Integers. 33-41
Number Theory
- Takashi Fukuda, Keiichi Komatsu:
An Application of Siegel Modular Functions to Kronecker's Limit Formula. 108-119 - 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
Elliptic Curves and CM
- 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 E. Shparlinski, Ron Steinfeld:
Chinese Remaindering for Algebraic Numbers in a Hidden Field. 349-356
Function Fields
- 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
- 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
Complexity
- J. Maurice Rojas:
Additive Complexity and Roots of Polynomials over Number Fields and \mathfrak{p} -adic Fields. 506-516
maintained by 
at 
at 
data released under the ODC-BY 1.0 license; see also our legal information page
last updated on 2018-04-18 21:07 CEST by the dblp team