Complexity Theory and Cryptology
An Introduction to Cryptocomplexity
Seiten
2005
|
2005
Springer Berlin (Verlag)
978-3-540-22147-0 (ISBN)
Springer Berlin (Verlag)
978-3-540-22147-0 (ISBN)
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.
Prof. Dr. Jörg Rothe arbeitet an der Heinrich-Heine-Universität Düsseldorf im Gebiet Computational Social Choice.
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.
Erscheint lt. Verlag | 22.7.2005 |
---|---|
Reihe/Serie | Texts in Theoretical Computer Science. An EATCS Series |
Zusatzinfo | XII, 478 p. |
Verlagsort | Berlin |
Sprache | englisch |
Maße | 155 x 235 mm |
Gewicht | 855 g |
Themenwelt | Mathematik / Informatik ► Informatik ► Theorie / Studium |
Schlagworte | Algorithm analysis and problem complexity • algorithms • Complexity • Complexity Classes • Complexity classes and hierarchies • Complexity theory • Computational Complexity • cryptography • foundations of comp • foundations of computer science • Interactive Proof Systems • Interactive proof systems and zero-knowledge • Komplexitätstheorie • Kryptographie / Kryptologie • One-way functions • Public-Key Cryptography • randomized algorithms • Zero-knowledge proofs |
ISBN-10 | 3-540-22147-6 / 3540221476 |
ISBN-13 | 978-3-540-22147-0 / 9783540221470 |
Zustand | Neuware |
Haben Sie eine Frage zum Produkt? |
Mehr entdecken
aus dem Bereich
aus dem Bereich
was jeder über Informatik wissen sollte
Buch | Softcover (2024)
Springer Vieweg (Verlag)
37,99 €
Grundlagen – Anwendungen – Perspektiven
Buch | Softcover (2022)
Springer Vieweg (Verlag)
34,99 €
Eine Einführung in die Systemtheorie
Buch | Softcover (2022)
UTB (Verlag)
25,00 €