Non-commutative Cryptography and Complexity of Group-theoretic Problems
Regular price
€122.99
Regular price
€126.99
Sale
Sale price
€122.99
14 days return policy
Shipping & Delivery
A01=Alexander Ushakov
A01=Alexei Myasnikov
A01=Vladimir Shpilrain
Age Group_Uncategorized
Age Group_Uncategorized
Author_Alexander Ushakov
Author_Alexei Myasnikov
Author_Vladimir Shpilrain
automatic-update
Category1=Non-Fiction
Category=PBW
Category=URD
COP=United States
Delivery_Delivery within 10-20 working days
eq_bestseller
eq_computing
eq_isMigrated=0
eq_isMigrated=2
eq_nobargain
eq_non-fiction
Language_English
PA=Available
Price_€100 and above
PS=Active
softlaunch
Product details
- ISBN 9780821853603
- Weight: 862g
- Publication Date: 30 Dec 2011
- Publisher: American Mathematical Society
- Publication City/Country: US
- Product Form: Hardback
- Language: English
Secure
checkout
Fast Shipping
Easy returns
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.
