Group-based Cryptography (Advanced Courses in Mathematics - CRM Barcelona) - Couverture souple

Livre 5 sur 35: Advanced Courses in Mathematics - CRM Barcelona

Myasnikov, Alexei

 
9783764388263: Group-based Cryptography (Advanced Courses in Mathematics - CRM Barcelona)
Couverture souple
ISBN 10 : 3764388269 ISBN 13 : 9783764388263
Editeur : Birkhäuser Basel, 2008

Synopsis

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.

Les informations fournies dans la section « Synopsis » peuvent faire référence à une autre édition de ce titre.

Présentation de l'éditeur

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.

Les informations fournies dans la section « A propos du livre » peuvent faire référence à une autre édition de ce titre.

Éditeur
Birkhäuser Basel
Date d'édition
2008
Langue
anglais
ISBN 10 
3764388269
ISBN 13 
9783764388263
Reliure
Broché
Nombre de pages
204
Coordonnées du fabricant
non disponible
Personne responsable
non disponible

Autres éditions populaires du même titre

9783764398477: Group-based Cryptography

Edition présentée

ISBN 10 :  3764398477 ISBN 13 :  9783764398477
Editeur : Springer, 2009
Couverture souple