Ulteriori informazioni
A Classical Introduction to Cryptography: Applications for Communications Security introduces fundamentals of information and communication security by providing appropriate mathematical concepts to prove or break the security of cryptographic schemes.
This advanced-level textbook covers conventional cryptographic primitives and cryptanalysis of these primitives; basic algebra and number theory for cryptologists; public key cryptography and cryptanalysis of these schemes; and other cryptographic protocols, e.g. secret sharing, zero-knowledge proofs and undeniable signature schemes.
A Classical Introduction to Cryptography: Applications for Communications Security is designed for upper-level undergraduate and graduate-level students in computer science. This book is also suitable for researchers and practitioners in industry. A separate exercise/solution booklet is available as well, please go to www.springeronline.com under author: Vaudenay for additional details on how to purchase this booklet.
Sommario
Prehistory of Cryptography.- Conventional Cryptography.- Dedicated Conventional Cryptographic Primitives.- ?Conventional Security Analysis.- Security Protocols with Conventional Cryptography.- Algorithmic Algebra.- Algorithmic Number Theory.- ?Elements of Complexity Theory.- Public-Key Cryptography.- Digital Signature.- ?Cryptographic Protocols.- From Cryptography to Communication Security.
Riassunto
This book introduces the fundamentals of information and communication security by providing appropriate mathematical concepts to prove or break the security of cryptographic schemes. It covers conventional cryptographic primitives and cryptanalysis of these primitives; basic algebra and number theory for cryptologists; public key cryptography and cryptanalysis of these schemes; and other cryptographic protocols, e.g. secret sharing, zero-knowledge proofs and undeniable signature schemes.
A Classical Introduction to Cryptography: Applications for Communications Security
is rich with algorithms, such as exhaustive search with time/memory tradeoffs; proofs, such as security proofs for DSA-like signature schemes; and classical attacks such as collision attacks on MD4. Hard-to-find standards, e.g. SSH2 and security in Bluetooth, are also included.
Testo aggiuntivo
From the reviews:
"This impressive hardback introduces fundamentals of information and communications security by providing mathematical concepts to prove or break the security of cryptographic schemes. … The book is designed for upper-level undergraduates and graduate level students in computer science. This comprehensive volume is also suitable for researchers and practitioners in industry." (Cryptologia, Vol. 30, 2006)
"This book presents, using a chronological order, both conventional cryptography and public-key cryptography, as well as the two sides of cryptanalysis: adversary modelling and proof reduction. … This advanced-level textbook is recommended for those interested in cryptography and its applications: students, researchers, computer scientists, mathematicians, engineers, and practitioners in industry." (Michael M. Dediu, Mathematical Reviews, Issue 2007 b)
Relazione
From the reviews:
"This impressive hardback introduces fundamentals of information and communications security by providing mathematical concepts to prove or break the security of cryptographic schemes. ... The book is designed for upper-level undergraduates and graduate level students in computer science. This comprehensive volume is also suitable for researchers and practitioners in industry." (Cryptologia, Vol. 30, 2006)
"This book presents, using a chronological order, both conventional cryptography and public-key cryptography, as well as the two sides of cryptanalysis: adversary modelling and proof reduction. ... This advanced-level textbook is recommended for those interested in cryptography and its applications: students, researchers, computer scientists, mathematicians, engineers, and practitioners in industry." (Michael M. Dediu, Mathematical Reviews, Issue 2007 b)
