Group-based Cryptography
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...
Guardat en:
| Autors principals: | , , , |
|---|---|
| Format: | Livre numérique |
| Idioma: | Anglais |
| Publicat: |
Basel :
Birkhäuser Basel
[20..].
Cham : Springer Nature |
| Edició: | 1st ed. 2008. |
| Col·lecció: | Advanced Courses in Mathematics / CRM Barcelona
|
| Matèries: | |
| Accés en línia: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Nota: |
L'impression du document génère 191 p. Archives Springer e-books (Licence nationale) Archives Springer e-books (Licence nationale) |
| Autres localisations: | Voir dans le Sudoc |
| Edition sous un autre format: | • Group-based cryptography, Alexei Myasnikov, Vladimir Shpilrain, Alexander Ushakov, Basel, Birkhäuser, Springer [distributor], 2008, 1 vol. (XV-183 p.), Advanced courses in mathematics - CRM Barcelona, 978-3-7643-8826-3 • Group-based Cryptography, Texte imprimé, 9783764398477 • Group-based cryptography, Alexei Myasnikov, Vladimir Shpilrain, Alexander Ushakov, Basel, Birkhäuser, Springer [distributor], 2008, 1 vol. (XV-183 p.), Advanced courses in mathematics - CRM Barcelona, 978-3-7643-8826-3 |
| Sumari: | 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 |
|---|---|
| Descripció de l’ítem: | L'impression du document génère 191 p. Archives Springer e-books (Licence nationale) Archives Springer e-books (Licence nationale) |
| Bibliografia: | Bibliogr. Index |
| ISBN: | 9783764388270 |
| ISSN: | 2297-0312 |
| Accés: | Accès en ligne pour les établissements français bénéficiaires des licences nationales Accès soumis à abonnement pour tout autre établissement Conditions particulières de réutilisation pour les bénéficiaires des licences nationales. https://www.licencesnationales.fr/springer-nature-ebooks-contrat-licence-ln-2017 |