عنوان
پدید آورنده
موضوع
رده
QA182.5 .M934 2011
QA182
.
5
.
M934
2011
کتابخانه
محل استقرار
0821853600 (alk. paper)
9780821853603 (alk. paper)
b416401
Non-commutative cryptography and complexity of group-theoretic problems /
[Book]
Alexei Myasnikov, Vladimir Shpilrain, Alexander Ushakov ; with an appendix by Natalia Mosina
Providence, R.I. :
American Mathematical Society,
c2011
xiv, 385 p. :
ill. ;
26 cm
Mathematical surveys and monographs ;
v. 177
Includes bibliographical references and index
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)
Combinatorial group theory
Computer algorithms
Cryptography
Number theory
005
.
8/2
23
QA182
.
5
.
M934
2011
Myasnikov, Alexei G.,1955-
Shpilrain, Vladimir,1960-
Ushakov, Alexander
20111130010329.0
مطالعه متن کتاب [Book]
Y
