0
Your cart

Your cart is empty

Books > Science & Mathematics > Mathematics > Applied mathematics

Buy Now

Non-commutative Cryptography and Complexity of Group-theoretic Problems (Hardcover) Loot Price: R3,267
Discovery Miles 32 670
You Save: R174 (5%)
Non-commutative Cryptography and Complexity of Group-theoretic Problems (Hardcover): Alexei Myasnikov, Vladimir Shpilrain,...

Non-commutative Cryptography and Complexity of Group-theoretic Problems (Hardcover)

Alexei Myasnikov, Vladimir Shpilrain, Alexander Ushakov

Series: Mathematical Surveys and Monographs

 (sign in to rate)
List price R3,441 Loot Price R3,267 Discovery Miles 32 670 | Repayment Terms: R306 pm x 12* You Save R174 (5%)

Bookmark and Share

Expected to ship within 12 - 17 working days

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.

General

Imprint: American Mathematical Society
Country of origin: United States
Series: Mathematical Surveys and Monographs
Release date: 2012
First published: November 2011
Authors: Alexei Myasnikov • Vladimir Shpilrain • Alexander Ushakov
Dimensions: 254 x 178 x 0mm (L x W x T)
Format: Hardcover
Pages: 413
ISBN-13: 978-0-8218-5360-3
Categories: Books > Computing & IT > Social & legal aspects of computing > Privacy & data protection
Books > Science & Mathematics > Mathematics > Applied mathematics > General
LSN: 0-8218-5360-0
Barcode: 9780821853603

Is the information for this product incomplete, wrong or inappropriate? Let us know about it.

Does this product have an incorrect or missing image? Send us a new image.

Is this product missing categories? Add more categories.

Review This Product

No reviews yet - be the first to create one!

Partners