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.
Le informazioni nella sezione "Riassunto" possono far riferimento a edizioni diverse di questo titolo.
From the reviews:
“The book at hand has the aim to introduce the reader into the rich world of group-based asymmetric encryption. ... The basics necessary for the understanding are given in introducing chapters. Many hints for further reading are given. So, the book might be useful for the beginner, who wants to get a clear introduction, as well as for the expert, who gets an elaborate survey as well as much stimulation for proceeding research.” (Michael Wüstner, Zentralblatt MATH, Vol. 1248, 2012)
Background on Groups, Complexity, and Cryptography.- Background on Public Key Cryptography.- Background on Combinatorial Group Theory.- Background on Computational Complexity.- Non-commutative Cryptography.- Canonical Non-commutative Cryptography.- Platform Groups.- Using Decision Problems in Public Key Cryptography.- Generic Complexity and Cryptanalysis.- Distributional Problems and the Average-Case Complexity.- Generic Case Complexity.- Generic Complexity of NP-complete Problems.- Asymptotically Dominant Properties and Cryptanalysis.- Asymptotically Dominant Properties.- Length-Based and Quotient Attacks.
Le informazioni nella sezione "Su questo libro" possono far riferimento a edizioni diverse di questo titolo.
EUR 2,33 per la spedizione in U.S.A.
Destinazione, tempi e costiEUR 3,52 per la spedizione in U.S.A.
Destinazione, tempi e costiDa: Books Puddle, New York, NY, U.S.A.
Condizione: New. pp. 204. Codice articolo 26345590
Quantità: 4 disponibili
Da: Majestic Books, Hounslow, Regno Unito
Condizione: New. pp. 204 Illus. Codice articolo 7535145
Quantità: 4 disponibili
Da: Biblios, Frankfurt am main, HESSE, Germania
Condizione: New. pp. 204. Codice articolo 18345596
Quantità: 4 disponibili
Da: Basi6 International, Irving, TX, U.S.A.
Condizione: Brand New. New. US edition. Expediting shipping for all USA and Europe orders excluding PO Box. Excellent Customer Service. Codice articolo ABEJUNE24-273605
Quantità: Più di 20 disponibili
Da: Romtrade Corp., STERLING HEIGHTS, MI, U.S.A.
Condizione: 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. Codice articolo ABNR-72079
Quantità: 5 disponibili
Da: GreatBookPrices, Columbia, MD, U.S.A.
Condizione: As New. Unread book in perfect condition. Codice articolo 5619512
Quantità: Più di 20 disponibili
Da: Lucky's Textbooks, Dallas, TX, U.S.A.
Condizione: New. Codice articolo ABLIING23Apr0316110059348
Quantità: Più di 20 disponibili
Da: GreatBookPrices, Columbia, MD, U.S.A.
Condizione: New. Codice articolo 5619512-n
Quantità: Più di 20 disponibili
Da: Ria Christie Collections, Uxbridge, Regno Unito
Condizione: New. In. Codice articolo ria9783764388263_new
Quantità: Più di 20 disponibili
Da: GreatBookPricesUK, Woodford Green, Regno Unito
Condizione: As New. Unread book in perfect condition. Codice articolo 5619512
Quantità: Più di 20 disponibili