Algorithmic Number Theory

the long version

Algorithmic Number Theory: 4th International Symposium, ANTS-IV Leiden, The Netherlands, July 2-7, 2000. Proceedings<br />Author: Wieb Bosma<br /> Published by Springer Berlin Heidelberg<br /> ISBN: 978-3-540-67695-9<br /> DOI: 10.1007/10722028<br /><br />Table of Contents:<p></p><ul><li>The Complexity of Some Lattice Problems </li><li>Rational Points Near Curves and Small Nonzero | x </li><li>Coverings of Curves of Genus 2 </li><li>Lattice Reduction in Cryptology: An Update </li><li>Construction of Secure C </li><li>Curves over Finite Fields with Many Rational Points Obtained by Ray Class Field Extensions </li><li>New Results on Lattice Basis Reduction in Practice </li><li>Baby-Step Giant-Step Algorithms for Non-uniform Distributions </li><li>On Powers as Sums of Two Cubes </li><li>Factoring Polynomials over ρ-Adic Fields </li><li>Strategies in Filtering in the Number Field Sieve </li><li>Factoring Polynomials over Finite Fields and Stable Colorings of Tournaments </li><li>Computing Special Values of Partial Zeta Functions </li><li>Construction of Tables of Quartic Number Fields </li><li>Counting Discriminants of Number Fields of Degree up to Four </li><li>On Reconstruction of Algebraic Numbers </li><li>Dissecting a Sieve to Cut Its Need for Space </li><li>Counting Points on Hyperelliptic Curves over Finite Fields </li><li>Modular Forms for GL(3) and Galois Representations </li><li>Modular Symbols and Hecke Operators</li></ul>