Covering relations between three different areas of mathematics and theoretical computer science, this book explores how non-commutative (infinite) groups, which are typically studied in combinatorial group theory, can be used in public key cryptography. Series: Advanced Courses in Mathematics - CRM Barcelona. Num Pages: 198 pages, biography. BIC Classification: PB. Category: (P) Professional & Vocational; (UP) Postgraduate, Research & Scholarly; (UU) Undergraduate. Dimension: 242 x 172 x 17. Weight in Grams: 494. . 2008. Paperback. . . . . Books ship from the US and Ireland.

Seller Inventory # V9783764388263

Contact seller

Report this item

Bibliographic Details

Title: Group-Based Cryptography
Publisher: Birkhauser Verlag AG
Publication Date: 2008
Language: English
ISBN 10: 3764388269
ISBN 13: 9783764388263
Binding: Soft cover
Condition: New

About this title

Synopsis

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.

From the Back Cover

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.

"About this title" may belong to another edition of this title.

Store Description

We carry a comprehensive range of out of print and rare books.

Visit Seller's Storefront

Seller's business information

Kennys Bookshops and Art Galleries Limited
Liosban Industrial Estate, Tuam Road, Galway, GY, Ireland

Sale & Shipping Terms

Terms of Sale

We guarantee the condition of every book as it's described on the Abebooks websites.

If you're dissatisfied with your purchase (Incorrect Book/Not as Described/Damaged) or if the order hasn't arrived, you're eligible for a refund within 30 days of the estimated delivery date.

For any queries please use the contact seller link or send an email to books@kennys.ie

Conor Kenny

Right of cancellation

Shipping Terms

All books securely packaged. Some books ship from Ireland.

Shipping rates within U.S.A.

Shipping rates within U.S.A.
Order quantity	14 to 20 business days	13 to 14 business days
First item	� 7.91	� 15.82

Delivery times are set by sellers and vary by carrier and location. Orders passing through Customs may face delays and buyers are responsible for any associated duties or fees. Sellers may contact you regarding additional charges to cover any increased costs to ship your items.