Access this book
Tax calculation will be finalised at checkout
Other ways to access
Table of contents (33 chapters)
-
Introduction
-
Approximation and Complexity of the Discrete Logarithm
-
Approximation and Complexity of the Diffie—Hellman Secret Key
Keywords
About this book
Reviews
From the reviews:
“Igor Shparlinski is a very prolific mathematician and computer scientist … . The book is written at a very high level, suitable for graduate students and researchers in computer science and mathematics. … book has a unique perspective, and is not really comparable to other books in the area. … book contains many deep results, and the mathematically-sophisticated reader can find much that is novel. … this is an impressive work that will be of significant interest to researchers in cryptography and algorithmic number theory.” (Jeffrey Shallit, SIGACT News, Vol. 41 (3), September, 2010)Editors and Affiliations
Bibliographic Information
Book Title: Cryptographic Applications of Analytic Number Theory
Book Subtitle: Complexity Lower Bounds and Pseudorandomness
Editors: Igor Shparlinski
Series Title: Progress in Computer Science and Applied Logic
DOI: https://doi.org/10.1007/978-3-0348-8037-4
Publisher: Birkhäuser Basel
-
eBook Packages: Springer Book Archive
Copyright Information: Springer Basel AG 2003
Hardcover ISBN: 978-3-7643-6654-4Published: 11 December 2002
Softcover ISBN: 978-3-0348-9415-9Published: 03 October 2013
eBook ISBN: 978-3-0348-8037-4Published: 07 March 2013
Series ISSN: 2297-0576
Series E-ISSN: 2297-0584
Edition Number: 1
Number of Pages: IX, 414
Topics: Number Theory, Cryptology, Applications of Mathematics