Lecture Notes in Computer Science

Algorithmic Number Theory

4th International Symposium, ANTS-IV Leiden, The Netherlands, July 2-7, 2000 Proceedings

Editors: Bosma, Wieb (Ed.)

Free Preview

Buy this book

eBook n/a
  • ISBN 978-3-540-44994-2
  • Digitally watermarked, DRM-free
  • Included format: PDF
  • ebooks can be used on all reading devices
Softcover n/a
  • ISBN 978-3-540-67695-9
  • Free shipping for individuals worldwide

Table of contents (40 chapters)

Table of contents (40 chapters)
  • The Complexity of Some Lattice Problems

    Pages 1-32

    Cai, Jin-Yi

  • Rational Points Near Curves and Small Nonzero | x 3 − y 2| via Lattice Reduction

    Pages 33-63

    Elkies, Noam D.

  • Coverings of Curves of Genus 2

    Pages 65-84

    Flynn, E. Victor

  • Lattice Reduction in Cryptology: An Update

    Pages 85-112

    Nguyen, Phong Q. (et al.)

  • Construction of Secure C ab Curves Using Modular Curves

    Pages 113-126

    Arita, Seigo

Buy this book

eBook n/a
  • ISBN 978-3-540-44994-2
  • Digitally watermarked, DRM-free
  • Included format: PDF
  • ebooks can be used on all reading devices
Softcover n/a
  • ISBN 978-3-540-67695-9
  • Free shipping for individuals worldwide
Loading...

Recommended for you

Loading...

Bibliographic Information

Bibliographic Information
Book Title
Algorithmic Number Theory
Book Subtitle
4th International Symposium, ANTS-IV Leiden, The Netherlands, July 2-7, 2000 Proceedings
Editors
  • Wieb Bosma
Series Title
Lecture Notes in Computer Science
Series Volume
1838
Copyright
2000
Publisher
Springer-Verlag Berlin Heidelberg
Copyright Holder
Springer-Verlag Berlin Heidelberg
eBook ISBN
978-3-540-44994-2
DOI
10.1007/10722028
Softcover ISBN
978-3-540-67695-9
Series ISSN
0302-9743
Edition Number
1
Number of Pages
IX, 612
Topics