Ebook: Complexity Theory and Cryptology: An Introduction to Cryptocomplexity
Author: Jörg Rothe
- Tags: Theory of Computation, Data Encryption, Computation by Abstract Devices, Algorithm Analysis and Problem Complexity
- Series: Texts in Theoretical Computer Science. An EATCS Series
- Year: 2005
- Publisher: Springer
- Language: English
- pdf
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.
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.
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.
Content:
Front Matter....Pages I-XI
Introduction to Cryptocomplexity....Pages 1-8
Foundations of Computer Science and Mathematics....Pages 9-52
Foundations of Complexity Theory....Pages 53-125
Foundations of Cryptology....Pages 127-170
Hierarchies Based on NP....Pages 171-259
Randomized Algorithms and Complexity Classes....Pages 261-310
RSA Cryptosystem, Primality, and Factoring....Pages 311-359
Other Public-Key Cryptosystems and Protocols....Pages 361-412
Back Matter....Pages 444-478
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.
Content:
Front Matter....Pages I-XI
Introduction to Cryptocomplexity....Pages 1-8
Foundations of Computer Science and Mathematics....Pages 9-52
Foundations of Complexity Theory....Pages 53-125
Foundations of Cryptology....Pages 127-170
Hierarchies Based on NP....Pages 171-259
Randomized Algorithms and Complexity Classes....Pages 261-310
RSA Cryptosystem, Primality, and Factoring....Pages 311-359
Other Public-Key Cryptosystems and Protocols....Pages 361-412
Back Matter....Pages 444-478
....