Skip to main content
  • Conference proceedings
  • © 2010

Algorithmic Number Theory

9th International Symposium, ANTS-IX, Nancy, France, July 19-23, 2010, Proceedings

Part of the book series: Lecture Notes in Computer Science (LNCS, volume 6197)

Part of the book sub series: Theoretical Computer Science and General Issues (LNTCS)

Conference series link(s): ANTS: International Algorithmic Number Theory Symposium

Conference proceedings info: ANTS 2010.

Buying options

eBook USD 99.00
Price excludes VAT (USA)
  • ISBN: 978-3-642-14518-6
  • Instant PDF download
  • Readable on all devices
  • Own it forever
  • Exclusive offer for individuals only
  • Tax calculation will be finalised during checkout
Softcover Book USD 129.00
Price excludes VAT (USA)

This is a preview of subscription content, access via your institution.

Table of contents (30 papers)

  1. Front Matter

  2. Invited papers

    1. Learning with Errors over Rings

      • Oded Regev
      Pages 3-3
    2. Lattices and Spherical Designs

      • Gabriele Nebe
      Pages 4-5
    3. Fixed Points for Discrete Logarithms

      • Mariana Levin, Carl Pomerance, K. Soundararajan
      Pages 6-15
  3. Contributed papers

    1. Explicit Coleman Integration for Hyperelliptic Curves

      • Jennifer S. Balakrishnan, Robert W. Bradshaw, Kiran S. Kedlaya
      Pages 16-31
    2. Smallest Reduction Matrix of Binary Quadratic Forms

      • Aurore Bernard, Nicolas Gama
      Pages 32-49
    3. Practical Improvements to Class Group and Regulator Computation of Real Quadratic Fields

      • Jean-François Biasse, Michael J. Jacobson Jr.
      Pages 50-65
    4. On the Use of the Negation Map in the Pollard Rho Method

      • Joppe W. Bos, Thorsten Kleinjung, Arjen K. Lenstra
      Pages 66-82
    5. An O(M(n) logn) Algorithm for the Jacobi Symbol

      • Richard P. Brent, Paul Zimmermann
      Pages 83-95
    6. New Families of ECM Curves for Cunningham Numbers

      • Éric Brier, Christophe Clavier
      Pages 96-109
    7. Visualizing Elements of Sha[3] in Genus 2 Jacobians

      • Nils Bruin, Sander R. Dahmen
      Pages 110-125
    8. On Weil Polynomials of K3 Surfaces

      • Andreas-Stephan Elsenhans, Jörg Jahnel
      Pages 126-141
    9. Class Invariants by the CRT Method

      • Andreas Enge, Andrew V. Sutherland
      Pages 142-156
    10. Short Bases of Lattices over Number Fields

      • Claus Fieker, Damien Stehlé
      Pages 157-173
    11. Congruent Number Theta Coefficients to 1012

      • William B. Hart, Gonzalo Tornaría, Mark Watkins
      Pages 186-200
    12. Pairing the Volcano

      • Sorina Ionica, Antoine Joux
      Pages 201-218
    13. A Subexponential Algorithm for Evaluating Large Degree Isogenies

      • David Jao, Vladimir Soukharev
      Pages 219-233

Other Volumes

  1. Algorithmic Number Theory

Keywords

  • Galois groups
  • Number theory
  • algebraic geometry
  • algebraic number fields
  • algebraic number theory
  • algorithms
  • ants
  • complete addition law
  • cryptography
  • diophantine equation
  • elliptic curves
  • factoring
  • finite field
  • fruitless cycles
  • tar
  • algorithm analysis and problem complexity

Editors and Affiliations

  • LIP/ENS-Lyon, Lyon, Cedex 07, France

    Guillaume Hanrot

  • Laboratoire d’Informatique (CNRS/UMR 7650), École polytechnique, Palaiseau Cedex, France

    François Morain

  • INRIA Nancy, project CARAMEL, Villers-lès-Nancy Cedex,, France

    Emmanuel Thomé

Bibliographic Information

Buying options

eBook USD 99.00
Price excludes VAT (USA)
  • ISBN: 978-3-642-14518-6
  • Instant PDF download
  • Readable on all devices
  • Own it forever
  • Exclusive offer for individuals only
  • Tax calculation will be finalised during checkout
Softcover Book USD 129.00
Price excludes VAT (USA)