登入選單
返回Google圖書搜尋
Non-commutative Cryptography and Complexity of Group-theoretic Problems
Alexei G. MyasnikovVladimir ShpilrainAlexander Ushakov
出版American Mathematical Soc., 2011
主題Computers / Programming / AlgorithmsComputers / Security / GeneralLanguage Arts & Disciplines / Communication StudiesMathematics / Geometry / AlgebraicMathematics / Number TheoryMathematics / Combinatorics
ISBN08218536009780821853603
URLhttp://books.google.com.hk/books?id=USCCAwAAQBAJ&hl=&source=gbs_api
EBookSAMPLE
註釋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).