Modern Cryptography: Theory and Practice (Hardcover)
Wenbo Mao
- 出版商: Prentice Hall
- 出版日期: 2003-08-04
- 售價: $1,007
- 語言: 英文
- 頁數: 648
- 裝訂: Hardcover
- ISBN: 0130669431
- ISBN-13: 9780130669438
-
相關分類:
資訊安全
已絕版
買這商品的人也買了...
-
$1,121Applied Cryptography, 2/e
-
$680$537 -
$2,610$2,480 -
$980$774 -
$980$784 -
$590$466 -
$920$727 -
$1,670$1,587 -
$690$587 -
$490$441 -
$780$741 -
$590$466 -
$690$538 -
$720$569 -
$880$792 -
$1,270$1,207 -
$560$442 -
$820$804 -
$750$675 -
$560$504 -
$480$379 -
$2,690$2,556 -
$199Communication Skills Handbook (Paperback)
-
$390$332 -
$650$507
相關主題
商品描述
Appropriate for all graduate-level and advanced undergraduate courses in cryptography and related mathematical fields.
Modern Cryptography is an indispensable resource for every advanced student of cryptography who intends to implement strong security in real-world applications. Leading HP security expert Wenbo Mao explains why conventional crypto schemes, protocols, and systems are profoundly vulnerable, introducing both fundamental theory and real-world attacks. Next, he shows how to implement crypto systems that are truly “fit for application,” and formally demonstrate their fitness. He begins by reviewing the foundations of cryptography: probability, information theory, computational complexity, number theory, algebraic techniques, and more. He presents the “ideal” principles of authentication, comparing them with real-world implementation. Mao assesses the strength of IPSec, IKE, SSH, SSL, TLS, Kerberos, and other standards, and offers practical guidance on designing stronger crypto schemes and using formal methods to prove their security and efficiency. Finally, he presents an in-depth introduction to zero-knowledge protocols: their characteristics, development, arguments, and proofs. Mao relies on practical examples throughout, and provides all the mathematical background students will need.
Table of Contents
A Short Description of the Book.
Preface.
List of
Figures.
List of Algorithms, Protocols and Attacks.
I. INTRODUCTION.
II MATHEMATICAL FOUNDATIONS.
3. Probability and Information Theory. Introduction. Basic
Concept of Probability. Properties. Basic Calculation. Random Variables and
their Probability Distributions. Birthday Paradox. Information Theory.
Redundancy in Natural Languages. Chapter Summary. Exercises.
4. Computational Complexity. Introduction. Turing Machines. Deterministic Polynomial Time. Probabilistic Polynomial Time. Non-deterministic Polynomial Time. Non-Polynomial Bounds. Polynomial-time Indistinguishability. Theory of Computational Complexity and Modern Cryptography. Chapter Summary. Exercises. 5. Algebraic Foundations. Introduction. Groups. Rings and Fields. The Structure of Finite Fields. Group Constructed Using Points on an Elliptic Curve. Chapter Summary. Exercises. 6. Number Theory. Introduction. Congruences and Residue Classes. Euler's Phi Function. The Theorems of Fermat, Euler and Lagrange. Quadratic Residues. Square Roots Modulo Integer. Blum Integers. Chapter Summary. Exercises.
III. BASIC CRYPTOGRAPHIC TECHNIQUES.
IV. AUTHENTICATION.
V. FORMAL APPROACHES TO SECURITY ESTABLISHMENT.
VI. CRYPTOGRAPHIC PROTOCOLS.