Order Total (1 Item Items):
Shipping Destination:
Non Commutative Cryptography Complexity Group Theoretic by Myasnikov Alexei (15 results)
Feedback
Skip to main search results
Search filters
Product Type
- All Product Types
- Books (15)
- Magazines & Periodicals (No further results match this refinement)
- Comics (No further results match this refinement)
- Sheet Music (No further results match this refinement)
- Art, Prints & Posters (No further results match this refinement)
- Photographs (No further results match this refinement)
- Maps (No further results match this refinement)
- Manuscripts & Paper Collectibles (No further results match this refinement)
Condition
Binding
- All Bindings
- Hardcover (15)
- Softcover (No further results match this refinement)
Collectible Attributes
- First Edition (No further results match this refinement)
- Signed (No further results match this refinement)
- Dust Jacket (No further results match this refinement)
- Seller-Supplied Images (8)
- Not Print on Demand (15)
Language (1)
Price
- Any Price
- Under £ 20 (No further results match this refinement)
- £ 20 to £ 35 (No further results match this refinement)
- Over £ 35
Free Shipping
Seller Location
Seller Rating
-
Non-Commutative Cryptography and Complexity of Group-Theoretic Problems (Mathematical Surveys and Monographs)
Published by American Mathematical Society, 2011
ISBN 10: 0821853600 ISBN 13: 9780821853603
Language: English
Seller: Kennys Bookshop and Art Galleries Ltd., Galway, GY, Ireland
Seller rating 5 out of 5 stars
£ 105.18
Convert currency£ 2.59 shipping from Ireland to United KingdomQuantity: 1 available
Add to basketCondition: 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. . . . .
-
Non-Commutative Cryptography and Complexity of Group-Theoretic Problems
Published by Amer Mathematical Society, 2011
ISBN 10: 0821853600 ISBN 13: 9780821853603
Language: English
Hardcover. Condition: Brand New. 413 pages. 10.25x7.25x1.00 inches. In Stock.
-
Non-Commutative Cryptography and Complexity of Group-Theoretic Problems
Published by American Mathematical Society, 2011
ISBN 10: 0821853600 ISBN 13: 9780821853603
Language: English
Seller: GreatBookPricesUK, Woodford Green, United Kingdom
Seller rating 5 out of 5 stars
Condition: New.
-
Non-commutative Cryptography and Complexity of Group-theoretic Problems
Published by MP-AMM American Mathematical, 2011
ISBN 10: 0821853600 ISBN 13: 9780821853603
Language: English
Seller: PBShop.store UK, Fairford, GLOS, United Kingdom
Seller rating 5 out of 5 stars
HRD. Condition: New. New Book. Shipped from UK. Established seller since 2000.
-
Non-commutative Cryptography and Complexity of Group-theoretic Problems
Published by American Mathematical Society, 2011
ISBN 10: 0821853600 ISBN 13: 9780821853603
Language: English
Seller: THE SAINT BOOKSTORE, Southport, United Kingdom
Seller rating 5 out of 5 stars
Hardback. Condition: New. New copy - Usually dispatched within 4 working days. 893.
-
Non-Commutative Cryptography and Complexity of Group-Theoretic Problems (Mathematical Surveys and Monographs)
Published by American Mathematical Society, 2011
ISBN 10: 0821853600 ISBN 13: 9780821853603
Language: English
£ 127.85
Convert currency£ 2.22 shipping from U.S.A. to United KingdomQuantity: 1 available
Add to basketCondition: 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.
-
Non-Commutative Cryptography and Complexity of Group-Theoretic Problems
Published by American Mathematical Society, 2011
ISBN 10: 0821853600 ISBN 13: 9780821853603
Language: English
£ 115.71
Convert currency£ 14.78 shipping from U.S.A. to United KingdomQuantity: 3 available
Add to basketCondition: New.
-
Non-Commutative Cryptography and Complexity of Group-Theoretic Problems
Published by American Mathematical Society, 2011
ISBN 10: 0821853600 ISBN 13: 9780821853603
Language: English
Seller: GreatBookPricesUK, Woodford Green, United Kingdom
Seller rating 5 out of 5 stars
Condition: As New. Unread book in perfect condition.
-
Non-commutative Cryptography and Complexity of Group-theoretic Problems
Published by American Mathematical Society, 2011
ISBN 10: 0821853600 ISBN 13: 9780821853603
Language: English
£ 110.99
Convert currency£ 21.60 shipping from Germany to United KingdomQuantity: 3 available
Add to basketCondition: New. 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.
-
Non-commutative Cryptography and Complexity of Group-theoretic Problems
Published by American Mathematical Society, 2011
ISBN 10: 0821853600 ISBN 13: 9780821853603
Language: English
Condition: New. pp. 385.
-
Non-commutative Cryptography and Complexity of Group-theoretic Problems
Published by American Mathematical Society, US, 2011
ISBN 10: 0821853600 ISBN 13: 9780821853603
Language: English
Hardback. Condition: 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.
-
Non-commutative Cryptography and Complexity of Group-theoretic Problems
Published by American Mathematical Society Dez 2011, 2011
ISBN 10: 0821853600 ISBN 13: 9780821853603
Language: English
£ 128.79
Convert currency£ 12.09 shipping from Germany to United KingdomQuantity: 2 available
Add to basketBuch. Condition: Neu. Neuware - Examines 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 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.
-
Non-Commutative Cryptography and Complexity of Group-Theoretic Problems
Published by American Mathematical Society, 2011
ISBN 10: 0821853600 ISBN 13: 9780821853603
Language: English
£ 133.42
Convert currency£ 14.78 shipping from U.S.A. to United KingdomQuantity: 3 available
Add to basketCondition: As New. Unread book in perfect condition.
-
Non-commutative Cryptography and Complexity of Group-theoretic Problems
Published by American Mathematical Society, 2011
ISBN 10: 0821853600 ISBN 13: 9780821853603
Language: English
£ 142.67
Convert currency£ 6.65 shipping from U.S.A. to United KingdomQuantity: 3 available
Add to basketCondition: New. pp. 385.
-
Non-commutative Cryptography and Complexity of Group-theoretic Problems
Published by American Mathematical Society, US, 2011
ISBN 10: 0821853600 ISBN 13: 9780821853603
Language: English
Seller: Rarewaves.com USA, London, LONDO, United Kingdom
Seller rating 4 out of 5 stars
Hardback. Condition: 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.
