Condition: New. pp. 204.
US$ 16.62
Convert currencyQuantity: 4 available
Add to basketCondition: New. pp. 204 Illus.
Seller: Romtrade Corp., STERLING HEIGHTS, MI, U.S.A.
Condition: New. This is a Brand-new US Edition. This Item may be shipped from US or any other country as we have multiple locations worldwide.
US$ 20.02
Convert currencyQuantity: 4 available
Add to basketCondition: New. pp. 204.
US$ 44.20
Convert currencyQuantity: Over 20 available
Add to basketCondition: As New. Unread book in perfect condition.
US$ 55.67
Convert currencyQuantity: Over 20 available
Add to basketCondition: New.
Seller: Lucky's Textbooks, Dallas, TX, U.S.A.
US$ 54.33
Convert currencyQuantity: Over 20 available
Add to basketCondition: New.
Seller: Ria Christie Collections, Uxbridge, United Kingdom
US$ 45.13
Convert currencyQuantity: Over 20 available
Add to basketCondition: New. In.
US$ 45.11
Convert currencyQuantity: Over 20 available
Add to basketCondition: New.
US$ 48.77
Convert currencyQuantity: Over 20 available
Add to basketCondition: As New. Unread book in perfect condition.
US$ 38.95
Convert currencyQuantity: 1 available
Add to basketTaschenbuch. Condition: Neu. Druck 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.
US$ 84.07
Convert currencyQuantity: 2 available
Add to basketPaperback. Condition: Brand New. 1st edition. 183 pages. 9.25x6.50x0.50 inches. In Stock.
Published by Birkhäuser Basel, Springer Basel Jul 2008, 2008
ISBN 10: 3764388269 ISBN 13: 9783764388263
Language: English
Seller: buchversandmimpf2000, Emtmannsberg, BAYE, Germany
US$ 38.95
Convert currencyQuantity: 2 available
Add to basketTaschenbuch. Condition: Neu. Neuware -preparing the lecture notes.Springer Basel AG in Springer Science + Business Media, Heidelberger Platz 3, 14197 Berlin 204 pp. Englisch.
Published by Springer, Basel, Birkhäuser Basel, Birkhäuser Jul 2008, 2008
ISBN 10: 3764388269 ISBN 13: 9783764388263
Language: English
Seller: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germany
US$ 38.95
Convert currencyQuantity: 2 available
Add to basketTaschenbuch. Condition: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -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. 183 pp. Englisch.
Seller: moluna, Greven, Germany
US$ 36.59
Convert currencyQuantity: Over 20 available
Add to basketKartoniert / Broschiert. Condition: 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.