Complexity and Cryptography
An Introduction
Seiten
2006
Cambridge University Press (Verlag)
978-0-521-85231-9 (ISBN)
Cambridge University Press (Verlag)
978-0-521-85231-9 (ISBN)
- Titel erscheint in neuer Auflage
- Artikel merken
Cryptography plays a crucial role in many aspects of today's world. This book 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.
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.
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.
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.
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.
| Erscheint lt. Verlag | 12.1.2006 |
|---|---|
| Zusatzinfo | Worked examples or Exercises |
| Verlagsort | Cambridge |
| Sprache | englisch |
| Maße | 156 x 236 mm |
| Gewicht | 554 g |
| Themenwelt | Informatik ► Theorie / Studium ► Kryptologie |
| ISBN-10 | 0-521-85231-5 / 0521852315 |
| ISBN-13 | 978-0-521-85231-9 / 9780521852319 |
| Zustand | Neuware |
| Haben Sie eine Frage zum Produkt? |
Mehr entdecken
aus dem Bereich
aus dem Bereich
Geschichte, Techniken, Anwendungen
Buch | Softcover (2022)
C.H.Beck (Verlag)
CHF 13,90
Die faszinierende Geschichte der Verschlüsselung
Buch | Softcover (2022)
Springer (Verlag)
CHF 48,95
