



LEADER 
04556nmm a2200385 u 4500 
001 
EB000652316 
003 
EBX01000000000000000505398 
005 
00000000000000.0 
007 
cr 
008 
140122  eng 
020 


a 9783540248477

100 
1 

a Buell, Duncan
e [editor]

245 
0 
0 
a Algorithmic Number Theory
h Elektronische Ressource
b 6th International Symposium, ANTSVI, Burlington, VT, USA, June 1318, 2004, Proceedings
c edited by Duncan Buell

250 


a 1st ed. 2004

260 


a Berlin, Heidelberg
b Springer Berlin Heidelberg
c 2004, 2004

300 


a XII, 456 p
b online resource

505 
0 

a Invited Talks  Computing Zeta Functions via pAdic 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 LowMemory 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 3adic 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  LowDimensional Lattice Basis Reduction Revisited  Computing Order Statistics in the Farey Sequence  The Discrete Logarithm in Logarithmic lClass Groups and Its Applications in Ktheory  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 PublicKey Cryptosystem

653 


a Computer science—Mathematics

653 


a Symbolic and Algebraic Manipulation

653 


a Number theory

653 


a Discrete Mathematics in Computer Science

653 


a Algorithms

653 


a Cryptology

653 


a Algorithms

653 


a Data encryption (Computer science)

653 


a Number Theory

653 


a Algorithm Analysis and Problem Complexity

710 
2 

a SpringerLink (Online service)

041 
0 
7 
a eng
2 ISO 6392

989 


b SBA
a Springer Book Archives 2004

490 
0 

a Lecture Notes in Computer Science

856 


u https://doi.org/10.1007/b98210?nosfx=y
x Verlag
3 Volltext

082 
0 

a 512.7

520 


a The 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 SpringerVerlag’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 behindthescenes advice
