Stock Image

Non-Commutative Cryptography and Complexity of Group-Theoretic Problems (Mathematical Surveys and Monographs)

Alexei Myasnikov

0 ratings by Goodreads
ISBN 10: 0821853600 / ISBN 13: 9780821853603
Published by American Mathematical Society, 2011
Condition: Good Hardcover
From Books Express (Portsmouth, NH, U.S.A.)

AbeBooks Seller Since August 14, 2015 Seller Rating 5-star rating

Quantity Available: 1

Buy Used
Price: US$ 327.47 Convert Currency
Shipping: Free Within U.S.A. Destination, rates & speeds
Add to basket

30 Day Return Policy

About this Item

Ships with Tracking Number! INTERNATIONAL WORLDWIDE Shipping available. May not contain Access Codes or Supplements. May be ex-library. Shipping & Handling by region. Buy with confidence, excellent customer service!. Bookseller Inventory # 0821853600

Ask Seller a Question

Bibliographic Details

Title: Non-Commutative Cryptography and Complexity ...

Publisher: American Mathematical Society

Publication Date: 2011

Binding: Hardcover

Book Condition:Good

About this title


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.


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

"About this title" may belong to another edition of this title.

Store Description

Visit Seller's Storefront

Terms of Sale:

Buy with confidence. Excellent customer service. 30 day return policy.

Books Express LLC
1465 Woodbury Ave
Portsmouth NH 03801

Shipping Terms:

Standard and expedited shipping options include shipping and handling costs. Default shipping is by USPS Media Mail and frequently USPS Priority Mail or UPS Ground is used. Books should arrive within 10-14 business days for expedited shipping, and 20-30 business days for standard shipping. Standard shipping can on occasion take up to 30 days for delivery.

List this Seller's Books

Payment Methods
accepted by seller

Visa Mastercard American Express

Check Money Order PayPal Invoice Bank Draft Bank/Wire Transfer Direct Debit (Personally Authorized Payment)