Studies In Complexity And Cryptography
Download Studies In Complexity And Cryptography PDF/ePub or read online books in Mobi eBooks. Click Download or Read Online button to get Studies In Complexity And Cryptography book now. This website allows unlimited access to, at the time of writing, more than 1.5 million titles, including hundreds of thousands of titles in various foreign languages.
Complexity Theory and Cryptology
Author: Jörg Rothe
language: en
Publisher: Springer Science & Business Media
Release Date: 2005-11-10
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.
Studies in Complexity and Cryptography
Author: Oded Goldreich
language: en
Publisher: Springer Science & Business Media
Release Date: 2011-08-03
Paying witness to the author’s thirty-year career in science, these high-quality papers, some co-written with colleagues, reflect his professional range, covering material from average-case complexity to derandomization and probabilistically checkable proofs.
Group-based Cryptography
Author: Alexei Myasnikov
language: en
Publisher: Springer Science & Business Media
Release Date: 2008-07-17
This book is about relations between three different areas of mathematics and theoretical computer science: combinatorial group theory, cryptography, and complexity theory. It is explored how non-commutative (infinite) groups, which are typically studied in combinatorial group theory, can be used in public key cryptography. It is also shown that there is a remarkable feedback from cryptography to combinatorial group theory because some of the problems motivated by cryptography appear to be new to group theory, and they open many interesting research avenues within group theory. Then, complexity theory, notably generic-case complexity of algorithms, is employed for cryptanalysis of various cryptographic protocols based on infinite groups, and the ideas and machinery from the theory of generic-case complexity are used to study asymptotically dominant properties of some infinite groups that have been applied in public key cryptography so far. Its elementary exposition makes the book accessible to graduate as well as undergraduate students in mathematics or computer science.