Non-commutative Cryptography and Complexity of Group-theoretic Problems
Alexei Myasnikov|Vladimir Shpilrain|Alexander Ushakov
ISBN 10: 0821853600 ISBN 13: 9780821853603
Verlag: American Mathematical Society, 2011
Neu
Hardcover
Verkäufer
moluna, Greven, Deutschland
Verkäuferbewertung 4 von 5 Sternen
AbeBooks-Verkäufer seit 9. Juli 2020
Dieser Artikel ist nicht mehr verfügbar.
Beschreibung
Beschreibung:
KlappentextrnrnExamines the relationship between three different areas of mathematics and theoretical computer science: combinatorial group theory, cryptography, and complexity theory. It explores how non-commutative (infinite) groups can be use. Bestandsnummer des Verkäufers 767993787
Inhaltsangabe:
Myasnikov (City College of New York) et al. apply the complexity of non-commutative groups to public key cryptography, assess the generic-case performance of various algorithms, and explore the asymptotically dominant properties of infinite groups used in public key cryptography. The second half of the book develops algorithms for word search and conjugacy search problems, a decision algorithm for the work problem in free solvable groups, and a polynomial time algorithm based on a straight line program. An appendix links probability theory and cryptanalysis. Annotation ©2012 Book News, Inc., Portland, OR (booknews.com)
„Über diesen Titel“ kann sich auf eine andere Ausgabe dieses Titels beziehen.
Bibliografische Details
Titel: Non-commutative Cryptography and Complexity ...
Verlag: American Mathematical Society
Erscheinungsdatum: 2011
Einband: Hardcover
Zustand: New
Beste Suchergebnisse bei AbeBooks
Beispielbild für diese ISBN
Non-Commutative Cryptography and Complexity of Group-Theoretic Problems (Mathematical Surveys and Monographs)
Verlag:
American Mathematical Society, 2011
ISBN 10: 0821853600
ISBN 13: 9780821853603
Neu
Hardcover
Anbieter: Kennys Bookshop and Art Galleries Ltd., Galway, GY, Irland
Verkäuferbewertung 5 von 5 Sternen
Zustand: New. Series: Mathematical Surveys and Monographs. Num Pages: 413 pages, Illustrations. BIC Classification: PBW; URD. Category: (P) Professional & Vocational. Dimension: 254 x 178 x 0. . . 2011. Hardcover. . . . . Bestandsnummer des Verkäufers V9780821853603
Neu kaufen
EUR 121,48
EUR 10,50 Versand
Versand von Irland nach USA
Versand von Irland nach USA
Anzahl: 1 verfügbar
Beispielbild für diese ISBN
Non-Commutative Cryptography and Complexity of Group-Theoretic Problems
Anbieter: Revaluation Books, Exeter, Vereinigtes Königreich
Verkäuferbewertung 5 von 5 Sternen
Hardcover. Zustand: Brand New. 413 pages. 10.25x7.25x1.00 inches. In Stock. Bestandsnummer des Verkäufers __0821853600
Neu kaufen
EUR 140,02
EUR 14,41 Versand
Versand von Vereinigtes Königreich nach USA
Versand von Vereinigtes Königreich nach USA
Anzahl: 2 verfügbar
Beispielbild für diese ISBN
Non-Commutative Cryptography and Complexity of Group-Theoretic Problems (Mathematical Surveys and Monographs)
Verlag:
American Mathematical Society, 2011
ISBN 10: 0821853600
ISBN 13: 9780821853603
Neu
Hardcover
Anbieter: Kennys Bookstore, Olney, MD, USA
Verkäuferbewertung 4 von 5 Sternen
Zustand: New. Series: Mathematical Surveys and Monographs. Num Pages: 413 pages, Illustrations. BIC Classification: PBW; URD. Category: (P) Professional & Vocational. Dimension: 254 x 178 x 0. . . 2011. Hardcover. . . . . Books ship from the US and Ireland. Bestandsnummer des Verkäufers V9780821853603
Neu kaufen
EUR 151,56
EUR 8,99 Versand
Versand innerhalb von USA
Versand innerhalb von USA
Anzahl: 1 verfügbar
Foto des Verkäufers
Non-commutative Cryptography and Complexity of Group-theoretic Problems
Verlag:
American Mathematical Society, US, 2011
ISBN 10: 0821853600
ISBN 13: 9780821853603
Neu
Hardcover
Anbieter: Rarewaves.com UK, London, Vereinigtes Königreich
Verkäuferbewertung 5 von 5 Sternen
Hardback. Zustand: New. 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. Bestandsnummer des Verkäufers LU-9780821853603
Neu kaufen
EUR 162,87
EUR 74,92 Versand
Versand von Vereinigtes Königreich nach USA
Versand von Vereinigtes Königreich nach USA
Anzahl: 1 verfügbar
Foto des Verkäufers
Non-commutative Cryptography and Complexity of Group-theoretic Problems
Verlag:
American Mathematical Society, US, 2011
ISBN 10: 0821853600
ISBN 13: 9780821853603
Neu
Hardcover
Anbieter: Rarewaves.com USA, London, LONDO, Vereinigtes Königreich
Verkäuferbewertung 5 von 5 Sternen
Hardback. Zustand: New. 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. Bestandsnummer des Verkäufers LU-9780821853603
Neu kaufen
EUR 171,75
Versand gratis
Versand von Vereinigtes Königreich nach USA
Versand von Vereinigtes Königreich nach USA
Anzahl: 1 verfügbar