Koha online

Your cart is empty.
Normal view MARC view ISBD view

Group-based Cryptography [electronic resource] /by Alexei Myasnikov, Alexander Ushakov, Vladimir Shpilrain.

by Myasnikov, Alexei [author.]; Ushakov, Alexander [author.]; Shpilrain, Vladimir [author.]; SpringerLink (Online service).
Material type: materialTypeLabelBookSeries: Advanced Courses in Mathematics - CRM Barcelona, Centre de Recerca Matemàtica: Publisher: Basel : Birkhäuser Basel, 2008.Description: online resource.ISBN: 9783764388270.Subject(s): Mathematics | Group theory | Computer science -- Mathematics | Combinatorics | Mathematics | Group Theory and Generalizations | Combinatorics | Computational Mathematics and Numerical AnalysisDDC classification: 512.2 Online resources: Click here to access online
Contents:
Background on Groups, Complexity, and Cryptography -- Background on Public Key Cryptography -- Background on Combinatorial Group Theory -- Background on Computational Complexity -- Non-commutative Cryptography -- Canonical Non-commutative Cryptography -- Platform Groups -- Using Decision Problems in Public Key Cryptography -- Generic Complexity and Cryptanalysis -- Distributional Problems and the Average-Case Complexity -- Generic Case Complexity -- Generic Complexity of NP-complete Problems -- Asymptotically Dominant Properties and Cryptanalysis -- Asymptotically Dominant Properties -- Length-Based and Quotient Attacks.
In: Springer eBooksSummary: This book is about relations between three different areas of mathematics and theoretical computer science: combinatorial group theory, cryptography, and complexity theory. It is explored how non-commutative (infinite) groups, which are typically studied in combinatorial group theory, can be used in public key cryptography. It is also shown that there is a 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. 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. Its elementary exposition makes the book accessible to graduate as well as undergraduate students in mathematics or computer science.
Tags from this library: No tags from this library for this title. Add tag(s)
Log in to add tags.
    average rating: 0.0 (0 votes)

Background on Groups, Complexity, and Cryptography -- Background on Public Key Cryptography -- Background on Combinatorial Group Theory -- Background on Computational Complexity -- Non-commutative Cryptography -- Canonical Non-commutative Cryptography -- Platform Groups -- Using Decision Problems in Public Key Cryptography -- Generic Complexity and Cryptanalysis -- Distributional Problems and the Average-Case Complexity -- Generic Case Complexity -- Generic Complexity of NP-complete Problems -- Asymptotically Dominant Properties and Cryptanalysis -- Asymptotically Dominant Properties -- Length-Based and Quotient Attacks.

This book is about relations between three different areas of mathematics and theoretical computer science: combinatorial group theory, cryptography, and complexity theory. It is explored how non-commutative (infinite) groups, which are typically studied in combinatorial group theory, can be used in public key cryptography. It is also shown that there is a 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. 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. Its elementary exposition makes the book accessible to graduate as well as undergraduate students in mathematics or computer science.

There are no comments for this item.

Log in to your account to post a comment.
@ Jomo Kenyatta University Of Agriculture and Technology Library

Powered by Koha