Non-commutative cryptography and complexity of group-theoretic problems /

Weitere Versionen (2)
Gespeichert in:
Weitere Titel:
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
1. Verfasser:
Myasnikov, Alexei G.
Weitere Verfasser:
Shpilrain, Vladimir, Ushakov, Alexander
Format:
Elektronisch E-Book
Sprache:
Englisch
Veröffentlicht:
Providence, R.I. : American Mathematical Society, c2011.
Umfang:
1 online resource (xiv, 385 p. : ill.)
Mode of access : World Wide Web
Format Details:
Mode of access : World Wide Web
Bibliografie:
Includes bibliographical references and index.
Sekundärform:
Publikations­art: Electronic reproduction.
Verlag: Providence, Rhode Island :: American Mathematical Society.
Publikations­datum: 2012
ISBN:
9781470414047 (online)
ISSN:
2331-7159 ;
0076-5376
DOI:
http://dx.doi.org/10.1090/surv/177
Zugangseinschränkungen:
Access is restricted to licensed institutions
Schlagworte:
Combinatorial group theory.
Cryptography.
Computer algorithms.
Number theory.
Bezugswerke:
Links: