Lecture Notes in Computer Science
© 2000
Algorithmic Number Theory
4th International Symposium, ANTS-IV Leiden, The Netherlands, July 2-7, 2000 Proceedings
Editors: Bosma, Wieb (Ed.)
Free PreviewBuy this book
- Table of contents (40 chapters)
-
-
The Complexity of Some Lattice Problems
Pages 1-32
-
Rational Points Near Curves and Small Nonzero | x 3 − y 2| via Lattice Reduction
Pages 33-63
-
Coverings of Curves of Genus 2
Pages 65-84
-
Lattice Reduction in Cryptology: An Update
Pages 85-112
-
Construction of Secure C ab Curves Using Modular Curves
Pages 113-126
-
Table of contents (40 chapters)
Read this book on SpringerLink
- Download Preface 1 PDF (44.7 KB)
- Download Table of contents PDF (53.7 KB)
Recommended for you
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
*immediately available upon purchase as print book shipments may be delayed due to the COVID-19 crisis. ebook access is temporary and does not include ownership of the ebook. Only valid for books with an ebook version. Springer Reference Works are not included.
