---

＜E-Book＞
Non-commutative cryptography and complexity of group-theoretic problems / Alexei Myasnikov, Vladimir Shpilrain, Alexander Ushakov ; with an appendix by Natalia Mosina
(Mathematical surveys and monographs ; no. 177)

Publisher	Providence, R.I : American Mathematical Society
Year	c2011
Size	1 online resource (xiv, 385 p. : ill.)
Authors	*Myasnikov, Alexei G. 1955- Shpilrain, Vladimir 1960- Ushakov, Alexander
Subjects	LCSH:Combinatorial group theory LCSH:Cryptography LCSH:Computer algorithms LCSH:Number theory
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
Notes	Includes bibliographical references and index Access is restricted to licensed institutions Electronic reproduction Providence, Rhode Island American Mathematical Society 2012 Mode of access : World Wide Web Description based on print version record HTTP:URL=http://www.ams.org/surv/177 Information=Contents HTTP:URL=https://doi.org/10.1090/surv/177 Information=Contents

 Similar Items