Condizione: New. pp. 204.
EUR 15,85
Quantità: 4 disponibili
Aggiungi al carrelloCondizione: New. pp. 204 Illus.
EUR 17,10
Quantità: 4 disponibili
Aggiungi al carrelloCondizione: New. pp. 204.
EUR 34,07
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New.
Da: ALLBOOKS1, Direk, SA, Australia
EUR 36,42
Quantità: 8 disponibili
Aggiungi al carrelloBrand new book. Fast ship. Please provide full street address as we are not able to ship to P O box address.
EUR 38,18
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: As New. Unread book in perfect condition.
Da: Lucky's Textbooks, Dallas, TX, U.S.A.
EUR 48,13
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New.
EUR 36,87
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New.
EUR 40,92
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: As New. Unread book in perfect condition.
EUR 72,62
Quantità: 2 disponibili
Aggiungi al carrelloPaperback. Condizione: Brand New. 1st edition. 183 pages. 9.25x6.50x0.50 inches. In Stock.
Da: Revaluation Books, Exeter, Regno Unito
EUR 138,99
Quantità: 2 disponibili
Aggiungi al carrelloHardcover. Condizione: Brand New. 413 pages. 10.25x7.25x1.00 inches. In Stock.
Editore: American Mathematical Society, US, 2011
ISBN 10: 0821853600 ISBN 13: 9780821853603
Lingua: Inglese
Da: Rarewaves.com USA, London, LONDO, Regno Unito
EUR 171,35
Quantità: 1 disponibili
Aggiungi al carrelloHardback. Condizione: 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.
Editore: American Mathematical Society, US, 2011
ISBN 10: 0821853600 ISBN 13: 9780821853603
Lingua: Inglese
Da: Rarewaves.com UK, London, Regno Unito
EUR 161,67
Quantità: 1 disponibili
Aggiungi al carrelloHardback. Condizione: 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.
Da: moluna, Greven, Germania
EUR 30,11
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Increased interest in applications of combinatorial group theory to cryptographyFirst monograph exploring the area of non-commutative cryptography Employing decision problems (as opposed to search problems) in public key cryptography allow.