密码编码学与网络安全（第五版） 向金海 02-古典密码算法教学幻灯片.pptVIP

* * §2.5 隐写术Steganography 隐藏信息的存在 字符标记 用不可见的墨水 隐藏在图形图像或声音文件的LSB上 缺点 需要额外的付出来隐藏相对较少的信息 * * * * 小结 古典密码技术及术语 单表代替密码 用字母频率进行密码分析 Playfair密码 多表代替密码 置换密码 转轮机密码 隐写术 * * 作业 思考题：2.2、2.5、2.8、2.9、2.11 习题：2.11、2.14 阅读一些关于密码历史或战争中密码应用的资料或故事 * Lecture slides by Panfeng for “Cryptography and Network Security”, 3/e, by William Stallings, Chapter 2 – “Classical Encryption Techniques”. * Briefly review some terminology used throughout the course. * Cryptographic systems can be characterized along these three independent dimensions. * Typically objective is to recover the key in use rather then simply to recover the plaintext of a single ciphertext. There are two general approaches: Cryptanalytic attacks rely on the nature of the algorithm plus perhaps some knowledge of the general characteristics of the plaintext or even some sample plaintext-ciphertext pairs. Brute-force attacks try every possible key on a piece of ciphertext until an intelligible translation into plaintext is obtained. On average,half of all possible keys must be tried to achieve success. * Stallings Table 2.1 summarizes the various types of cryptanalytic attacks, based on the amount of information known to the cryptanalyst, from least to most. The most difficult problem is presented when all that is available is the ciphertext only. In some cases, not even the encryption algorithm is known, but in general we can assume that the opponent does know the algorithm used for encryption. Then with increasing information have the other attacks. Generally, an encryption algorithm is designed to withstand a known-plaintext attack. * Two more definitions are worthy of note. An encryption scheme is unconditionally secure if the ciphertext generated by the scheme does not contain enough information to determine uniquely the corresponding plaintext, no matter how much ciphertext is available. An encryption scheme is said to be computationally secure if either the cost of breaking the cipher exceeds the value of the en