当前位置:首页 >> 理学 >>

计算机科学导论原书第二版答案第十六章

CHAPTER 16

Security
(Solutions to Practice Set)

Review Questions
1. Three security goals are confidentiality, integrity, and availability. Confidentiality is to protect our confidential information against malicious actions that endanger it. Integrity means that changes need to be done only by authorized entities and through authorized mechanisms. Availability means that the information created and stored by an organization needs to be available to authorized entities. 2. Five security services are: Data confidentiality, data integrity, authentication, nonrepudiation, and access control. Data confidentiality is designed to protect data from snooping and traffic analysis. Data integrity is designed to protect data from modification, insertion, deletion, and replaying by an adversary. Authentication identifies the party at the other end of the line. It provides authentication of the sender or receiver and authenticates the source of the data. Nonrepudiation service protects against repudiation by either the sender or the receiver of the data. Access control protects against unauthorized access to data. 3. Cryptography means concealing the contents of a message by enciphering; steganography means concealing the message itself by covering it with something else. 4. A substitution cipher replaces one symbol with another; A transposition cipher reorders symbols. 5. Symmetric-key cryptography is based on sharing secrecy; asymmetric-key cryptography is based on personal secrecy. 6. Asymmetric-key cryptography uses two distinctive keys: a private key and a public key. Bob first creates a pair of keys; he keeps the private key and publicly announces the public key. If anyone needs to send a message to Bob, she encrypts the message with Bob’s public key. To read the message, Bob decrypts the message with his private key. 7. Message integrity guarantees that the message has not been changed; A message authentication authenticate the sender of the message.

1

2

8. a. A conventional signature is included in the document; a digital signature is sent as a separate document. b. For a conventional signature, the signature on the document is verified against a signature on a file. For a digital signature, the recipient receives the message and the signature. The recipient needs to apply the verification technique to the combination of the message and the signature to verify the authenticity. c. For a conventional signature, there is normally a one-to-many relationship between a signature and documents. A person uses the same signature to sign many documents. For a digital signature, there is a one-to-one relationship between a signature and a message. Each message has its own signature. d. In a conventional signature, a copy of the signed document can be distinguished from the original one on file. In a digital signature, there is no such distinction unless there is a factor of time (such as a timestamp). 9. A digital signature can provide three security services: message authentication, message integrity, and nonrepudiation. 10. Three kinds of identification witnesses discussed in this chapter: something known, something possessed, and something inherent. Something known is a secret known only by the claimant that can be checked by the verifier. Something possessed is something that can prove the claimant’s identity. Something inherent is an inherent characteristic of the claimant. 11. A practical solution to key distribution is the use of a trusted third party, referred to as a key-distribution center (KDC). To reduce the number of keys, each person establishes a shared secret key with the KDC. A secret key is established between the KDC and each member. This is how Alice sends a confidential message to Bob. Alice sends a request to the KDC stating that she needs a session (temporary) secret key between herself and Bob. The KDC informs Bob about Alice’s request. If Bob agrees, a session key is created between the two. 12. Certification authority (CA) is a federal or state organization that binds a public key to an entity and issues a certificate. The CA has a well-known public key itself that cannot be forged. The CA checks Bob’s identification. It then asks for Bob’s public key and writes it on the certificate. Now Bob can upload the signed certificate.

Multiple-Choice Questions
13. 19. 25. 31. a a d a 14. 20. 26. 32. b c a b 15. c 21. a 27. a 16. c 22. a 28. a 17. c 23. b 29. b 18. b 24. c 30. c

3

Exercises
33. a. Steganography b. Cryptography c. Steganography d. Steganography 34. a. (100 × 99) / 2 = 4950 ≈ 5000. b. 100 (assuming the president is not a club member). c. 99 (assuming the president is not a club member). 35. Range is 0 to 25 (for a total of 26 different key). However, Alice should not use 0 because this means no encryption. 36. Only one character will be changed because in this type of encryption each character is independently encrypted. 37. Only one character will be changed because transposition does not substitute characters. 38. In Encryption, each letter is shifted 7 positions towards the end of the alphabet. When we reach the end of the alphabet, we wrap the shifting toward the beginning. In decryption, each letter is shifted 7 position towards the beginning of the alphabet. When we reach the beginning, we wrap the shifting toward the end. Encryption
Plaintext Ciphertext t h i s i s a n e x e r c i s e

↓ ↓ ↓ ↓ ↓ ↓ ↓ ↓ ↓ ↓ ↓ ↓ ↓ ↓ ↓ ↓
A O P Z P Z H U L E L Y J P Z L

Decryption
Ciphertext Plaintext A O P Z P Z H U L E L Y J P Z L ↓ ↓ ↓ ↓ ↓ ↓ ↓ ↓ ↓ ↓ ↓ ↓ ↓ ↓ ↓ ↓ t h i s i s a n e x e r c i s e

39. Encryption
1 t S 4 2 h I 3 3 i H 2 4 s T 1 1 i N 4 2 s A 3 3 a S 2 4 n I 1 1 e R 4 2 x E 3 3 e X 2 4 r E 1 1 c E 4 2 i S 3 3 s I 2 4 e C 1

4

Decryption
1 S t 4 2 I h 3 3 H i 2 4 T s 1 1 N i 4 2 A s 3 3 S a 2 4 I n 1 1 R e 4 2 E x 3 3 X e 2 4 E r 1 1 E c 4 2 S i 3 3 I s 2 4 C e 1

40. Using number theory and cryptography (see reference), it is not difficult to find d in this case (d = 113). This means that if Bob chooses such a small n, it is very easy for Eve to find d. In practice, n is a very large number (more than 1000 bits) 41. The plaintext is 0708; the ciphertext is 0788 as shown below:
H: 07 I: 08

→ →

C = 7013 mod 100 = 07 C = 0813 mod 100 = 88

42. If e = 1, the ciphertext is same as the plaintext. If Eve intercept the ciphertext, she has actually has the plaintext. 43. Numbers associated with each letter is shown in the following table.
A B C D E F G H I J K L M N O P Q R S T U V W X Y Z 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25

The digest is 21 as shown below.
H 7 0 E 4 L 11 L 11 O 14




7




11





22




7





21



21

44. When the system defines a password for a user, there is an expiration period; after that, the system defines a new password and the old password is no longer valid. The advantage of this scheme is that if the password is stolen, it is valid only for a while. The disadvantage is the inconvenience of changing the password frequently. 45. The system can request the user to use a long password and something which is not normally guessed (such as a birth date or a common name). The system can also allow the user to enter the password a limited number of times. If the user fails, the system may request for other type of information such as mother maiden name. The bank can use the policy to confiscate the bank card if a user enters a wrong PIN a number of times. 46. The Caesar cipher is so primitive that can easily be attacked: a. The intruder can use a brute-force attack by exhaustive search using keys from 1 to 25.

5

b. The intruder can use frequency of characters in the ciphertext to find the plaintext. 47. The diagram is shown in Figure S16.47. Figure S16.47 Exercise 47
Plaintext Plaintext

Encryption (scramble)

Table

Reverse table

Encryption (descramble)

Ciphertext

Ciphertext

One possible key is the following scrambling table. The eight bits in each character are scrambled in encryption site and de-scrambled in the decryption site.
Encryption ↓ 1 3 2 7 3 5 4 1 5 8 6 2 7 4 8 6 ↑ Decryption

48. The encryption and decryption are shown in Figure S16.48 Figure S16.48 Exercise 48
Plaintext Plaintext

Key XOR Encrypt Ciphertext XOR Decrypt Ciphertext

For example if plain text is 1001000 and the key is 00110101 then
Encryption 10011000 Plaintext 00110101 Key 10101101 Ciphertext Decryption 10101101 Ciphertext 00110101 Key 10011000 Plaintext





49. Encryption is C = 73 mod 15 = 13. Decryption is P = 1311 mod 15 = 7 50. Encryption is C = 711 mod 15 = 13. Decryption is P = 133 mod 15 = 7 51. In symmetric-key cryptography only Alice and Bob have the secrete key. If Alice sends a message to Bob, only Bob can read the message. If later Alice denies that

6

she has sent the message, no one can verify that she has actually sent it because no one except Bob has the duplicate key. 52. Authentication is required when two parties don’t know each other. Two parties who don’t know each other do not have a shared secret key. 53. Figure S16.53 shows the solution. Figure S16.53 Exercise 53
Alice Bob Alice’s private key Signing algorithm (M, S) M: Message S: Signature Alice’s public key

M

M

Verifying algorithm

Symeteric key

(M, S)

Encryption

Decryption

54. Figure S16.54 shows the solution. Figure S16.54 Exercise 54
Alice Bob Alice’s private key Signing algorithm (M, S) M: Message S: Signature Alice’s public key

M

M

Verifying algorithm (M, S)

Encryption
Bob’s public key Bob’s private key

Decryption


相关文章:
计算机科学导论原书第二版答案第十六章.pdf
计算机科学导论原书第二版答案第十六章 - CHAPTER 16 Security
计算机科学导论原书第二版答案第二章.pdf
计算机科学导论原书第二版答案第 - CHAPTER 2 Number Sys
计算机科学导论原书第二版答案第十四章.pdf
计算机科学导论原书第二版答案第十四章 - CHAPTER 14 Database
计算机科学导论原书第二版答案第十一章.pdf
计算机科学导论原书第二版答案第十一章 - CHAPTER 11 Data Str
计算机科学导论原书第二版答案第十八章.pdf
计算机科学导论原书第二版答案第十八章 - CHAPTER 18 Artifici
计算机科学导论原书第二版答案第十五章.pdf
计算机科学导论原书第二版答案第十五章 - CHAPTER 15 Data Com
计算机科学导论原书第二版答案第十二章.pdf
计算机科学导论原书第二版答案第十二章 - CHAPTER 12 Abstract
计算机科学导论原书第二版答案第七章.pdf
计算机科学导论原书第二版答案第七章 - CHAPTER 7 Operating
计算机科学导论原书第二版答案第九章.pdf
计算机科学导论原书第二版答案第九章 - CHAPTER 9 Programmin
计算机科学导论习题答案.pdf
计算机科学导论习题答案_IT/计算机_专业资料。计算机科学导论习题答案 原书第二版 英文 CHAPTER 1 Introduction (Solutions to Practice Set) Review Questions 1. ...
计算机科学导论第2版答案.doc
计算机科学导论第2版答案 - 作者:(美)佛罗赞,(美)莫沙拉夫 著,刘艺 等译
计算机科学导论第二版答案.doc
计算机科学导论第二版答案 - 计算机科学导论第二版答案 【篇一:计算机科学导论习题答案】 题(答案) 一.选择题 1. d2. b3. cd 4. c5. abc 6. a7. b8...
计算机科学导论第三版答案.doc
计算机科学导论第版答案_电脑基础知识_IT/计算机_专业资料。第1章 概述 习
计算机科学导论习题.doc
计算机科学导论》习题一、选择题 1. 电子计算机从诞生之日起,经历了 4 个发
计算机科学导论第次作业答案.doc
计算机科学导论第次作业答案 - 《计算机科学导论》第1次作业答案 <第1章
2016下《计算机科学导论》第1次作业.doc
计算机科学导论》第 1 次作业 (第 1 章第 7 章)一、选择题 1. 电
南开18秋学期(1709、1803、1809)《计算机科学导论》在线作业(第二....doc
南开18秋学期(1709、1803、1809)《计算机科学导论》在线作业(第二版) - www.vu8o.com ---...
计算机科学导论第一章_图文.ppt
计算机科学导论第一章_工学_高等教育_教育专区。计算机科学导论PPT 计算机科学导论 Introduction of Computer Science 郭俊霞 gjxia@mail.buct.edu.cn Tel:64436009 ...
2012-2013-1计算机科学导论B-B卷.doc
2012 2013 学年第 1 学期 《计算机科学导论 B...而一本图 书某一时刻只能借给一个学生看,学生归还...二进制 C.十六进制 D.十进制 13.属于组合逻辑电路...
计算机科学导论试验指导书.doc
实验指导书名称:计算机科学导论实验指导书 总学时:32 总学分:2 实验学时数:8 实验的地位、 二、实验的地位、作用和目的 《计算机科学导论》 实验是一门专业...