05099nam a22005415i 4500001001800000003000900018005001700027007001500044008004100059020001800100024002400118041000800142050001500150072001600165072002300181082001400204100002800218245017200246260006100418264006100479300003400540336002600574337002600600338003600626347002400662490005800686505194700744520128902691650002203980650004004002650002304042650003004065650003004095650001604125650001904141650002204160650004704182650004604229650002104275650004104296650001904337650001604356710003404372773002004406776003604426830005804462856003704520978-3-540-24847-7DE-He21320141014114343.0cr nn 008mamaa121227s2004 gw | s |||| 0|eng d a97835402484777 a10.1007/b982102doi aeng 4aQA76.9.A43 7aUMB2bicssc 7aCOM0513002bisacsh04a005.12231 aBuell, Duncan.eeditor.10aAlgorithmic Number Theoryh[electronic resource] :b6th International Symposium, ANTS-VI, Burlington, VT, USA, June 13-18, 2004, Proceedings /cedited by Duncan Buell. 1aBerlin, Heidelberg :bSpringer Berlin Heidelberg,c2004. 1aBerlin, Heidelberg :bSpringer Berlin Heidelberg,c2004. aXII, 456 p.bonline resource. atextbtxt2rdacontent acomputerbc2rdamedia aonline resourcebcr2rdacarrier atext filebPDF2rda1 aLecture Notes in Computer Science,x0302-9743 ;v30760 aInvited Talks -- Computing Zeta Functions via p-Adic Cohomology -- Using Primitive Subgroups to Do More with Fewer Bits -- Elliptic Curves of Large Rank and Small Conductor -- Contributed Papers -- Binary GCD Like Algorithms for Some Complex Quadratic Rings -- On the Complexity of Computing Units in a Number Field -- Implementing the Arithmetic of C 3,4 Curves -- Pseudocubes and Primality Testing -- Elliptic Curves with a Given Number of Points -- Rational Divisors in Rational Divisor Classes -- Conjectures about Discriminants of Hecke Algebras of Prime Level -- Montgomery Scalar Multiplication for Genus 2 Curves -- Improved Weil and Tate Pairings for Elliptic and Hyperelliptic Curves -- Elliptic Curves x 3 + y 3 = k of High Rank -- Proving the Primality of Very Large Numbers with fastECPP -- A Low-Memory Parallel Version of Matsuo, Chao, and Tsujii’s Algorithm -- Function Field Sieve in Characteristic Three -- A Comparison of CEILIDH and XTR -- Stable Models of Elliptic Curves, Ring Class Fields, and Complex Multiplication -- An Algorithm for Computing Isomorphisms of Algebraic Function Fields -- A Method to Solve Cyclotomic Norm Equations -- Imaginary Cyclic Quartic Fields with Large Minus Class Numbers -- Nonic 3-adic Fields -- Montgomery Addition for Genus Two Curves -- Numerical Evaluation at Negative Integers of the Dedekind Zeta Functions of Totally Real Cubic Number Fields -- Salem Numbers of Trace -2 and Traces of Totally Positive Algebraic Integers -- Low-Dimensional Lattice Basis Reduction Revisited -- Computing Order Statistics in the Farey Sequence -- The Discrete Logarithm in Logarithmic l-Class Groups and Its Applications in K-theory -- Point Counting on Genus 3 Non Hyperelliptic Curves -- Algorithmic Aspects of Cubic Function Fields -- A Binary Recursive Gcd Algorithm -- Lagrange Resolvents Constructed from Stark Units -- Cryptanalysis of a Divisor Class Group Based Public-Key Cryptosystem. aThe sixth Algorithmic Number Theory Symposium was held at the University of Vermont, in Burlington, from 13–18 June 2004. The organization was a joint e?ort of number theorists from around the world. There were four invited talks at ANTS VI, by Dan Bernstein of the Univ- sity of Illinois at Chicago, Kiran Kedlaya of MIT, Alice Silverberg of Ohio State University, and Mark Watkins of Pennsylvania State University. Thirty cont- buted talks were presented, and a poster session was held. This volume contains the written versions of the contributed talks and three of the four invited talks. (Not included is the talk by Dan Bernstein.) ANTS in Burlington is the sixth in a series that began with ANTS I in 1994 at Cornell University, Ithaca, New York, USA and continued at Universit´eB- deaux I, Bordeaux, France (1996), Reed College, Portland, Oregon, USA (1998), the University of Leiden, Leiden, The Netherlands (2000), and the University of Sydney, Sydney, Australia (2002). The proceedings have been published as volumes 877, 1122, 1423, 1838, and 2369 of Springer-Verlag’s Lecture Notes in Computer Science series. The organizers of the 2004 ANTS conference express their special gratitude and thanks to John Cannon and Joe Buhler for invaluable behind-the-scenes advice. 0aComputer science. 0aData encryption (Computer science). 0aComputer software. 0aComputational complexity. 0aAlgebraxData processing. 0aAlgorithms. 0aNumber theory.14aComputer Science.24aAlgorithm Analysis and Problem Complexity.24aDiscrete Mathematics in Computer Science.24aData Encryption.24aSymbolic and Algebraic Manipulation.24aNumber Theory.24aAlgorithms.2 aSpringerLink (Online service)0 tSpringer eBooks08iPrinted edition:z9783540221562 0aLecture Notes in Computer Science,x0302-9743 ;v307640uhttp://dx.doi.org/10.1007/b98210