Abstract is missing.
- The Complexity of Some Lattice ProblemsJin-yi Cai. 1-32
- Rational Points Near Curves and Small Nonzero |x:::3:::-y:::2:::| via Lattice ReductionNoam D. Elkies. 33-64
- Coverings of Curves of Genus 2E. Victor Flynn. 65-84
- Lattice Reduction in Cryptology: An UpdatePhong Q. Nguyen, Jacques Stern. 85-112
- Construction of Secure ::::C::ab::::::Curves Using Modular CurvesSeigo Arita. 113-126
- Curves over Finite Fields with Many Rational Points Obtained by Ray Class Field ExtensionsRoland Auer. 127-134
- New Results on Lattice Basis Reduction in PracticeWerner Backes, Susanne Wetzel. 135-152
- Baby-Step Giant-Step Algorithms for Non-uniform DistributionsSimon R. Blackburn, Edlyn Teske. 153-168
- On Powers as Sums of Two CubesNils Bruin. 169-184
- Factoring Polynominals over ::::p::::-Adic FieldsDavid G. Cantor, Daniel M. Gordon. 185-208
- Strategies in Filtering in the Number Field SieveStefania Cavallar. 209-232
- Factoring Polynominals over Finite Fields and Stable Colorings of TournamentsQi Cheng, Ming-Deh A. Huang. 233-246
- Computing Special Values of Partial Zeta FunctionsGautam Chinta, Paul E. Gunnells, Robert Sczech. 247-256
- Construction of Tables of Quartic Number FieldsHenri Cohen, Francisco Diaz y Diaz, Michel Olivier. 257-268
- Counting Discriminants of Number Fields of Degree up to FourHenri Cohen, Francisco Diaz y Diaz, Michel Olivier. 269-284
- On Reconstruction of Algebraic NumbersClaus Fieker, Carsten Friedrichs. 285-296
- Dissecting a Sieve to Cut Its Need for SpaceWilliam F. Galway. 297-312
- Counting Points on Hyperelliptic Curves over Finite FieldsPierrick Gaudry, Robert Harley. 313-332
- Modular Forms for GL(3) and Galois RepresentationsBert van Geemen, Jaap Top. 333-346
- Modular Symbols and Hecke OperatorsPaul E. Gunnells. 347-358
- Fast Jacobian Group Arithmetic on ::::C::ab::::::CurvesRyuichi Harasawa, Joe Suzuki. 359-376
- Lifting Elliptic Curves and Solving the Elliptic Curve Discrete Logarithm ProblemMing-Deh A. Huang, Ka Lam Kueh, Ki-Seng Tan. 377-384
- A One Round Protocol for Tripartite Diffie-HellmanAntoine Joux. 385-394
- On Exponential Sums and Group Generators for Elliptic Curves over Finite FieldsDavid R. Kohel, Igor Shparlinski. 395-404
- Component Groups of Quotients of ::::J::::::0::(::::N::::)David R. Kohel, William A. Stein. 405-412
- Fast Computation of Relative Class Numbers of CM-FieldsStéphane Louboutin. 413-422
- On Probable Prime Testing and the Computation of Square Roots mod ::::n::::Siguna Müller. 423-438
- Improving Group Law Algorithms for Jacobians of Hyperelliptic CurvesKoh-ichi Nagao. 439-448
- Central Values of Artin ::::L::::-Functions for Quaternion FieldsSami Omar. 449-458
- The Pseudoprimes up to 10:::13:::Richard G. E. Pinch. 459-474
- Computing the Number of Goldbach Partitions up to 5·10:::8:::Jörg Richstein. 475-490
- Numerical Verification of the Brumer-Stark ConjectureXavier-François Roblot, Brett A. Tangedal. 491-504
- Explicit Models of Genus 2 Curves with Split CMFernando Rodriguez-Villegas. 505-514
- Reduction in Purely Cubic Function Fields of Unit Rank OneRenate Scheidler. 515-532
- Factorization in the Composition AlgebrasDerek Smith. 533-538
- A Fast Algorithm for Appoximately Counting Smooth NumbersJonathan Sorenson. 539-550
- Computing All Integer Solutions of a General Elliptic EquationRoel J. Stroeker, Nikolaus Tzanakis. 551-562
- A Note on Shanks s Chains of PrimesEdlyn Teske, Hugh C. Williams. 563-580
- Asymptotically Fast Discrete Logarithms in Quadratic Number FieldsUlrich Vollmer. 581-594
- Asymptotically Fast GCD Computation in Z[::::i::::]André Weilert. 595-613