Complexity and Cryptography: An Introduction

by John Talbot, Dominic Welsh

Overview

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 strong proofs of the key results to provide an accessible introduction. It includes many examples and exercises, and is based on a highly successful course developed and taught over many years.

Product Details

ISBN-13:	9780521617710
Publisher:	Cambridge University Press
Publication date:	01/12/2006
Edition description:	New Edition
Pages:	304
Product dimensions:	6.06(w) x 9.02(h) x 0.71(d)

About the Author

John Talbot is a Lecturer in Mathematics at University College London.

Dominic Welsh is a Professor of Mathematics at the Mathematics Institute, University of Oxford.

Table of Contents

1. Basics of cryptography; 2. Complexity theory; 3. Non-deterministic computation; 4. Probabilistic computation; 5. Symmetric cryptosystems; 6. One-way functions; 7. Public key cryptography; 8. Digital signatures; 9. Key establishment protocols; 10. Secure encryption; 11. Identification schemes; Appendix 1; Appendix 2; Appendix 3; Appendix 4; Appendix 5; Appendix 6; Bibliography; Index.

Editorial Reviews

"...useful to mathematicians wishing to learn more complexity theory...Very readable...a very well-written book."
The Mathematical Association of America


"The book is well organized and very clearly written, with an abundance of well-thought-out exercises."
Mathematical Reviews


"This is a nice introductory textbook that covers the most important areas of cryptography in an easily accessible manner, provides numerous examples and easy exercises, and I really enjoyed reading it.... a recommendable source for an introductory course on cryptography..."
Jörg Rothe, ACM SIGACT News


"This book [combines] an informal writing style with rigorous proofs of the key results to give an accessible introduction. It also provides ample examples and exercises, many with hints and solutions"
Cryptologia


"Their exposition is very clear, and they give a large number of examples throughout this discussion that made the book very readable even to those of us whose interests tend far more towards the theoretical than the algorithmic... A very well-written book that fills its niche quite well, and will make a welcome addition to any collection."
Darren Glass, Gettysburg College for MAA Reviews

From the Publisher