Algorithmic Number Theory: Third International Symposium, ANTS-III, Portland, Orgeon, USA, June 21-25, 1998, Proceedings by Joe P. BuhlerAlgorithmic Number Theory: Third International Symposium, ANTS-III, Portland, Orgeon, USA, June 21-25, 1998, Proceedings by Joe P. Buhler

Algorithmic Number Theory: Third International Symposium, ANTS-III, Portland, Orgeon, USA, June 21…

EditorJoe P. Buhler

Paperback

Pricing and Purchase Info

$181.71 online 
$206.95 list price save 12%
Earn 909 plum® points

Prices and offers may vary in store

Quantity:

In stock online

Ships free on orders over $25

Not available in stores

about

This book constitutes the refereed proceedings of the Third International Symposium on Algorithmic Number Theory, ANTS-III, held in Portland, Oregon, USA, in June 1998.The volume presents 46 revised full papers together with two invited surveys. The papers are organized in chapters on gcd algorithms, primality, factoring, sieving, analytic number theory, cryptography, linear algebra and lattices, series and sums, algebraic number fields, class groups and fields, curves, and function fields.
Title:Algorithmic Number Theory: Third International Symposium, ANTS-III, Portland, Orgeon, USA, June 21…Format:PaperbackDimensions:656 pages, 9.25 × 6.1 × 0.03 in

The following ISBNs are associated with this title:

ISBN - 10:3540646574

ISBN - 13:9783540646570

Look for similar items by category:

Reviews

Table of Contents

Invited Talk 1: Shimura Curve Computations Noam D. Elkies (Harvard University) Invited Talk 2: The Decision Diffie-Hellman Problem Dan Boneh (Stanford University) GCD Algorithms Parallel Implementation of Schonhages Integer GCD Algorithm Giovanni Cesari (Università degli Studi di Trieste) The Complete Analysis of the Binary Euclidean Algorithm Brigitte Vallée (Université de Caen) Primality Cyclotomy Primality Proving -- Recent Developments Preda Mihailescu (FingerPIN AG & ETH, Institut fur wissentschaftliches Rechnen) Primality Proving Using Elliptic Curves: An Update F. Morain (Laboratoire d informatique de l'Ecole Polytechnique) Factoring Bounding Smooth Integers (extended abstract) Daniel J. Bernstein (The University of Illinois at Chicago) Factorization of the Numbers of the Form m 3 + c 2 m 2 + c 1 m+ c 0 Zhang Mingzhi (Sichuan Union University) Modelling the Yield of Number Field Sieve Polynomials Brian Murphy (Australian National University) A Montgomery-Like Square Root for the Number Field Sieve Phong Nguyen (Ecole Normale Supérieure) Sieving Robert Bennions Hopping Sieve William F. Galway (University of Illinois at Urbana-Champaign) Trading Time for Space in Prime Number Sieves Jonathan P. Sorenson (Butler University) Analytic Number Theory Do Sums of 4 Biquadrates Have a Positive Density? Jean-Marc Deshouillers, Francois Hennecart, Bernard Landreau (Université Bordeaux) New Experimental Results Concerning the Goldbach Conjecture J-M. Deshouillers (Université Bordeaux), H.J.J. te Riele (CWI), Y. Saouter (Institut de Recherche en Informatique de Toulouse) Dense Admissible Sets Daniel M. Gordon, Gene Rodemich (Center for Communications Research) An Analytic Approach to Smooth Polynomials over Finite Fields Daniel Panario (University of Toronto), Xavier Gourdon (INRIA), Philippe Flajolet (INRIA) Cryptography Generating a Product of Three Primes with an Unknown Factorization Dan Boneh, Jeremy Horwitz (Stanford University) On the Performance of Signature Schemes Based on Elliptic Curves Erik De Win (Katholieke Universiteit Leuven), Serge Mister (Queens University) Bart Preneel (Katholieke Universiteit Leuven), Michael Wiener (Entrust Technologies) NTRU: A Ring-Based Public Key Cryptosystem Jeffrey Hoffstein, Jill Pipher, Joseph H. Silverman (Brown University) Finding Length-3 Positive Cunningham Chains and their Cryptographic Significance Adam Young (Columbia University), Moti Yung (CertCo) Linear Algebra, Lattices Reducing Ideal Arithmetic to Linear Algebra Problems Stefan Neis (Darmstadt University of Technology) Evaluation of Linear Relations between Vectors of a Lattice in Euclidean Space I. A. Semaev An Efficient Parallel Block-Reduction Algorithm Susanne Wetzel (Universitat des Saarlandes) Series, Sums Fast Multiprecision Evaluation of Series of Rational Numbers Bruno Haible (ILOF), Thomas Papanikolaou (Laboratoire A2X) A Problem Concerning a Character Sum --- Extended Abstract E. Teske (Technische Universitat Darmstadt), H.C. Williams (University of Manitoab) Formal Power Series and Their Continued Fraction Expansion Alf van der Poorten (Centre for Number Theory Research) Algebraic Number Fields Imprimitive Octic Fields with Small Discriminants Henri Cohen, Francisco Diaz y Diaz, Michel Olivier (Université Bordeaux I) A Table of Totally Complex Number Fields of Small Discriminants Henri Cohen, Francisco Diaz y Diaz, Michel Olivier (Université Bordeaux I) Generating Arithmetically Equivalent Number Fields with Elliptic Curves Bart de Smit (Rijksuniversiteit Leiden) Computing the Lead Term of an Abelian L-Function David S. Dummit (University of Vermont), Brett A. Tangedal (College of Charleston Timing Analysis of Targeted Hunter Searches John W. Jones (Arizona State University), David P. Roberts (Rutgers University) On Successive Minima of Rings of Algebraic Integers Jacques Martinet (Université Bordeaux I) Class Groups and Fields Computation of Relative Quadratic Class Groups Henri Cohen, Francisco Diaz y Diaz, Michel Olivier (Université Bordeaux I) Generating Class Fields Using Shimura Reciprocity Alice Gee, Peter Stevenhagen (Universiteit van Amsterdam) Irregularity of Prime Numbers over Real Quadratic Fields Joshua Holden (University of Massachusetts at Amherst) Experimental Results on Class Groups of Real Quadratic Fields (extended abstract) Michael J. Jacobson, Jr. (Technische Universitat Darmstadt) Computation of Relative Class Numbers of Imaginary Cyclic Fields of 2-Power Degrees Stéphane Louboutin (Université de Caen) Curves Formal Groups, Elliptic Curves, and Some Theorems of Couveignes Antonia W. Bluher (National Security Agency) A Comparison of Direct and Indirect Methods for Computing Selmer Groups of an elleptic curve Z. Djabri (University of Kent at Canterbury), N.P. Smart (Hewlett-Packard Laboratories) An Algorithm for Approximate Counting of Points on Algebraic Sets over Finite Fields Ming-Deh Huang, Yiu-Chung Wong (University of Southern California) S-integral points on Elliptic Curves and Fermats Triple Equations A. Petho, E. Herrmann, H. G. Zimmer Speeding up Pollards Rho Method for Computing Discrete Logarithms Edlyn Teske (Technische Universitat Darmstadt) Function Fields A General Method of Constructing Global Function Fields with Many Rational Places Harald Niederreiter (Austrian Academy of Sciences), Chaoping Xing (The National University of Singapore) Lattice Basis Reduction in Function Fields Sachar Paulus (Darmstadt University of Technology) Comparing Real and Imaginary Arithmetics for Divisor Class Groups of Hyperelliptic Curves Sachar Paulus (Darmstadt University of Technology), Andreas Stein (University of Manitoba) Unit Computation in Purely Cubic Function Fields of Unit Rank 1 Renate Scheidler (University of Delaware), Andreas Stein (University of Manitoba) An Improved Method of Computing the Regulator of a Real Quadratic Function Field Andreas Stein, Hugh C. Williams (University of Manitoba) The Equivalence Between Elliptic Curve and Quadratic Function Field Discrete Logarithms in Characteristic 2 Robert J. Zuccherato (Entrust Technologies) Author Index `