Group-based Cryptography [Paperback]

Covering relations between three different areas of mathematics and theoretical computer science, this book explores how non-commutative (infinite) groups, which are typically studied in combinatorial group theory, can be used in public key cryptography.

Background on Groups, Complexity, and Cryptography.- Background on Public Key Cryptography.- Background on Combinatorial Group Theory.- Background on Computational Complexity.- Non-commutative Cryptography.- Canonical Non-commutative Cryptography.- Platform Groups.- Using Decision Problems in Public Key Cryptography.- Generic Complexity and Cryptanalysis.- Distributional Problems and the Average-Case Complexity.- Generic Case Complexity.- Generic Complexity of NP-complete Problems.- Asymptotically Dominant Properties and Cryptanalysis.- Asymptotically Dominant Properties.- Length-Based and Quotient Attacks.

From the reviews:

The book at hand has the aim to introduce the reader into the rich world of group-based asymmetric encryption. & The basics necessary for the understanding are given in introducing chapters. Many hints for further reading are given. So, the book might be useful for the beginner, who wants to get a clear introduction, as well as for the expert, who gets an elaborate survey as well as much stimulation for proceeding research. (Michael W?stner, Zentralblatt MATH, Vol. 1248, 2012)

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 wilƒE