Complexity Theory and Cryptology

Complexity Theory and Cryptology

EnglishPaperback / softbackPrint on demand
Rothe, Jörg
Springer, Berlin
EAN: 9783642060540
Print on demand
Delivery on Friday, 21. of August 2026
CZK 1,175
Common price CZK 1,306
Discount 10%
pc
Do you want this product today?
Megabooks Praha Korunní
not available
Librairie Francophone Praha Štěpánská
not available
Megabooks Ostrava
not available
Megabooks Olomouc
not available
Megabooks Plzeň
not available
Megabooks Brno
not available
Megabooks Hradec Králové
not available
Megabooks České Budějovice
not available
Megabooks Liberec
not available

Detailed information

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.

EAN 9783642060540
ISBN 3642060544
Binding Paperback / softback
Publisher Springer, Berlin
Publication date October 21, 2010
Pages 478
Language English
Dimensions 235 x 155
Country Germany
Authors Rothe, Jorg
Illustrations XII, 478 p.
Edition Softcover reprint of hardcover 1st ed. 2005
Series Texts in Theoretical Computer Science. An EATCS Series
Manufacturer information
The manufacturer's contact information is currently not available online, we are working intensively on the axle. If you need information, write us on [email protected], we will be happy to provide it.