Are you interested in Joining program? Contact Us.

You must login first to view this article.
Login Now Create New Account

Author(s): Alexei Myasnikov, Vladimir Shpilrain, Alexander Ushakov

Series: Advanced courses in mathematics, CRM Barcelona

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.