Non-commutative cryptography and complexity of group-theoretic problems / Myasnikov, Alexei G.
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 pu...
Saved in:
| Online Access: |
Full Text (via EBSCO) |
|---|---|
| Main Author: | |
| Other Authors: | , |
| Format: | eBook |
| Language: | English |
| Published: |
[Place of publication not identified] :
American Mathematical Society,
2011.
|
| Series: | Mathematical surveys and monographs ;
no. 177. |
| Subjects: |
Table of Contents:
- Introduction 1. Background on public key cryptography 2. Background on combinatorial group theory 3. Background on computational complexity 4. Canonical non-commutative cryptography 5. Platform groups 6. More protocols 7. Using decision problems in public key cryptography 8. Authentication 9. Distributional problems and the average case complexity 10. Generic case complexity 11. Generic complexity of NP-complete problems 12. Generic complexity of undecidable problems 13. Strongly, super, and absolutely undecidable problems 14. Asymptotically dominant properties 15. Length based and quotient attacks 16. Word search problem 17. Conjugacy search problem 18. Free solvable groups 19. Compressed words Appendix A. Probabilistic group-based cryptanalysis.