Articoli correlati a Non-Commutative Cryptography and Complexity of Group-Theoret...
Sinossi
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)
Le informazioni nella sezione "Riassunto" possono far riferimento a edizioni diverse di questo titolo.
Compra nuovo
Visualizza questo articolo
EUR 117,50
EUR 2,00 per la spedizione da Irlanda a Italia
Destinazione, tempi e costiRisultati della ricerca per Non-Commutative Cryptography and Complexity of Group-Theoret...
Foto dell'editore
Non-Commutative Cryptography and Complexity of Group-Theoretic Problems (Mathematical Surveys and Monographs)
Editore:
American Mathematical Society, 2011
ISBN 10: 0821853600
ISBN 13: 9780821853603
Nuovo
Rilegato
Da: Kennys Bookshop and Art Galleries Ltd., Galway, GY, Irlanda
Valutazione del venditore 5 su 5 stelle
Condizione: 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. . . . . Codice articolo V9780821853603
Quantità: 1 disponibili
Foto dell'editore
Non-Commutative Cryptography and Complexity of Group-Theoretic Problems
Da: Revaluation Books, Exeter, Regno Unito
Valutazione del venditore 5 su 5 stelle
Hardcover. Condizione: Brand New. 413 pages. 10.25x7.25x1.00 inches. In Stock. Codice articolo __0821853600
Quantità: 2 disponibili
Immagini fornite dal venditore
Non-commutative Cryptography and Complexity of Group-theoretic Problems
Editore:
American Mathematical Society, 2011
ISBN 10: 0821853600
ISBN 13: 9780821853603
Nuovo
Rilegato
Da: moluna, Greven, Germania
Valutazione del venditore 5 su 5 stelle
Condizione: New. KlappentextrnrnExamines the relationship between three different areas of mathematics and theoretical computer science: combinatorial group theory, cryptography, and complexity theory. It explores how non-commutative (infinite) groups can be use. Codice articolo 767993787
Quantità: 3 disponibili
Foto dell'editore
Non-commutative Cryptography and Complexity of Group-theoretic Problems
Editore:
MP-AMM American Mathematical, 2011
ISBN 10: 0821853600
ISBN 13: 9780821853603
Nuovo
Rilegato
Da: PBShop.store UK, Fairford, GLOS, Regno Unito
Valutazione del venditore 5 su 5 stelle
HRD. Condizione: New. New Book. Shipped from UK. Established seller since 2000. Codice articolo FW-9780821853603
Quantità: 3 disponibili
Foto dell'editore
Non-Commutative Cryptography and Complexity of Group-Theoretic Problems (Mathematical Surveys and Monographs)
Editore:
American Mathematical Society, 2011
ISBN 10: 0821853600
ISBN 13: 9780821853603
Nuovo
Rilegato
Da: Kennys Bookstore, Olney, MD, U.S.A.
Valutazione del venditore 5 su 5 stelle
Condizione: 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. Codice articolo V9780821853603
Quantità: 1 disponibili
Immagini fornite dal venditore
Non-Commutative Cryptography and Complexity of Group-Theoretic Problems
Editore:
American Mathematical Society, 2011
ISBN 10: 0821853600
ISBN 13: 9780821853603
Nuovo
Rilegato
Da: GreatBookPricesUK, Woodford Green, Regno Unito
Valutazione del venditore 5 su 5 stelle
Condizione: New. Codice articolo 14292133-n
Quantità: 3 disponibili
Immagini fornite dal venditore
Non-Commutative Cryptography and Complexity of Group-Theoretic Problems
Editore:
American Mathematical Society, 2011
ISBN 10: 0821853600
ISBN 13: 9780821853603
Nuovo
Rilegato
Da: GreatBookPrices, Columbia, MD, U.S.A.
Valutazione del venditore 5 su 5 stelle
Condizione: New. Codice articolo 14292133-n
Quantità: 3 disponibili
Foto dell'editore
Non-commutative Cryptography and Complexity of Group-theoretic Problems
Editore:
American Mathematical Society, 2011
ISBN 10: 0821853600
ISBN 13: 9780821853603
Nuovo
Rilegato
Da: THE SAINT BOOKSTORE, Southport, Regno Unito
Valutazione del venditore 5 su 5 stelle
Hardback. Condizione: New. New copy - Usually dispatched within 4 working days. 893. Codice articolo B9780821853603
Quantità: 3 disponibili
Foto dell'editore
Non-commutative Cryptography and Complexity of Group-theoretic Problems
Editore:
American Mathematical Society, 2011
ISBN 10: 0821853600
ISBN 13: 9780821853603
Nuovo
Rilegato
Da: Majestic Books, Hounslow, Regno Unito
Valutazione del venditore 5 su 5 stelle
Condizione: New. pp. 385. Codice articolo 3570050
Quantità: 3 disponibili
Immagini fornite dal venditore
Non-commutative Cryptography and Complexity of Group-theoretic Problems
Editore:
American Mathematical Society, US, 2011
ISBN 10: 0821853600
ISBN 13: 9780821853603
Nuovo
Rilegato
Da: Rarewaves.com UK, London, Regno Unito
Valutazione del venditore 5 su 5 stelle
Hardback. Condizione: New. This book is about relations between three different areas of mathematics and theoretical computer science: combinatorial group theory, cryptography, and complexity theory. It explores how non-commutative (infinite) groups, which are typically studied in combinatorial group theory, can be used in public key cryptography. It also shows that there is remarkable feedback from cryptography to combinatorial group theory because some of the problems motivated by cryptography appear to be new to group theory, and they open many interesting research avenues within group theory. In particular, a lot of emphasis in the book is put on studying search problems, as compared to decision problems traditionally studied in combinatorial group theory. Then, complexity theory, notably generic-case complexity of algorithms, is employed for cryptanalysis of various cryptographic protocols based on infinite groups, and the ideas and machinery from the theory of generic-case complexity are used to study asymptotically dominant properties of some infinite groups that have been applied in public key cryptography so far. This book also describes new interesting developments in the algorithmic theory of solvable groups and another spectacular new development related to complexity of group-theoretic problems, which is based on the ideas of compressed words and straight-line programs coming from computer science. Codice articolo LU-9780821853603
Quantità: 2 disponibili