Complexity and Cryptography: An Introduction
- 6h 8m
- Dominic Welsh, John Talbot
- Cambridge University Press
- 2006
Cryptography plays a crucial role in many aspects of today's world, from internet banking and ecommerce to email and web-based business processes. Understanding the principles on which it is based is an important topic that requires a knowledge of both computational complexity and a range of topics in pure mathematics. This book provides that knowledge, combining an informal style with rigorous proofs of the key results to give an accessible introduction. It comes with plenty of examples and exercises (many with hints and solutions), and is based on a highly successful course developed and taught over many years to undergraduate and graduate students in mathematics and computer science.
- The first introductory textbook combining the topics of Computational Complexity with Cryptography
- Self-contained - the Appendices contain all the required mathematics
- Over 160 exercises and problems, many with hints and solutions
About the Authors
John Talbot has been a lecturer in mathematics, University College London since 2003. Before that he was GCHQ Research Fellow in Oxford.
Dominic Welsh is a fellow of Merton College, Oxford where he was Professor of Mathematics. He has held numerous visiting positions including the John von Neumann Professor, University of Bonn. This is his fifth book.
In this Book
-
Basics of Cryptography
-
Complexity Theory
-
Non-deterministic Computation
-
Probabilistic Computation
-
Symmetric Cryptosystems
-
One Way Functions
-
Public Key Cryptography
-
Digital Signatures
-
Key Establishment Protocols
-
Secure Encryption
-
Identification Schemes
-
Bibliography
