Complexity Theory and Cryptology: An Introduction to Cryptocomplexity (Texts in Theoretical Computer Science. An EATCS Series) - Softcover

Über die Autorin bzw. den Autor

Prof. Dr. Jörg Rothe und seine Doktorandin Dorothea Baumeister arbeiten an der Heinrich-Heine-Universität Düsseldorf im Gebiet Computational Social Choice.  Claudia Lindner hat im Gebiet Cake-cutting geforscht und promoviert an der University of Manchester. Prof. Dr. Irene Rothe arbeitet als Informatikerin an der Hochschule Bonn-Rhein-Sieg in Sankt Augustin.

Von der hinteren Coverseite

Modern cryptology employs mathematically rigorous concepts and methods from complexity theory. Conversely, current research in complexity theory often is motivated by questions and problems arising in cryptology. This book takes account of this trend, and therefore its subject is what may be dubbed "cryptocomplexity,'' some sort of symbiosis of these two areas.

This textbook is suitable 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. Starting from scratch, it is an accessible introduction to cryptocomplexity and works its way to the frontiers of current research. It provides the necessary mathematical background, has numerous figures, exercises, and examples, and presents some central, up-to-date research topics and challenges. Due to its comprehensive bibliography and subject index, it is also a valuable source for researchers, teachers, and practitioners working in these fields.