- Full Description
Modern cryptology increasingly employs mathematically rigorous concepts and methods from complexity theory. Conversely, current research topics in complexity theory are often motivated by questions and problems from cryptology. This book takes account of this situation, and therefore its subject is what may be dubbed 'cryptocomplexity'', a kind of symbiosis of these two areas. This book is written for undergraduate and graduate students of computer science, mathematics, and engineering, and can be used for courses on complexity theory and cryptology, preferably by stressing their interrelation. Moreover, it may serve as a valuable source for researchers, teachers, and practitioners working in these fields. Starting from scratch, it works its way to the frontiers of current research in these fields and provides a detailed overview of their history and their current research topics and challenges.
- Table of Contents
Table of Contents
- Introduction to Cryptocomplexity.
- Foundations of Computer Science and Mathematics.
- Foundations of Complexity Theory.
- Foundations of Cryptology.
- Hierarchies Based on NP.
- Randomized Algorithms and Complexity Classes.
- RSA Cryptosystem, Primality, and Factoring.
- Other Public
- Key Cryptosystems and Protocols.
- List of Figures.
- List of Tables.
If you think that you've found an error in this book, please let us know by emailing to firstname.lastname@example.org . You will find any confirmed erratum below, so you can check if your concern has already been addressed. No errata are currently published