Group-based Cryptography
Alexei Myasnikov
Verkauft von AHA-BUCH GmbH, Einbeck, Deutschland
AbeBooks-Verkäufer seit 14. August 2006
Neu - Softcover
Zustand: Neu
Anzahl: 1 verfügbar
In den Warenkorb legenVerkauft von AHA-BUCH GmbH, Einbeck, Deutschland
AbeBooks-Verkäufer seit 14. August 2006
Zustand: Neu
Anzahl: 1 verfügbar
In den Warenkorb legenDruck auf Anfrage Neuware - Printed after ordering - 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.
Bestandsnummer des Verkäufers 9783764388263
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.
„Über diesen Titel“ kann sich auf eine andere Ausgabe dieses Titels beziehen.
Allgemeine Geschäftsbedingungen und Kundeninformationen / Datenschutzerklärung
I. Allgemeine Geschäftsbedingungen
§ 1 Grundlegende Bestimmungen
(1) Die nachstehenden Geschäftsbedingungen gelten für alle Verträge, die Sie mit uns als Anbieter (AHA-BUCH GmbH) über die Internetplattformen AbeBooks und/oder ZVAB schließen. Soweit nicht anders vereinbart, wird der Einbeziehung gegebenenfalls von Ihnen verwendeter eigener Bedingungen widersprochen.
(2) Verbraucher im Sinne der nachstehenden Regelungen...
Mehr InformationWir liefern Lagerartikel innerhalb von 24 Stunden nach Erhalt der Bestellung aus.
Barsortimentsartikel, die wir über Nacht geliefert bekommen, am darauffolgenden Werktag.
Unser Ziel ist es Ihnen die Artikel in der ökonomischten und effizientesten Weise zu senden.