9780821853603 - non-commutative cryptography and complexity of group-theoretic problems di myasnikov, alexei; shpilrain, vladimir; ushakov, alexander (9 risultati)
- Rilegato
Da: Kennys Bookshop and Art Galleries Ltd., Galway, GY, IrlandaKennys Bookshop and Art Galleries Ltd.
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 117,64
EUR 9,50 spedizioneSpedito da Irlanda a U.S.A.Quantità: 1 disponibili
Condizione: 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. . . . .
- Rilegato
Da: PBShop.store UK, Fairford, GLOS, Regno UnitoPBShop.store UK
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 139,44
EUR 6,86 spedizioneSpedito da Regno Unito a U.S.A.Quantità: 1 disponibili
HRD. Condizione: New. New Book. Shipped from UK. Established seller since 2000.
- Rilegato
Da: Rarewaves.com USA, London, LONDO, Regno UnitoRarewaves.com USA
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 151,44
Spedizione gratuitaSpedito da Regno Unito a U.S.A.Quantità: 1 disponibili
Hardback. 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 publi…c 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.
- Rilegato
Da: Revaluation Books, Exeter, Regno UnitoRevaluation Books
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 135,85
EUR 14,61 spedizioneSpedito da Regno Unito a U.S.A.Quantità: 2 disponibili
Hardcover. Condizione: Brand New. 413 pages. 10.25x7.25x1.00 inches. In Stock.
- Rilegato
Da: Kennys Bookstore, Olney, MD, U.S.A.Kennys Bookstore
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 146,53
EUR 9,07 spedizioneSpedito in U.S.A.Quantità: 1 disponibili
Condizione: 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.
- Rilegato
Da: THE SAINT BOOKSTORE, Southport, Regno UnitoTHE SAINT BOOKSTORE
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 150,35
EUR 23,00 spedizioneSpedito da Regno Unito a U.S.A.Quantità: 1 disponibili
Hardback. Condizione: New. New copy - Usually dispatched within 4 working days.
- Rilegato
Da: Ria Christie Collections, Uxbridge, Regno UnitoRia Christie Collections
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 175,17
EUR 14,00 spedizioneSpedito da Regno Unito a U.S.A.Quantità: 2 disponibili
Condizione: New. In English.
- Rilegato
Da: BUCHSERVICE / ANTIQUARIAT Lars Lutzer, Wahlstedt, GermaniaBUCHSERVICE / ANTIQUARIAT Lars Lutzer
Contatta il venditoreVenditore con 5 stelleCondizione: Usato - Molto buono
EUR 179,90
EUR 39,95 spedizioneSpedito da Germania a U.S.A.Quantità: 1 disponibili
Condizione: gut. 2011. Non-Commutative Cryptography and Complexity of Group-Theoretic Problems (Mathematical Surveys and Monographs, 177, Band 177) In englischer Sprache. pages.
- Rilegato
Da: Rarewaves.com UK, London, Regno UnitoRarewaves.com UK
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 147,94
EUR 75,96 spedizioneSpedito da Regno Unito a U.S.A.Quantità: 1 disponibili
Hardback. 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 publi…c 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.
