Non-commutative Cryptography and Complexity of Group-theoretic Problems

Alexei Myasnikov; Vladimir Shpilrain; Alexander Ushakov

ISBN 10: 0821853600 / ISBN 13: 9780821853603

Published by American Mathematical Society, 2011

About this Item

This book is about relations between three different areas of mathematics and theoretical computer science: combinatorial group theory, cryptography, and complexity theory. It explores how non-commutative (infinite) groups, which are typically studied in combinatorial group theory, 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, and they open many interesting research avenues within group theory. In particular, a lot of emphasis in the book is put on studying search problems, as compared to decision problems traditionally studied in combinatorial 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. This book also describes new interesting developments in the algorithmic theory of solvable groups and another spectacular new development related to complexity of group-theoretic problems, which is based on the ideas of compressed words and straight-line programs coming from computer science.

Seller Inventory # LU-9780821853603

Bibliographic Details

• Title: Non-commutative Cryptography and Complexity of Group-theoretic Problems
• Publisher: American Mathematical Society
• Publication Date: 2011
• Language: English
• ISBN 10: 0821853600
• ISBN 13: 9780821853603
• Binding: Hardback
• Condition: New

About this title

Synopsis

This book is about relations between three different areas of mathematics and theoretical computer science: combinatorial group theory, cryptography, and complexity theory. It explores how non-commutative (infinite) groups, which are typically studied in combinatorial group theory, 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, and they open many interesting research avenues within group theory. In particular, a lot of emphasis in the book is put on studying search problems, as compared to decision problems traditionally studied in combinatorial 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. This book also describes new interesting developments in the algorithmic theory of solvable groups and another spectacular new development related to complexity of group-theoretic problems, which is based on the ideas of compressed words and straight-line programs coming from computer science.

Review

The world of cryptography is evolving; new improvements constantly open new opportunities in public-key cryptography. Cryptography inspires new group-theoretic problems and leads to important new ideas. The book includes exciting new improvements in the algorithmic theory of solvable groups. Another exceptional new development is the authors' analysis of the complexity of group-theoretic problems. --MAA Reviews