Non-commutative Cryptography and Complexity of Group-theoretic Problems

Download or read book Non-commutative Cryptography and Complexity of Group-theoretic Problems written by Alexei G. Myasnikov and published by American Mathematical Soc.. This book was released on 2011 with total page 402 pages. Available in PDF, EPUB and Kindle. Book excerpt: Examines the relationship between three different areas of mathematics and theoretical computer science: combinatorial group theory, cryptography, and complexity theory. It explores how non-commutative (infinite) groups can be used in public key cryptography. It also shows that there is remarkable feedback from cryptography to combinatorial group theory because some of the problems motivated by cryptography appear to be new to group theory.