Abstract is missing.
- Shimura Curve ComputationsNoam D. Elkies. 1-47 [doi]
- The Decision Diffie-Hellman ProblemDan Boneh. 48-63 [doi]
- Parallel Implementation of Schönhage s Integer GCD AlgorithmGiovanni Cesari. 64-76 [doi]
- The Complete Analysis of the Binary Euclidean AlgorithmBrigitte Vallée. 77-94 [doi]
- Cyclotomy Primality Proving - Recent DevelopmentsPreda Mihailescu. 95-110 [doi]
- Primality Proving Using Elliptic Curves: An UpdateFrançois Morain. 111-127 [doi]
- Bounding Smooth IntegersDaniel J. Bernstein. 128-130 [doi]
- Factorization of the Numbers of the Form ::::m:::3:::+c::2::m:::2:::+c::1::m+c::0::::::Zhang Mingzhi. 131-136 [doi]
- Modelling the Yield of Number Field Sieve PolynominalsBrian Murphy. 137-150 [doi]
- A Montgomery-Like Square Root for the Number Field SievePhong Q. Nguyen. 151-168 [doi]
- Robert Bennion s Hopping Sieve William F. Galway. 169-178 [doi]
- Trading Time for Space in Prime Number SievesJonathan Sorenson. 179-195 [doi]
- Do Sums of 4 Biquadrates Have a Positive Density?Jean-Marc Deshouillers, François Hennecart, Bernard Landreau. 196-203 [doi]
- New Experimental Results Concerning the Goldbach ConjectureJean-Marc Deshouillers, Herman te Riele, Yannick Saouter. 204-215 [doi]
- Dense Admissible SetsDaniel M. Gordon, Eugene R. Rodemich. 216-225 [doi]
- An Analytic Approach to Smooth Polynominals over Finite FieldsDaniel Panario, Xavier Gourdon, Philippe Flajolet. 226-236 [doi]
- Generating a Product of Three Primes with an Unknown FactorizationDan Boneh, Jeremy Horwitz. 237-251 [doi]
- On the Performance of Signature Schemes Based on Elliptic CurvesErik De Win, Serge Mister, Bart Preneel, Michael J. Wiener. 252-266 [doi]
- NTRU: A Ring-Based Public Key CryptosystemJeffrey Hoffstein, Jill Pipher, Joseph H. Silverman. 267-288 [doi]
- Finding Length-3 Positive Cunningham ChainsAdam Young, Moti Yung. 289-298 [doi]
- Reducing Ideal Arithmetic to Linear Algebra ProblemsStefan Neis. 299-310 [doi]
- Evaluation of Linear Relations between Vectors of a Lattice in Euclidean SpaceIgor A. Semaev. 311-322 [doi]
- An Efficient Parallel Block-Reduction AlgorithmSusanne Wetzel. 323-337 [doi]
- Fast Multiprecision Evaluation of Series of Rational NumbersBruno Haible, Thomas Papanikolaou. 338-350 [doi]
- A Problem Concerning a Character Sum - Extended AbstractEdlyn Teske, Hugh C. Williams. 351-357 [doi]
- Formal Power Series and Their Continued Fraction ExpansionAlfred J. van der Poorten. 358-371 [doi]
- Imprimitive Octic Fields with Small DiscriminantsHenri Cohen, Francisco Diaz y Diaz, Michel Olivier. 372-380 [doi]
- A Table of Totally Complex Number Fields of Small DiscriminantsHenri Cohen, Francisco Diaz y Diaz, Michel Olivier. 381-391 [doi]
- Generating Arithmetically Equivalent Number Fields with Elliptic CurvesBart de Smit. 392-399 [doi]
- Computing the Lead Term of an Abelian ::::L::::-functionDavid S. Dummit, Brett A. Tangedal. 400-411 [doi]
- Timing Analysis of Targeted Hunter SearchesJohn W. Jones, David P. Roberts. 412-423 [doi]
- On Successive Minima of Rings of Algebraic IntegersJacques Martinet. 424-432 [doi]
- Computation of Relative Quadratic Class GroupsHenri Cohen, Francisco Diaz y Diaz, Michel Olivier. 433-440 [doi]
- Generating Class Fields using Shimura ReciprocityAlice Gee, Peter Stevenhagen. 441-453 [doi]
- Irregularity of Prime Numbers over Real Quadratic FieldsJoshua Holden. 454-462 [doi]
- Experimental Results on Class Groups of Real Quadratic FieldsMichael J. Jacobson Jr.. 463-474 [doi]
- Computation of Relative Class Numbers of Imaginary Cyclic Fields of 2-power DegreesStéphane Louboutin. 475-481 [doi]
- Formal Groups, Elliptic Curves, and Some Theorems of CouveignesAntonia W. Bluher. 482-501 [doi]
- A Comparison of Direct and Indirect Methods for Computing Selmer Groups of an Elliptic CurveZ. Djabri, Nigel P. Smart. 502-513 [doi]
- An Algorithm for Approximate Counting of Points on Algebraic Sets over Finite FieldsMing-Deh A. Huang, Yiu-Chung Wong. 514-527 [doi]
- ::::S::::-integral Points on Elliptic Curves and Fermat s Triple EquationsAttila Pethö, E. Herrmann, Horst Günter Zimmer. 528-540 [doi]
- Speeding Up Pollard s Rho Method for Computing Discrete LogarithmsEdlyn Teske. 541-554 [doi]
- A General Method of Constructing Global Function FieldsHarald Niederreiter, Chaoping Xing. 555-566 [doi]
- Lattice Basis Reduction in Function FieldsSachar Paulus. 567-575 [doi]
- Comparing Real and Imaginary Arithmetics for Divisor Class Groups of Hyperelliptic CurvesSachar Paulus, Andreas Stein. 576-591 [doi]
- Unit Computation in Purely Cubic Function Fields of Unit Rank 1Renate Scheidler, Andreas Stein. 592-606 [doi]
- An Improved Method of Computing the Regulator of a Real Quadratic Function FieldAndreas Stein, Hugh C. Williams. 607-620 [doi]
- The Equivalence Between Elliptic Curve and Quadratic Function Field Discrete Logarithms in Characteristic 2Robert J. Zuccherato. 621-638 [doi]