£88.65

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

Security

Price data last checked 149 day(s) ago - refreshing...

View at Amazon

We'll watch every seller, every day. One email when your price arrives.

This is the usual price. Wait for it to drop, or tell us your number.

£89 today · usual range £0–£0 · best ever £75

NEW HERE?

Amazon shows you one price. We show you all of them.

Tosheroon watches Amazon prices so you don't have to. Every product on Amazon has a price history — we make it visible. Set the price you'd actually pay, and we'll email you the second it gets there. No app, no account, one email.

WHAT'S ON THIS PAGE

↓ Price chart
when this has been cheap or pricey

↓ Forecast
where the price is heading next

↓ Statistics
all-time high & low, recent range

↑ Price alert
name your number, we'll email you

Price History & Forecast

Grey patches = out of stock. Cheaper = lower on the chart. Hover for exact prices.

Last 582 days • 582 data points (No recent data available)

Historical

Generating forecast...

Price Distribution

Price distribution over 582 days • 10 price levels

Days at Price

Current Price

Price Analysis

Most common price: £92 (169 days, 29.0%)

Price range: £75 - £110

Price levels: 10 different prices over 582 days

Description

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.

Product Specifications

Format: hardcover
ASIN: 0821853600
Category: Books > Subjects > Computing & Internet > Networking & Security > Security
Domain: Amazon UK
Release Date: 15 December 2011
Listed Since: 15 July 2011

Barcode

No barcode data available

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

This is the usual price. Wait for it to drop, or tell us your number.

Price History & Forecast

Price Distribution

Price Analysis

Description

Product Specifications

Barcode

Similar Products You Might Like

Algorithmic Problems of Group Theory, Their Complexity, and Applications to Cryptography (Contemporary Mathematics)

Group Theoretic Cryptography (Chapman & Hall/CRC Cryptography and Network Security Series)

Group Theory, Combinatorics, and Computing (Contemporary Mathematics)

CRC Press Handbook of Computational Group Theory - Mathematics

Algebra and Computer Science (Contemporary Mathematics)

Applied Algebra: Codes, Ciphers and Discrete Algorithms, Second Edition (Discrete Mathematics and Its Applications)

Handbook of Computational Group Theory (Discrete Mathematics and Its Applications)

Combinatorial and Geometric Group Theory, Edinburgh 1993: 204 (London Mathematical Society Lecture Note Series, Series Number 204)

Groups - St Andrews 1981: 71 (London Mathematical Society Lecture Note Series, Series Number 71)

Introduction to Modern Algebra and Its Applications

Authentication Codes and Combinatorial Designs (Discrete Mathematics and Its Applications)

Chapman and Hall/CRC Cryptanalysis of Number Theoretic Ciphers

Introduction to Cryptography with Open-Source Software (Discrete Mathematics and Its Applications)

Computational Group Theory and the Theory of Groups II (Contemporary Mathematics): Computational Group Theory and Cohomology, August 4-8, 2008, ... Western Michigan University, Kalamazoo, Mi

Ever-Evolving Groups: An Introduction to Modern Finite Group Theory: 32 (Algebra and Applications, 32)

Authentication Codes and Combinatorial Designs (Discrete Mathematics and Its Applications)

An Introduction to Mathematical Cryptography (Undergraduate Texts in Mathematics)

Computational Number Theory and Modern Cryptography (Information Security (Wiley))

Integer Algorithms In Cryptology And Information Assurance

Algorithmic Algebraic Combinatorics and Gröbner Bases

Partially Homomorphic Encryption

Algebraic Cryptanalysis

A Course in Cryptography (Pure and Applied Undergraduate Texts)

Groups and Characters: 30 (Pure and Applied Mathematics: A Wiley Series of Texts, Monographs and Tracts)