下载文档原格式
密码学课后习题答案密码学课后习题答案密码学是一门研究如何保护信息安全的学科，它涉及到加密、解密、认证、数字签名等方面。
在密码学的学习中，习题是非常重要的一部分，通过解答习题可以加深对密码学知识的理解和应用。
本文将针对密码学课后习题提供一些答案和解析，帮助读者更好地掌握密码学的基本概念和技术。
1. 对称加密和非对称加密的区别是什么？对称加密和非对称加密是密码学中两种常见的加密方式。
它们的区别主要体现在加密和解密所使用的密钥的不同。
对称加密使用同一个密钥进行加密和解密。
也就是说，发送方和接收方使用相同的密钥来加密和解密信息。
这种方式加密速度快，适合对大量数据进行加密，但密钥的安全性较低。
非对称加密使用一对密钥，分别为公钥和私钥。
发送方使用接收方的公钥进行加密，而接收方使用自己的私钥进行解密。
这种方式加密速度较慢，但密钥的安全性较高，适合保护重要信息的传输。
2. 什么是数字签名？如何实现数字签名？数字签名是一种用于验证信息真实性和完整性的技术。
它通过使用私钥对信息进行加密，生成一个数字签名，然后使用公钥对数字签名进行解密和验证。
实现数字签名的过程如下：1) 发送方使用哈希函数对原始信息进行摘要，生成一个固定长度的摘要值。
2) 发送方使用自己的私钥对摘要值进行加密，生成数字签名。
3) 发送方将原始信息和数字签名一起发送给接收方。
4) 接收方使用发送方的公钥对数字签名进行解密，得到摘要值。
5) 接收方使用相同的哈希函数对接收到的原始信息进行摘要，生成另一个摘要值。
6) 接收方比较两个摘要值是否相同，如果相同，则说明信息的真实性和完整性得到了验证。
3. 什么是密钥交换协议？举例说明一个常见的密钥交换协议。
密钥交换协议是一种用于在通信双方安全地交换密钥的协议。
它可以确保密钥在传输过程中不被窃取或篡改，从而保证通信的机密性和完整性。
一个常见的密钥交换协议是Diffie-Hellman密钥交换协议。
它的过程如下：1) 发送方选择一个素数p和一个原根g，并将它们公开。
计算机网络课后题答案第七章第七章网络安全7-01 计算机网络都面对哪几种威迫？主动攻击和被动攻击的差别是什么？关于计算机网络的安全举措都有哪些？答：计算机网络面对以下的四种威迫：截获（interception ），中止 (interruption)，窜改(modification), 假造（ fabrication ）。
网络安全的威迫能够分为两大类：即被动攻击和主动攻击。
主动攻击是指攻击者对某个连结中经过的PDU 进行各样办理。
若有选择地改正、删除、延缓这些PDU。
甚至还可将合成的或假造的PDU 送入到一个连结中去。
主动攻击又可进一步区分为三种，即改正报文流；拒绝报文服务；假造连结初始化。
被动攻击是指察看和剖析某一个协议数据单元 PDU 而不扰乱信息流。
即便这些数据对攻击者来说是不易理解的，它也可经过察看 PDU 的协议控制信息部分，认识正在通讯的协议实体的地点和身份，研究 PDU 的长度和传输的频度，以便认识所互换的数据的性质。
这类被动攻击又称为通讯量剖析。
还有一种特别的主动攻击就是歹意程序的攻击。
歹意程序种类众多，对网络安全威迫较大的主要有以下几种：计算机病毒；计算机蠕虫；特洛伊木马；逻辑炸弹。
应付被动攻击可采纳各样数据加密动技术，而应付主动攻击，则需加密技术与合适的鉴识技术联合。
7-02 试解说以下名词：（ 1）重放攻击；（ 2）拒绝服务；（ 3）接见控制；（ 4）流量剖析；（ 5）歹意程序。
（1）重放攻击：所谓重放攻击（ replay attack ）就是攻击者发送一个目的主机已接收过的包，来达到欺诈系统的目的，主要用于身份认证过程。
（2）拒绝服务： DoS(Denial of Service) 指攻击者向因特网上的服务器不断地发送大批分组，使因特网或服务器没法供给正常服务。
（3）接见控制：（ access control）也叫做存取控制或接入控制。
一定对接入网络的权限加以控制，并规定每个用户的接入权限。
第二章2.1什么是对称密码的本质成分？Plaintext, encryption algorithm, secret key, ciphertext, decryption algorithm.明文加密算法密钥密文解密算法2.2 密码算法中两个基本函数式什么？Permutation and substitution.代换和置换P202.3用密码进行通信的两个人需要多少密钥？对称密码只需要一把，非对称密码要两把P202.4 分组密码和流密码的区别是什么？A stream cipher is one that encrypts a digital data stream one bit or one byte at a time. A block cipher is one in which a block of plaintext is treated as a whole and used to produce a ciphertext block of equal length.分组密码每次输入的一组元素，相应地输出一组元素。
流密码则是连续地处理输入元素，每次输出一个元素。
P202.5攻击密码的两种一般方法是什么？Cryptanalysis and brute force.密码分析和暴力破解2.6列出并简要定力基于攻击者所知道信息的密码分析攻击类型。
Ciphertext only. One possible attack under these circumstances is the brute-force approach of trying all possible keys. If the key space is very large, this becomes impractical. Thus, the opponent must rely on an analysis of the ciphertext itself, generally applying various statistical tests to it.Known plaintext.The analyst may be able to capture one or more plaintext messages as well as their encryptions. With this knowledge, the analyst may be able to deduce the key on the basis of the way in which the known plaintext is transformed.Chosen plaintext. If the analyst is able to choose the messages to encrypt, the analyst may deliberately pick patterns that can be expected to reveal the structure of the key.惟密文已知明文选择明文2.7无条件安全密码和计算上安全密码的区别是什么？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: (1) the cost of breaking the cipher exceeds the value of the encrypted information, and (2) the time required to break the cipher exceeds the useful lifetime of the information.书本P212.8简要定义Caesar密码The Caesar cipher involves replacing each letter of the alphabet with the letter standing k places further down the alphabet, for k in the range 1 through 25.书本P222.9简要定义单表代换密码A monoalphabetic substitution cipher maps a plaintext alphabet to a ciphertext alphabet, so that each letter of the plaintext alphabet maps to a single unique letter of the ciphertext alphabet.书本P232.10简要定义Playfair密码The Playfair algorithm is based on the use of a 5 5 matrix of letters constructed using a keyword. Plaintext is encrypted two letters at a time using this matrix.书本P262.11单表代换密码和夺标代换密码的区别是什么？A polyalphabetic substitution cipher uses a separate monoalphabetic substitution cipher for each successive letter of plaintext, depending on a key.书本P302.12一次一密的两个问题是什么？1. There is the practical problem of making large quantities of random keys. Any heavily usedsystem might require millions of random characters on a regular basis. Supplying truly random characters in this volume is a significant task.2. Even more daunting is the problem of key distribution and protection. For every message to be sent, a key of equal length is needed by both sender and receiver. Thus, a mammoth key distribution problem exists.书本P332.13什么是置换密码？A transposition cipher involves a permutation of the plaintext letters. 书本P332.14什么是隐写术？Steganography involves concealing the existence of a message.书本P362.7.3习题 2.1a.对b 的取值是否有限制？解释原因。
第二章2.1什么是对称密码的本质成分？Plaintext, encryption algorithm, secret key, ciphertext, decryption algorithm.明文加密算法密钥密文解密算法2.2 密码算法中两个基本函数式什么？Permutation and substitution.代换和置换P202.3用密码进行通信的两个人需要多少密钥？对称密码只需要一把，非对称密码要两把P202.4 分组密码和流密码的区别是什么？A stream cipher is one that encrypts a digital data stream one bit or one byte at a time. A block cipher is one in which a block of plaintext is treated as a whole and used to produce a ciphertext block of equal length.分组密码每次输入的一组元素，相应地输出一组元素。
流密码则是连续地处理输入元素，每次输出一个元素。
P202.5攻击密码的两种一般方法是什么？Cryptanalysis and brute force.密码分析和暴力破解2.6列出并简要定力基于攻击者所知道信息的密码分析攻击类型。
Ciphertext only. One possible attack under these circumstances is the brute-force approach of trying all possible keys. If the key space is very large, this becomes impractical. Thus, the opponent must rely on an analysis of the ciphertext itself, generally applying various statistical tests to it.Known plaintext.The analyst may be able to capture one or more plaintext messages as well as their encryptions. With this knowledge, the analyst may be able to deduce the key on the basis of the way in which the known plaintext is transformed.Chosen plaintext. If the analyst is able to choose the messages to encrypt, the analyst may deliberately pick patterns that can be expected to reveal the structure of the key.惟密文已知明文选择明文2.7无条件安全密码和计算上安全密码的区别是什么？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: (1) the cost of breaking the cipher exceeds the value of the encrypted information, and (2) the time required to break the cipher exceeds the useful lifetime of the information.书本P212.8简要定义Caesar密码The Caesar cipher involves replacing each letter of the alphabet with the letter standing k places further down the alphabet, for k in the range 1 through 25.书本P222.9简要定义单表代换密码A monoalphabetic substitution cipher maps a plaintext alphabet to a ciphertext alphabet, so that each letter of the plaintext alphabet maps to a single unique letter of the ciphertext alphabet.书本P232.10简要定义Playfair密码The Playfair algorithm is based on the use of a 55 matrix of letters constructed using a keyword. Plaintext is encrypted two letters at a time using this matrix.书本P262.11单表代换密码和夺标代换密码的区别是什么？A polyalphabetic substitution cipher uses a separate monoalphabetic substitution cipher for each successive letter of plaintext, depending on a key.书本P302.12一次一密的两个问题是什么？1. There is the practical problem of making large quantities of random keys. Any heavily used system mightrequire millions of random characters on a regular basis. Supplying truly random characters in this volume is a significant task.2. Even more daunting is the problem of key distribution and protection. For every message to be sent, a key of equal length is needed by both sender and receiver. Thus, a mammoth key distribution problem exists.书本P332.13什么是置换密码？A transposition cipher involves a permutation of the plaintext letters.书本P332.14什么是隐写术？Steganography involves concealing the existence of a message.书本P362.1a.对b的取值是否有限制？解释原因。
Access control: The prevention of unauthorized use of a resource (i.e., this service controls who can have access to a resource, under what conditions access can occur, and what those accessing the resource are allowed to do).Data confidentiality: The protection of data from unauthorized disclosure.Data integrity: The assurance that data received are exactly as sent by an authorized entity (i.e., contain no modification, insertion, deletion, or replay).Nonrepudiation: Provides protection against denial by one of the entities involved in a communication of having participated in all or part of the communication.Availability service: The property of a system or a system resource being accessible and usable upon demand by an authorized system entity, according to performance specifications for the system (i.e., a system is available if it provides services according to the system design whenever users request them).1.5 See Table 1.3.2.1 Plaintext, encryption algorithm, secret key, ciphertext, decryptionalgorithm.2.2 Permutation and substitution.2.3 One key for symmetric ciphers, two keys for asymmetric ciphers.2.4 A stream cipher is one that encrypts a digital data stream one bit or one byteat a time. A block cipher is one in which a block of plaintext is treated as a whole and used to produce a ciphertext block of equal length.2.5 Cryptanalysis and brute force.2.6 Ciphertext only . One possible attack under these circumstances is thebrute-force approach of trying all possible keys. If the key space is very large, this becomes impractical. Thus, the opponent must rely on an analysis of the ciphertext itself, generally applying various statistical tests to it. Known plaintext. The analyst may be able to capture one or more plaintext messages as well as their encryptions. With this knowledge, the analyst may be able to deduce the key on the basis of the way in which the known plaintext is transformed. Chosen plaintext. If the analyst is able to choose the messages to encrypt, the analyst may deliberately pick patterns that can be expected to reveal the structure of the key.2.7 An encryption scheme is unconditionally secure if the ciphertext generatedby 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: (1) the cost of breaking the cipher exceeds the value of the encrypted information, and (2) the time required to break the cipher exceeds the useful lifetime of the information.C HAPTER 2C LASSICAL E NCRYPTION T ECHNIQUESR2.8 The Caesar cipher involves replacing each letter of the alphabet with theletter standing k places further down the alphabet, for k in the range 1 through25.2.9 A monoalphabetic substitution cipher maps a plaintext alphabet to a ciphertextalphabet, so that each letter of the plaintext alphabet maps to a single unique letter of the ciphertext alphabet.2.10 The Playfair algorithm is based on the use of a 5 5 matrix of lettersconstructed using a keyword. Plaintext is encrypted two letters at a time using this matrix.2.11 A polyalphabetic substitution cipher uses a separate monoalphabeticsubstitution cipher for each successive letter of plaintext, depending on a key.2.12 1. There is the practical problem of making large quantities of random keys.Any heavily used system might require millions of random characters on a regular basis. Supplying truly random characters in this volume is asignificant task.2. Even more daunting is the problem of key distribution and protection. Forevery message to be sent, a key of equal length is needed by both sender and receiver. Thus, a mammoth key distribution problem exists.2.13 A transposition cipher involves a permutation of the plaintext letters.2.14 Steganography involves concealing the existence of a message.A NSWERS TO P ROBLEMS2.1 a. No. A change in the value of b shifts the relationship between plaintextletters and ciphertext letters to the left or right uniformly, so that if the mapping is one-to-one it remains one-to-one.b. 2, 4, 6, 8, 10, 12, 13, 14, 16, 18, 20, 22, 24. Any value of a larger than25 is equivalent to a mod 26.c. The values of a and 26 must have no common positive integer factor otherthan 1. This is equivalent to saying that a and 26 are relatively prime, or that the greatest common divisor of a and 26 is 1. To see this, first note that E(a, p) = E(a, q) (0 ≤ p≤ q< 26) if and only if a(p–q) is divisible by 26. 1. Suppose that a and 26 are relatively prime. Then, a(p–q) is not divisible by 26, because there is no way to reduce the fractiona/26 and (p–q) is less than 26. 2. Suppose that a and 26 have a common factor k> 1. Then E(a, p) = E(a, q), if q = p + m/k≠ p.2.2 There are 12 allowable values of a (1, 3, 5, 7, 9, 11, 15, 17, 19, 21, 23,25). There are 26 allowable values of b, from 0 through 25). Thus the totalnumber of distinct affine Caesar ciphers is 12 26 = 312.2.3 Assume that the most frequent plaintext letter is e and the second most frequentletter is t. Note that the numerical values are e = 4; B = 1; t = 19; U = 20.Then we have the following equations:1 = (4a + b) mod 2620 = (19a + b) mod 26Thus, 19 = 15a mod 26. By trial and error, we solve: a = 3.Then 1 = (12 + b) mod 26. By observation, b = 15.2.4 A good glass in the Bishop's hostel in the Devil's seat—twenty-one degreesand thirteen minutes—northeast and by north—main branch seventh limb east side—shoot from the left eye of the death's head— a bee line from the tree through the shot fifty feet out. (from The Gold Bug, by Edgar Allan Poe)2.5 a. The first letter t corresponds to A, the second letter h corresponds toB, e is C, s is D, and so on. Second and subsequent occurrences of a letter in the key sentence are ignored. The resultciphertext: SIDKHKDM AF HCRKIABIE SHIMC KD LFEAILAplaintext: basilisk to leviathan blake is contactb. It is a monalphabetic cipher and so easily breakable.c. The last sentence may not contain all the letters of the alphabet. If thefirst sentence is used, the second and subsequent sentences may also be used until all 26 letters are encountered.2.6The cipher refers to the words in the page of a book. The first entry, 534,refers to page 534. The second entry, C2, refers to column two. The remaining numbers are words in that column. The names DOUGLAS and BIRLSTONE are simply words that do not appear on that page. Elementary! (from The Valley of Fear, by Sir Arthur Conan Doyle)2.7 a.2 8 10 7 9 63 14 5C R Y P T O G A H I4 2 8 1056 37 1 9ISRNG BUTLF RRAFR LIDLP FTIYO NVSEE TBEHI HTETAEYHAT TUCME HRGTA IOENT TUSRU IEADR FOETO LHMETNTEDS IFWRO HUTEL EITDSb. The two matrices are used in reverse order. First, the ciphertext is laidout in columns in the second matrix, taking into account the order dictated by the second memory word. Then, the contents of the second matrix are read left to right, top to bottom and laid out in columns in the first matrix, taking into account the order dictated by the first memory word. Theplaintext is then read left to right, top to bottom.c. Although this is a weak method, it may have use with time-sensitiveinformation and an adversary without immediate access to good cryptanalysis(e.g., tactical use). Plus it doesn't require anything more than paper andpencil, and can be easily remembered.2.8 SPUTNIK2.9 PT BOAT ONE OWE NINE LOST IN ACTION IN BLACKETT STRAIT TWO MILES SW MERESU COVEX CREW OF TWELVE X REQUEST ANY INFORMATION。
密码学原理与实践答案1.1 几个简单的密码体制注：小写代表明文，大写代表密文分组密码：单表代换密码：移位密码，代换密码，仿射密码多表代换密码：维吉尼亚密码，希尔密码非代换密码：置换密码流密码：同步流密码，异步流密码1.1.1 移位密码密码体制：令 P = C = K = Z 26 P=C=K=Z_{26} P=C=K=Z26 有 e K ( x ) = ( x + K ) m o d 26 d K ( y ) = ( x −K ) m o d 26 e_{K}(x)=(x+K)mod 26 \quad d_K(y)=(x-K)mod 26 eK(x)=(x+K)mod26dK(y)=(x−K)mod26 并且当K=3时叫凯撒密码。
密钥空间为261.1.2 代换密码密码体制：令 P = C = Z 26 P=C=Z_{26} P=C=Z26 对任意的置换π ∈ K \pi \in K π∈K，有 e π ( x ) = π ( x ) d π ( y ) = π − 1 ( y ) e_{\pi}(x)=\pi(x) \quadd_{\pi}(y)=\pi^{-1}(y) eπ(x)=π(x)dπ(y)=π−1(y)。
密钥空间为 26 ! 26! 26!1.1.3 仿射密码加密函数形式： e ( x ) = ( a x + b ) m o d 26e(x)=(ax+b)mod 26 e(x)=(ax+b)mod26，要求仿射函数必须是单射，也就是同余方程 a x ≡ y ( m o d 26 ) ax\equivy(mod 26) ax≡y(mod26)有唯一解。
上述同余方程有唯一解⇔ g c d ( a , 26 ) = 1\Leftrightarrow gcd(a,26)=1 ⇔gcd(a,26)=1 ，证明略。
此时a的取值为0~25之间与26互素的数，共12个，b的取值为0~25。
这时密钥空间为312。
第二章2.1什么是对称密码的本质成分？Plaintext, encryption algorithm, secret key, ciphertext, decryption algorithm.明文加密算法密钥密文解密算法2.2 密码算法中两个基本函数式什么？Permutation and substitution.代换和置换P202.3用密码进行通信的两个人需要多少密钥？对称密码只需要一把，非对称密码要两把P202.4 分组密码和流密码的区别是什么？A stream cipher is one that encrypts a digital data stream one bit or one byte at a time. A block cipher is one in which a block of plaintext is treated as a whole and used to produce a ciphertext block of equal length.分组密码每次输入的一组元素，相应地输出一组元素。
流密码则是连续地处理输入元素，每次输出一个元素。
P202.5攻击密码的两种一般方法是什么？Cryptanalysis and brute force.密码分析和暴力破解2.6列出并简要定力基于攻击者所知道信息的密码分析攻击类型。
Ciphertext only. One possible attack under these circumstances is the brute-force approach of trying all possible keys. If the key space is very large, this becomes impractical. Thus, the opponent must rely on an analysis of the ciphertext itself, generally applying various statistical tests to it.Known plaintext.The analyst may be able to capture one or more plaintext messages as well as their encryptions. With this knowledge, the analyst may be able to deduce the key on the basis of the way in which the known plaintext is transformed.Chosen plaintext. If the analyst is able to choose the messages to encrypt, the analyst may deliberately pick patterns that can be expected to reveal the structure of the key.惟密文已知明文选择明文2.7无条件安全密码和计算上安全密码的区别是什么？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: (1) the cost of breaking the cipher exceeds the value of the encrypted information, and (2) the time required to break the cipher exceeds the useful lifetime of the information.书本P212.8简要定义Caesar密码The Caesar cipher involves replacing each letter of the alphabet with the letter standing k places further down the alphabet, for k in the range 1 through 25.书本P222.9简要定义单表代换密码A monoalphabetic substitution cipher maps a plaintext alphabet to a ciphertext alphabet, so that each letter of the plaintext alphabet maps to a single unique letter of the ciphertext alphabet.书本P232.10简要定义Playfair密码The Playfair algorithm is based on the use of a 5?5 matrix of letters constructed using a keyword. Plaintext is encrypted two letters at a time using this matrix.书本P262.11单表代换密码和夺标代换密码的区别是什么？A polyalphabetic substitution cipher uses a separate monoalphabetic substitution cipher for each successive letter of plaintext, depending on a key.书本P302.12一次一密的两个问题是什么？1. There is the practical problem of making large quantities of random keys. Any heavily used system mightrequire millions of random characters on a regular basis. Supplying truly random characters in this volume is a significant task.2. Even more daunting is the problem of key distribution and protection. For every message to be sent, a key of equal length is needed by both sender and receiver. Thus, a mammoth key distribution problem exists.书本P332.13什么是置换密码？A transposition cipher involves a permutation of the plaintext letters.书本P332.14什么是隐写术？Steganography involves concealing the existence of a message.书本P362.1a.对b的取值是否有限制？解释原因。
密码编码学与网络安全课后习题答案全Document number【SA80SAB-SAA9SYT-SAATC-SA6UT-SA18】密码编码学与网络安全（全）什么是OSI安全体系结构？OSI安全体系结构是一个架构，它为规定安全的要求和表征满足那些要求的途径提供了系统的方式。
该文件定义了安全攻击、安全机理和安全服务，以及这些范畴之间的关系。
被动安全威胁和主动安全威胁之间的差别是什么？被动威胁必须与窃听、或监控、传输发生关系。
电子邮件、文件的传送以及用户/服务器的交流都是可进行监控的传输的例子。
主动攻击包括对被传输的数据加以修改，以及试图获得对计算机系统未经授权的访问。
验证：保证通信实体之一，它声称是。
访问控制：防止未经授权使用的资源（即，谁可以拥有对资源的访问，访问在什么条件下可能发生，那些被允许访问的资源做这个服务控制）。
数据保密：保护数据免受未经授权的披露。
数据完整性：保证接收到的数据是完全作为经授权的实体（即包含任何修改，插入，删除或重播）发送。
不可否认性：提供保护反对否认曾参加全部或部分通信通信中所涉及的实体之一。
可用性服务：系统属性或访问和经授权的系统实体的需求，可用的系统资源，根据系统（即系统是可用的，如果它提供服务，根据系统设计，只要用户要求的性能指标它们）。
第二章1.什么是对称密码的本质成分？明文、加密算法、密钥、密文、解密算法。
4.分组密码和流密码的区别是什么？流密码是加密的数字数据流的一个位或一次一个字节。
块密码是明文块被视为一个整体，用来产生一个相同长度的密文块......分组密码每次处理输入的一组分组，相应的输出一组元素。
流密码则是连续地处理输入元素，每次输出一个元素。
6.列出并简要定义基于攻击者所知道信息的密码分析攻击类型。
惟密文攻击：只知道要解密的密文。
这种攻击一般是试遍所有可能的密钥的穷举攻击，如果密钥空间非常大，这种方法就不太实际。
因此攻击者必须依赖于对密文本身的分析，这一般要运用各种统计方法。
密码编码学与网络安全中文答案密码编码学与网络安全中文答案【篇一：密码编码学与网络安全第四版第二章答案翻译】是对称密码的本质成分？plaintext, encryption algorithm, secret key, ciphertext, decryption algorithm.明文加密算法密钥密文解密算法2.2 密码算法中两个基本函数式什么？permutation and substitution.代换和置换p202.3用密码进行通信的两个人需要多少密钥？对称密码只需要一把，非对称密码要两把p202.4 分组密码和流密码的区别是什么？a stream cipher is one that encrypts a digital data stream one bit or one byte at a time. a block cipher is one in which a block of plaintext is treated as a whole and used to produce a ciphertext block of equal length.分组密码每次输入的一组元素，相应地输出一组元素。
流密码则是连续地处理输入元素，每次输出一个元素。
p202.5攻击密码的两种一般方法是什么？cryptanalysis and brute force.密码分析和暴力破解2.6列出并简要定力基于攻击者所知道信息的密码分析攻击类型。
ciphertext only. one possible attack under these circumstances is the brute-force approach of trying all possible keys. if the key space is very large, this becomes impractical. thus, the opponent must rely on an analysis of the ciphertext itself, generally applying various statistical tests to it.known plaintext.the analyst may be able to capture one or more plaintext messages as well as their encryptions. with this knowledge, the analyst may be able to deduce the key on the basis of the way in which the known plaintext is transformed.chosen plaintext. if the analyst is able to choose themessages to encrypt, the analyst may deliberately pickpatterns that can be expected to reveal the structure of the key.惟密文已知明文选择明文2.7无条件安全密码和计算上安全密码的区别是什么？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:(1) the cost of breaking the cipher exceeds the value of the encrypted information, and (2) the time required to break the cipher exceeds the useful lifetime of the information.书本p212.8简要定义caesar密码the caesar cipher involves replacing each letter of the alphabet with the letter standing k places further down the alphabet, for k in the range 1 through 25.书本p222.9简要定义单表代换密码a monoalphabetic substitution cipher maps a plaintext alphabet to a ciphertext alphabet, so that each letter of the plaintext alphabet maps to a single unique letter of the ciphertext alphabet.2.10简要定义playfair密码the playfair algorithm is based on the use of a 5?5 matrix of letters constructed using a keyword. plaintext is encrypted two letters at a time using this matrix.书本p262.11单表代换密码和夺标代换密码的区别是什么？a polyalphabetic substitution cipher uses a separate monoalphabetic substitution cipher for each successive letter of plaintext, depending on a key.书本p302.12一次一密的两个问题是什么？1. there is the practical problem of making large quantities of random keys. any heavily usedsystem might require millions of random characters on a regular basis. supplying truly random characters in this volume isa significant task.2. even more daunting is the problem of key distribution and protection. for every message to be sent, a key of equal length is needed by both sender and receiver. thus, a mammoth key distribution problem exists.书本p332.13什么是置换密码？a transposition cipher involves a permutation of the plaintext letters.书本p332.14什么是隐写术？steganography involves concealing the existence of a message.书本p362.1a.对b的取值是否有限制？解释原因。
