Answers To Problems For Cryptography and Network Security, 7th Edition by Stallings
Answers To Problems For Cryptography and Network Security, 7th Edition by Stallings
CHAPTER 1 INTRODUCTION
sm
ANSWERS TO QUESTIONS
1.1 The OSI Security Architecture is a framework that provides a systematic
way of defining the requirements for security and characterizing the
tb9
approaches to satisfying those requirements. The document defines
security attacks, mechanisms, and services, and the relationships
among these categories.
allowed to do).
Data confidentiality: The protection of data from unauthorized
disclosure.
Data integrity: The assurance that data received are exactly as sent by
.co
-5-
Contact me in order to access the whole complete document - Email: [email protected]
WhatsApp: https://wa.me/message/2H3BV2L5TTSUF1 - Telegram: https://t.me/solutionmanual
1.5 See Table 1.3.
ANSWERS TO PROBLEMS
1.1 The system must keep personal identification numbers confidential, both
in the host system and during transmission for a transaction. It must
protect the integrity of account records and of individual transactions.
Availability of the host system is important to the economic well being
of the bank, but not to its fiduciary responsibility. The availability of
individual teller machines is of less concern.
1.2 The system does not have high requirements for integrity on individual
transactions, as lasting damage will not be incurred by occasionally
losing a call or billing record. The integrity of control programs and
configuration records, however, is critical. Without these, the switching
function would be defeated and the most important attribute of all -
availability - would be compromised. A telephone switching system must
also preserve the confidentiality of individual calls, preventing one caller
from overhearing another.
-6-
1.3 a. The system will have to assure confidentiality if it is being used to
publish corporate proprietary material.
b. The system will have to assure integrity if it is being used to laws or
regulations.
c. The system will have to assure availability if it is being used to publish
a daily paper.
-7-
1.5 Release Traffic Masquerade Replay Modification Denial
of analysis of messages of
message service
contents
Peer entity Y
authentication
Data origin Y
authentication
Access control Y
Confidentiality Y
Traffic flow Y
confidentiality
Data integrity Y Y
Non-repudiation Y
Availability Y
1.7
-8-
Open Safe
-9-
CHAPTER 2 INTRODUCTION TO NUMBER
THEORY
ANSWERS TO QUESTIONS
2.1 A nonzero b is a divisor of a if a = mb for some m, where a, b, and m
are integers. That is, b is a divisor of a if there is no remainder on
division.
2.4 An integer p > 1 is a prime number if and only if its only divisors are ±1
and ±p.
2.5 Euler's totient function, written φ(n), is the number of positive integers
less than n and relatively prime to n.
2.6 The algorithm takes a candidate integer n as input and returns the
result "composite" if n is definitely not a prime, and the result
"inconclusive" if n may or may not be a prime. If the algorithm is
repeatedly applied to a number and repeatedly returns inconclusive,
then the probability that the number is actually prime increases with
each inconclusive test. The probability required to accept a number as
prime can be set as close to 1.0 as desired by increasing the number of
tests made.
2.7 If r and n are relatively prime integers with n > 0. and if φ(n) is the
least positive exponent m such that am ≡ 1 mod n, then r is called a
primitive root modulo n.
ANSWERS TO PROBLEMS
-10-