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 (14 chapters)
-
Front Matter
-
Preliminaries
-
Front Matter
-
-
Approximation and Complexity of the Discrete Logarithm
-
Front Matter
-
-
Complexity of Breaking the Diffie—Hellman Cryptosystem
-
Front Matter
-
-
Concluding Remarks
-
Front Matter
-
About this book
Reviews
"This volume gives a thorough treatment of the complexity of the discrete logarithm problem in a prime field, as well as related problems. The final chapter on further directions gives an interesting selection of problems."
--Zentralblatt Math
Authors and Affiliations
-
School of Mathematics, Physics, Computing and Electronics, Macquarie University, Australia
Igor Shparlinski
Bibliographic Information
Book Title: Number Theoretic Methods in Cryptography
Book Subtitle: Complexity lower bounds
Authors: Igor Shparlinski
Series Title: Progress in Computer Science and Applied Logic
DOI: https://doi.org/10.1007/978-3-0348-8664-2
Publisher: Birkhäuser Basel
-
eBook Packages: Springer Book Archive
Copyright Information: Springer Basel AG 1999
Hardcover ISBN: 978-3-7643-5888-4Published: 15 February 1999
Softcover ISBN: 978-3-0348-9723-5Published: 08 October 2012
eBook ISBN: 978-3-0348-8664-2Published: 06 December 2012
Series ISSN: 2297-0576
Series E-ISSN: 2297-0584
Edition Number: 1
Number of Pages: IX, 182
Topics: Number Theory, Cryptology, Theory of Computation, Data Structures and Information Theory