Covering relations between three different areas of mathematics and theoretical computer science, this book explores how non-commutative (infinite) groups, which are typically studied in combinatorial group theory, can be used in public key cryptography.
Cuprins
Background on Groups, Complexity, and Cryptography.- Background on Public Key Cryptography.- Background on Combinatorial Group Theory.- Background on Computational Complexity.- Non-commutative Cryptography.- Canonical Non-commutative Cryptography.- Platform Groups.- Using Decision Problems in Public Key Cryptography.- Generic Complexity and Cryptanalysis.- Distributional Problems and the Average-Case Complexity.- Generic Case Complexity.- Generic Complexity of NP-complete Problems.- Asymptotically Dominant Properties and Cryptanalysis.- Asymptotically Dominant Properties.- Length-Based and Quotient Attacks.Cumpărați această carte electronică și primiți încă 1 GRATUIT!
Limba Engleză ● Format PDF ● Pagini 183 ● ISBN 9783764388270 ● Editura Springer Basel ● Oraș Basel ● Țară CH ● Publicat 2008 ● Descărcabil 24 luni ● Valută EUR ● ID 4458315 ● Protecție împotriva copiilor Adobe DRM
Necesită un cititor de ebook capabil de DRM