This book offers a mathematical foundation for modern cryptography.
It is primarily intended as an introduction for graduate students.
Readers should have basic knowledge of probability theory, but
familiarity with computational complexity is not required. Starting
from Shannon's classic result on secret key cryptography,
fundamental topics of cryptography, such as secret key agreement,
authentication, secret sharing, and secure computation, are
covered. Particular attention is drawn to how correlated randomness
can be used to construct cryptographic primitives. To evaluate the
efficiency of such constructions, information-theoretic tools, such
as smooth min/max entropies and information spectrum, are
developed. The broad coverage means the book will also be useful to
experts as well as students in cryptography as a reference for
information-theoretic concepts and tools.
General
Is the information for this product incomplete, wrong or inappropriate?
Let us know about it.
Does this product have an incorrect or missing image?
Send us a new image.
Is this product missing categories?
Add more categories.
Review This Product
No reviews yet - be the first to create one!