Editors:
- Includes supplementary material: sn.pub/extras
Part of the book series: Lecture Notes in Computer Science (LNCS, volume 2369)
Conference series link(s): ANTS: International Algorithmic Number Theory Symposium
Conference proceedings info: ANTS 2002.
Buy it now
Buying options
Tax calculation will be finalised at checkout
Other ways to access
This is a preview of subscription content, log in via an institution to check for access.
Table of contents (39 papers)
-
Front Matter
-
Invited Talks
-
Number Theory
-
Arithmetic Geometry
-
Elliptic Curves and CM
Keywords
Reviews
From the reviews:
"The book contains 39 articles about computational algebraic number theory, arithmetic geometry and cryptography. … The articles in this book reflect the broad interest of the organizing committee and the participants. The emphasis lies on the mathematical theory as well as on computational results. We recommend the book to students and researchers who want to read about current research in number theory and arithmetic geometry and its applications." (R. Carls, Nieuw Archief voor Wiskunde, Vol. 6 (3), 2005)
Editors and Affiliations
-
School of Mathematics and Statistics, F07, University of Sydney, Sydney, Australia
Claus Fieker, David R. Kohel
Bibliographic Information
Book Title: Algorithmic Number Theory
Book Subtitle: 5th International Symposium, ANTS-V, Sydney, Australia, July 7-12, 2002. Proceedings
Editors: Claus Fieker, David R. Kohel
Series Title: Lecture Notes in Computer Science
DOI: https://doi.org/10.1007/3-540-45455-1
Publisher: Springer Berlin, Heidelberg
-
eBook Packages: Springer Book Archive
Copyright Information: Springer-Verlag Berlin Heidelberg 2002
Softcover ISBN: 978-3-540-43863-2Published: 26 June 2002
eBook ISBN: 978-3-540-45455-7Published: 02 August 2003
Series ISSN: 0302-9743
Series E-ISSN: 1611-3349
Edition Number: 1
Number of Pages: X, 522
Topics: Number Theory, Algorithm Analysis and Problem Complexity, Discrete Mathematics in Computer Science, Numeric Computing, Cryptology, Algorithms