《密码编码学与网络安全（第五版）答案.doc》由会员分享，可在线阅读，更多相关《密码编码学与网络安全（第五版）答案.doc（83页珍藏版）》请在taowenge.com淘文阁网|工程机械CAD图纸|机械工程制图|CAD装配图下载|SolidWorks_CaTia_CAD_UG_PROE_设计图分享下载上搜索。
1、【精品文档】如有侵权，请联系网站删除，仅供学习与交流密码编码学与网络安全（第五版）答案.精品文档.Chapter 1:Introduction5Chapter 2:Classical Encryption Techniques7Chapter 3:Block Ciphers and the Date Encryption Standard13Chapter 4:Finite Fields21Chapter 5:Advanced Encryption Standard28Chapter 6:More on Symmetric Ciphers33Chapter 7:Confidentiality
2、Using Symmetric Encryption38Chapter 8:Introduction to Number Theory42Chapter 9:Public-Key Cryptography and RSA46Chapter 10:Key Management; Other Public-Key Cryptosystems55Chapter 11:Message Authentication and Hash Functions59Chapter 12:Hash and MAC Algorithms62Chapter 13:Digital Signatures and Authe
3、ntication Protocols66Chapter 14:Authentication Applications71Chapter 15:Electronic Mail Security73Chapter 16:IP Security76Chapter 17:Web Security80Chapter 18:Intruders83Chapter 19:Malicious Software87Chapter 20:Firewalls89Answers to Questions1.1The OSI Security Architecture is a framework that provi
4、des a systematic way of defining the requirements for security and characterizing the approaches to satisfying those requirements. The document defines security attacks, mechanisms, and services, and the relationships among these categories.1.2Passive attacks have to do with eavesdropping on, or mon
5、itoring, transmissions. Electronic mail, file transfers, and client/server exchanges are examples of transmissions that can be monitored. Active attacks include the modification of transmitted data and attempts to gain unauthorized access to computer systems.1.3Passive attacks: release of message co
6、ntents and traffic analysis. Active attacks: masquerade, replay, modification of messages, and denial of service.1.4Authentication: The assurance that the communicating entity is the one that it claims to be. Access control: The prevention of unauthorized use of a resource (i.e., this service contro
7、ls 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 ent
8、ity (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 b
9、eing 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.5See Table 1.3.Answers toProblems1.1Release of message con
10、tentsTraffic analysisMasqueradeReplayModification of messagesDenial of servicePeer entity authenticationYData origin authenticationYAccess controlYConfidentialityYTraffic flow confidentialityYData integrityYYNon-repudiationYAvailabilityY1.2Release of message contentsTraffic analysisMasqueradeReplayM
11、odification of messagesDenial of serviceEnciphermentYDigital signatureYYYAccess controlYYYYYData integrityYYAuthentication exchangeYYYYTraffic paddingYRouting controlYYYNotarizationYYYChapter 2Classical Encryption TechniquesrAnswers to Questions2.1Plaintext, encryption algorithm, secret key, ciphert
12、ext, decryption algorithm.2.2Permutation and substitution.2.3One key for symmetric ciphers, two keys for asymmetric ciphers.2.4A 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
13、to produce a ciphertext block of equal length.2.5Cryptanalysis and brute force.2.6Ciphertext 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 analy
14、sis 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
15、 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.7An encryption scheme is unconditionally secure if the ciphertext generated by the scheme does n
16、ot 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
17、break the cipher exceeds the useful lifetime of the information.2.8The 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.2.9A monoalphabetic substitution cipher maps a plaintext alphabet to a ciph
18、ertext alphabet, so that each letter of the plaintext alphabet maps to a single unique letter of the ciphertext alphabet.2.10The 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.2.11A polyalp
19、habetic substitution cipher uses a separate monoalphabetic substitution cipher for each successive letter of plaintext, depending on a key.2.121. 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
20、 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.2.13A tra
21、nsposition cipher involves a permutation of the plaintext letters.2.14Steganography involves concealing the existence of a message.Answers to Problems2.1a.No. A change in the value of b shifts the relationship between plaintext letters and ciphertext letters to the left or right uniformly, so that i
22、f 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 than 25 is equivalent to a mod 26.c.The values of a and 26 must have no common positive integer factor other than 1. This is equivalent to saying that a and 26 are relatively pri
23、me, 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 1. Then E(a, p) = E(a, q), if q = p + m/k p.2.2There 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
24、the total number of distinct affine Caesar ciphers is 12 26 = 312.2.3Assume that the most frequent plaintext letter is e and the second most frequent letter 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) m
25、od 26Thus, 19 = 15a mod 26. By trial and error, we solve: a = 3.Then 1 = (12 + b) mod 26. By observation, b = 15.2.4A good glass in the Bishops hostel in the Devils seattwenty-one degrees and thirteen minutesnortheast and by northmain branch seventh limb east sideshoot from the left eye of the death
26、s head a bee line from the tree through the shot fifty feet out. (from The Gold Bug, by Edgar Allan Poe)2.5a.The first letter t corresponds to A, the second letter h corresponds to B, e is C, s is D, and so on. Second and subsequent occurrences of a letter in the key sentence are ignored. The result
27、ciphertext: 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 the first sentence is used, the second and subsequent sentences may also b
28、e 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 appe
29、ar on that page. Elementary! (from The Valley of Fear, by Sir Arthur Conan Doyle)2.7a.28107963145CRYPTOGAHIBEATTHETHIRDPILLARFROMTHELEFTOUTSIDETHELYCEUMTHEATRETONIGHTATSEVENIFYOUAREDISTRUSTFULBRINGTWOFRIENDS42810563719NETWORKSCUTRFHEHFTINBROUYRTUSTEAETHGISREHFTEATYRNDIROLTAOUGSHLLETINIBITIHIUOVEUFED
30、MTCESATWTLEDMNEDLRAPTSETERFOISRNG 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 laid out in columns in the second matrix, taking into account the order dictated by
31、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. The plaintext is then read left to right, top to bottom.c.Although this is a weak method
32、, it may have use with time-sensitive information and an adversary without immediate access to good cryptanalysis (e.g., tactical use). Plus it doesnt require anything more than paper and pencil, and can be easily remembered.2.8SPUTNIK2.9PT BOAT ONE OWE NINE LOST IN ACTION IN BLACKETT STRAIT TWO MIL
33、ES SW MERESU COVE X CREW OF TWELVE X REQUEST ANY INFORMATION2.10a.LARGESTBCDFHI/JKMNOPQUVWXYZb.OCURENABDFGHI/JKLMPQSTVWXYZ2.11a.UZTBDLGZPNNWLGTGTUEROVLDBDUHFPERHWQSRZb.UZTBDLGZPNNWLGTGTUEROVLDBDUHFPERHWQSRZc.A cyclic rotation of rows and/or columns leads to equivalent substitutions. In this case, th
34、e matrix for part a of this problem is obtained from the matrix of Problem 2.10a, by rotating the columns by one step and the rows by three steps.2.12a.25! 284b.Given any 5x5 configuration, any of the four row rotations is equivalent, for a total of five equivalent configurations. For each of these
35、five configurations, any of the four column rotations is equivalent. So each configuration in fact represents 25 equivalent configurations. Thus, the total number of unique keys is 25!/25 = 24!2.13A mixed Caesar cipher. The amount of shift is determined by the keyword, which determines the placement
36、 of letters in the matrix.2.14a.Difficulties are things that show what men are.b.Irrationally held truths may be more harmful than reasoned errors.2.15a.We need an even number of letters, so append a q to the end of the message. Then convert the letters into the corresponding alphabetic positions:Me
37、etmeattheusual1355201351202085211921112Placeattenrather161213512020514181208518Thaneightoclockq208114597820153121531117The calculations proceed two letters at a time. The first pair:The first two ciphertext characters are alphabetic positions 7 and 22, which correspond to GV. The complete ciphertext
38、:GVUIGVKODZYPUHEKJHUZWFZFWSJSDZMUDZMYCJQMFWWUQRKRb.We first perform a matrix inversion. Note that the determinate of the encryption matrix is (9 7) (4 5) = 43. Using the matrix inversion formula from the book:Here we used the fact that (43)1 = 23 in Z26. Once the inverse matrix has been determined,
39、decryption can proceed. Source: LEWA00.2.16Consider the matrix K with elements kij to consist of the set of column vectors Kj, where:andThe ciphertext of the following chosen plaintext n-grams reveals the columns of K:(B, A, A, , A, A) K1(A, B, A, , A, A) K2(A, A, A, , A, B) Kn2.17a.7 134b.7 134c.13
40、4d.10 134e.24 132f.24 (132 1) 13g.37648h.23530i.1572482.18key:legleglegleplaintext:explanationciphertext:PBVWETLXOZR2.19a.sendmoremoney18413312141741214134249017231521141111289141410931218232515127BECKJDMSXZPMHb.cashnotneeded201871314191344343254223221519519211284141410931218232515127BECKJDMSXZPMH2.
41、20your package ready Friday 21st room three Please destroy this immediately.2.21a.Lay the message out in a matrix 8 letters across. Each integer in the key tells you which letter to choose in the corresponding row. Result:He sitteth between the cherubims. The isles may be glad thereof. As the rivers
42、 in the south.b.Quite secure. In each row there is one of eight possibilities. So if the ciphertext is 8n letters in length, then the number of possible plaintexts is 8n.c.Not very secure. Lord Peter figured it out. (from The Nine Tailors)Chapter 3Block Ciphers and the Data Encryption StandardAnswer
43、s to Questions3.1Most symmetric block encryption algorithms in current use are based on the Feistel block cipher structure. Therefore, a study of the Feistel structure reveals the principles behind these more recent ciphers.3.2A stream cipher is one that encrypts a digital data stream one bit or one byte at a time. A block cipher is one in w