现代密码学基础：第二版

需积分: 11 77 浏览量更新于2024-07-07 收藏 4.27MB PDF 举报

"Introduction to Modern Cryptography" by Jonathan Katz and Yehuda Lindell, Second Edition 《现代密码学导论》是 Jonathan Katz 和 Yehuda Lindell 合著的第二版图书，属于 Chapman & Hall/CRC 的《密码学与网络安全》系列。这本书深入介绍了密码学的基础知识和现代应用，旨在为读者提供一个全面而严谨的密码学理论框架。密码学是一门研究信息安全的科学，主要关注数据的加密和解密，以及如何确保通信的私密性、完整性和身份验证。在现代社会，密码学扮演着至关重要的角色，它不仅应用于传统的军事和政府领域，还在电子商务、网络安全、移动通信以及各种互联网服务中发挥着核心作用。本书涵盖了以下关键知识点： 1. 密码学基础：包括对称加密（如DES和AES）和非对称加密（如RSA和椭圆曲线密码学）的基本原理，以及它们的优缺点和应用场景。 2. 密钥管理：讨论如何安全地分发和存储密钥，这是任何加密系统中不可或缺的部分。 3. 数字签名和认证：解释了数字签名如何实现消息的不可否认性和身份验证，同时探讨了公钥基础设施（PKI）和证书权威机构（CA）的作用。 4. 密码协议设计：介绍如何设计安全的通信协议，例如SSL/TLS协议，用于保障网络通信的安全。 5. 密码分析：涵盖了密码系统的安全性评估方法，包括密码攻击策略和抵抗攻击的策略。 6. 随机性和伪随机性：讨论了在密码学中使用随机数的重要性，以及伪随机数生成器的设计和安全性。 7. 密码学中的安全性模型：介绍如何通过形式化的方法来分析和证明密码系统的安全性，例如安全模型和安全性定义。 8. 安全服务和密码学应用：涵盖如消息认证码（MAC）、哈希函数和零知识证明等安全服务，以及它们在实际问题中的应用。 9. 现代密码学前沿：讨论了量子计算对传统密码学的挑战，以及后量子密码学的发展。 10. 实现和性能：考虑了算法的效率和实际实现中的安全问题，如侧信道攻击和硬件加速。通过阅读本书，读者将能够理解密码学的基本概念，掌握现代密码学的核心技术，并具备评估和设计安全方案的能力。无论对于计算机科学专业的学生，还是从事信息安全和网络安全工作的专业人士，这都是一本不可或缺的参考书。

xviii

Notwithstanding the above, the book doe s use deﬁnitions, proofs, and ab-

stract mathematical concepts, and therefore requires some mathematical ma-

turity. In particular, the reader is assumed to have had some exposure to

proofs at the colleg e level, whether in an upper-level mathema tics course or a

course on discrete mathematics, algorithms, or co mputability theor y.

Suggestions for course organization. The core material of this book,

which we recommend should be covered in any intro ductory course on cryp-

tography, consists of the following (in all cases, starred sections are excluded;

more on this below):

• Introduction and Classical Cryptography: Chapters 1 and 2 discuss c las-

sical cryptography and set the stage fo r modern cryptography.

• Private-Key ( Symmetric) Cryptography: Chapter 3 on private-key en-

cryption, Chapter 4 o n message authentication, and Chapter 5 on hash

functions provide a thorough treatment of these topics.

We also highly recommend covering Section 6.2, which de als with block-

cipher design; in our experience students really enjoy this material, and

it makes the abstra ct ideas they have learned in previous chapters more

concrete. Although we do consider this core material, it is not used in

the res t of the book and so c an be safely skipped if desired.

• Public-Key (Asymmetric) Cryptography: Chapter 8 gives a self-contained

introduction to all the number theory ne eded for the remainder of the

book. The material in Chapter 9 is not used subsequently; however,

we do re commend at least cover ing Section 9.3 on recommended key

lengths. The public-key revolution is described in Chapter 10. Ideally,

all of Chapters 11 and 12 should be covered; those pressed for time can

pick and choose appropriately.

We are typically able to cover most of the above in a one-semester (35-hour)

undergraduate co urse (omitting some proofs and s kipping some topic s, as

needed) or, with some changes to a dd more material on theoretical founda-

tions, in the ﬁrst three-quarters of a one -semester graduate cour se. Instructors

with more time available can proceed at a more leisurely pace or incorpor ate

additional topics, as discussed below.

Those wishing to cover additional mater ial, in either a longer course or a

faster-paced gr aduate cour se, will ﬁnd that the book is structured to allow

ﬂexible incorporation of other topics as time permits (and depending on the

interests of the instructor). Speciﬁcally, the starred (*) sections and chapters

may be c overed in any order, or skipped entirely, without aﬀecting the overall

ﬂow of the book. We have taken care to ensure that none of the core material

depe nds on any of the starred material and, for the most part, the starr ed

sections do not depend on each other. (When they do, this dependence is

explicitly noted.)

xix

We suggest the following fro m among the starred topics for those wishing

to g ive their course a particular ﬂavor:

• Theory: A more theoretically inclined course could include material

from Section 3.2.2 (semantic s ecurity); Chapter 7 (one-way functions

and hard-core predicates, and constructing pseudorandom generators,

functions, and permutations from one-way permutations); Section 8.4

(one-way functions and collision-resistant hash functions from number-

theoretic assumptions); Section 11.5.3 (RSA encryption without random

oracles); and Section 12.6 (signatures without random oracles).

• Mathematics: A course directed at students w ith a strong mathema t-

ics background—or being taught by someone who enjoys this aspect

of cryptography —could incorporate Section 4.6 (information-theoretic

MACs in ﬁnite ﬁelds ); some of the more advanced number theory from

Chapter 8 (e.g., the Chinese remainder theorem and the Miller–Rabin

primality test); and all of Chapter 9.

In either case, a selection of advanced topics from Chapter 13 could also be

included.

Feedback and Errata

Our goal in writing this book was to make modern cryptography access ible

to a wide audience beyond the “theoretical computer science” community. We

hope you will let us know if we have succeeded. The many enthusiastic emails

we have received in response to our ﬁrst edition have made the whole proces s

of wr iting this book worthw hile .

We are always happy to receive feedback. We hope there are no errors

or typos in the book; if you do ﬁnd any, however, we would greatly appre-

ciate it if you let us know. (A list of known errata will be maintained at

http://www.cs.umd.edu/~jkatz/imc.html.) You can email your comments

and errata to jkatz@cs.umd.edu and lindell@biu.ac.il; please put “In-

troduction to Modern Cryptography” in the subject line.

Acknowledgments

For the second edition: We ar e grateful to the many readers of the ﬁrst edi-

tion who have sent us comments, suggestions, and corrections that helped to

greatly improve the book. Discussions with Claude Cr´epeau, Bill Gasarch,

Gene Itkis, L eonid Reyz in, Tom Shrimpton, and Salil Vadhan regarding the

content and overall “philosophy” of the book were especially fruitful. We also

thank Bar Alon, Gilad Asharov, Giuseppe Ateniese, Amir Azodi, Omer Berk-

man, Sergio de Biasi, Aurora Bristor, Richard Chang, Qingfeng Cheng, Kwan

Tae Cho, Kyliah Clarkson, Ran Cohen, Nikolas Co ukouma, Dana Dachma n-

Soled, Michael Fang, Michael Farcasin, Pooya Fa rshim, Marc Fischlin, Lance

剩余594页未读，继续阅读

ttt_1919

粉丝: 23
资源: 1

现代密码学基础：第二版

Introduction to Modern Cryptography - Jonathan Katz & Yehuda Lindell

Modern Cryptography PDF课件

现代密码学导论Introduction to Modern Cryptography

introduction to modern cryptography

我想学习密码学，帮我推荐几本书籍

请帮我整理最新的哈希算法参考文献

给我推荐一些现代密码学的课程资源

使用SHA-1分别计算“Introduction to Computer security”，“Information Security”，“School of Computer Science”和“Cryptography”的散列值，用python写出完整代码

cryptography教程

No module named 'cryptography'

最新资源