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)
Die Inhaltsangabe kann sich auf eine andere Ausgabe dieses Titels beziehen.
Anbieter: PBShop.store UK, Fairford, GLOS, Vereinigtes Königreich
HRD. Zustand: New. New Book. Shipped from UK. Established seller since 2000. Artikel-Nr. FW-9780821853603
Anzahl: 2 verfügbar
Anbieter: Revaluation Books, Exeter, Vereinigtes Königreich
Hardcover. Zustand: Brand New. 413 pages. 10.25x7.25x1.00 inches. In Stock. Artikel-Nr. __0821853600
Anzahl: 2 verfügbar
Anbieter: Kennys Bookstore, Olney, MD, USA
Zustand: New. Series: Mathematical Surveys and Monographs. Num Pages: 413 pages, Illustrations. BIC Classification: PBW; URD. Category: (P) Professional & Vocational. Dimension: 254 x 178 x 0. . . 2011. Hardcover. . . . . Books ship from the US and Ireland. Artikel-Nr. V9780821853603
Anzahl: 1 verfügbar