4. ANTS 2000: Leiden, The Netherlands

@proceedings{DBLP:conf/ants/2000,
  editor    = {Wieb Bosma},
  title     = {Algorithmic Number Theory, 4th International Symposium, ANTS-IV,
               Leiden, The Netherlands, July 2-7, 2000, Proceedings},
  booktitle = {ANTS},
  publisher = {Springer},
  series    = {Lecture Notes in Computer Science},
  volume    = {1838},
  year      = {2000},
  isbn      = {3-540-67695-3},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

Invited Talks

• Jin-yi Cai:
  The Complexity of Some Lattice Problems. 1-32
  
• Noam D. Elkies:
  Rational Points Near Curves and Small Nonzero |x³-y²| via Lattice Reduction. 33-64
  
• E. Victor Flynn:
  Coverings of Curves of Genus 2. 65-84
  
• Phong Q. Nguyen, Jacques Stern:
  Lattice Reduction in Cryptology: An Update. 85-112
  

Contributed Papers

• Seigo Arita:
  Construction of Secure C_abCurves Using Modular Curves. 113-126
  
• Roland Auer:
  Curves over Finite Fields with Many Rational Points Obtained by Ray Class Field Extensions. 127-134
  
• Werner Backes, Susanne Wetzel:
  New Results on Lattice Basis Reduction in Practice. 135-152
  
• Simon R. Blackburn, Edlyn Teske:
  Baby-Step Giant-Step Algorithms for Non-uniform Distributions. 153-168
  
• Nils Bruin:
  On Powers as Sums of Two Cubes. 169-184
  
• David G. Cantor, Daniel M. Gordon:
  Factoring Polynominals over p-Adic Fields. 185-208
  
• Stefania Cavallar:
  Strategies in Filtering in the Number Field Sieve. 209-232
  
• Qi Cheng, Ming-Deh A. Huang:
  Factoring Polynominals over Finite Fields and Stable Colorings of Tournaments. 233-246
  
• Gautam Chinta, Paul E. Gunnells, Robert Sczech:
  Computing Special Values of Partial Zeta Functions. 247-256
  
• Henri Cohen, Francisco Diaz y Diaz, Michel Olivier:
  Construction of Tables of Quartic Number Fields. 257-268
  
• Henri Cohen, Francisco Diaz y Diaz, Michel Olivier:
  Counting Discriminants of Number Fields of Degree up to Four. 269-284
  
• Claus Fieker, Carsten Friedrichs:
  On Reconstruction of Algebraic Numbers. 285-296
  
• William F. Galway:
  Dissecting a Sieve to Cut Its Need for Space. 297-312
  
• Pierrick Gaudry, Robert Harley:
  Counting Points on Hyperelliptic Curves over Finite Fields. 313-332
  
• Bert van Geemen, Jaap Top:
  Modular Forms for GL(3) and Galois Representations. 333-346
  
• Paul E. Gunnells:
  Modular Symbols and Hecke Operators. 347-358
  
• Ryuichi Harasawa, Joe Suzuki:
  Fast Jacobian Group Arithmetic on C_abCurves. 359-376
  
• Ming-Deh A. Huang, Ka Lam Kueh, Ki-Seng Tan:
  Lifting Elliptic Curves and Solving the Elliptic Curve Discrete Logarithm Problem. 377-384
  
• Antoine Joux:
  A One Round Protocol for Tripartite Diffie-Hellman. 385-394
  
• David R. Kohel, Igor Shparlinski:
  On Exponential Sums and Group Generators for Elliptic Curves over Finite Fields. 395-404
  
• David R. Kohel, William A. Stein:
  Component Groups of Quotients of J₀(N). 405-412
  
• Stéphane Louboutin:
  Fast Computation of Relative Class Numbers of CM-Fields. 413-422
  
• Siguna Müller:
  On Probable Prime Testing and the Computation of Square Roots mod n. 423-438
  
• Koh-ichi Nagao:
  Improving Group Law Algorithms for Jacobians of Hyperelliptic Curves. 439-448
  
• Sami Omar:
  Central Values of Artin L-Functions for Quaternion Fields. 449-458
  
• Richard G. E. Pinch:
  The Pseudoprimes up to 10¹³. 459-474
  
• Jörg Richstein:
  Computing the Number of Goldbach Partitions up to 5·10⁸. 475-490
  
• Xavier-François Roblot, Brett A. Tangedal:
  Numerical Verification of the Brumer-Stark Conjecture. 491-504
  
• Fernando Rodriguez-Villegas:
  Explicit Models of Genus 2 Curves with Split CM. 505-514
  
• Renate Scheidler:
  Reduction in Purely Cubic Function Fields of Unit Rank One. 515-532
  
• Derek Smith:
  Factorization in the Composition Algebras. 533-538
  
• Jonathan Sorenson:
  A Fast Algorithm for Appoximately Counting Smooth Numbers. 539-550
  
• Roel J. Stroeker, Nikolaus Tzanakis:
  Computing All Integer Solutions of a General Elliptic Equation. 551-562
  
• Edlyn Teske, Hugh C. Williams:
  A Note on Shanks's Chains of Primes. 563-580
  
• Ulrich Vollmer:
  Asymptotically Fast Discrete Logarithms in Quadratic Number Fields. 581-594
  
• André Weilert:
  Asymptotically Fast GCD Computation in Z[i]. 595-613
  

Last update Tue Feb 14 03:48:36 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page