1 option
Non-commutative cryptography and complexity of group-theoretic problems / Alexei Myasnikov, Vladimir Shpilrain, Alexander Ushakov ; with an appendix by Natalia Mosina.
Math/Physics/Astronomy Library QA182.5 .M934 2011
Available
- Format:
- Book
- Author/Creator:
- Myasnikov, Alexei G., 1955-
- Series:
- Mathematical surveys and monographs ; no. 177.
- Mathematical surveys and monographs ; v. 177
- Language:
- English
- Subjects (All):
- Combinatorial group theory.
- Cryptography.
- Computer algorithms.
- Number theory.
- Physical Description:
- xiv, 385 pages : illustrations ; 26 cm.
- Place of Publication:
- Providence, R.I. : American Mathematical Society, [2011]
- Summary:
- Myasnikov (City College of New York) et al. apply the complexity of non-commutative groups to public key cryptography, assess the generic-case performance of various algorithms, and explore the asymptotically dominant properties of infinite groups used in public key cryptography. The second half of the book develops algorithms for word search and conjugacy search problems, a decision algorithm for the work problem in free solvable groups, and a polynomial time algorithm based on a straight line program. An appendix links probability theory and cryptanalysis. Annotation ©2012 Book News, Inc., Portland, OR (booknews.com)
- Notes:
- Includes bibliographical references and index.
- ISBN:
- 0821853600
- 9780821853603
- OCLC:
- 732847858
The Penn Libraries is committed to describing library materials using current, accurate, and responsible language. If you discover outdated or inaccurate language, please fill out this feedback form to report it and suggest alternative language.