Prepare an initial security planning report
For the network that you have chosen to characterize, list the MAC Address, IP Address, IP Subnet Mask, Gateway Information, and DHCP and DNS Information for each network connection (all NICs in each computer as well as all network device connections). Based on this information, explain the flow of information in and configuration of this network.
Computer Network Security
Security professionals need to ensure that they keep up to date with the latest
threats and security issues. This allows them to update their risk profiles, such
as identifying if their systems are vulnerable. In order to determine what the risk
to an organisation is, you need to know what the problems could be.
In this assignment, your task is to identify a recently announced security
vulnerability and write a profile of the threat. The profile should contain the
name of the threat, the systems it attacks, how it performs its attack and the
mitigation strategies. The risk to an organisation using vulnerable systems should
also be determined.
Determine what the risk to an organisation is
Determine what the risk to an organisation is
Computer Network Security
Security professionals need to ensure that they keep up to date with the latest
threats and security issues. This allows them to update their risk profiles, such
as identifying if their systems are vulnerable. In order to determine what the risk
to an organisation is, you need to know what the problems could be.
In this assignment, your task is to identify a recently announced security
vulnerability and write a profile of the threat. The profile should contain the
name of the threat, the systems it attacks, how it performs its attack and the
mitigation strategies. The risk to an organisation using vulnerable systems should
also be determined.
Describe what hacking of memory or hacking of ram means
Assignment: Computer Memory Hacking
Write a two to three (2-3) page paper in which you:
Describe what hacking of memory or hacking of RAM means.
Examine the common tools that hackers use to hack into memory of computing devices. Detail two (2) real-life examples of such tools in action.
Identify three (3) best practices that one should use to protect their computer(s) from being hacked.
Analyze the significance of hacking in organizations and modern society.
Use at least two (2) quality resources in this assignment. Note: Wikipedia and similar Websites do not qualify as quality resources.
Case study on computer security
Case study :
Computer security is not an issue for organizations alone. Anyone whose personal computer is connected to a network or the Internet faces a potential risk of attack. Identify all the potential security threats on a personal computer. Identify some of the techniques an attacker might employ to access information on the system.
This assignment requires two to three pages in length, based upon the APA style of writing.
Use transition words; a thesis statement; an introduction, body, and conclusion; and a reference page with at least two references. Use double-spaced, Arial font, size 12
Fundamental security properties
Fundamental security properties
Computer Network Security
1. List the three fundamental security properties and for each give an example of
failure. Justify your answer based on literature.
2. Reports of computer security failures appear frequently in the daily news.
Research and summarise the article that exemplifies one (or more) of the
principles: easiest penetration, adequate protection, effectiveness, weakest link.
Ensure the link and full reference is included.
3. Explain why asynchronous I/O activity is a problem with many memory protection
schemes, including base/bounds and paging. Suggest a solution to the problem.
4. An electronic mail system could be used to leak information. First, explain how
the leakage could occur. Then, identify controls that could be applied to detect or
prevent the leakage. Justify your answer based on literature.
5. A computer system provides protection using the Bell-La Padula policy. How would
a virus spread if:
• the virus were placed on the system at system low (the compartment that all other
compartments dominate)?
• the virus were placed on the system at system high (the compartment that
dominates all other compartments)?
6. In reference to access control explain the meaning the terms “granularity”.
Discuss the trade-off between granularity and efficiency
Automating compliance with federal information security
Automating compliance with federal information security
Computer Network Security
For this assignment, you will be writing a project based on Case 5 “SRA
International, Inc.: Automating Compliance with Federal Information Security
Requirements,” on page 115 of the text Information Security: Contemporary Cases.
Also, you will be creating a PowerPoint presentation that explains the information
that you wrote in your project.
a) Write a report based on the case study, particularly addressing the questions on
pages 156 and 157 of the text. Please do not provide answers to the questions with
numbers; instead, write a report addressing those questions in essay format. The
written report should be at least five pages long, but not more than seven pages.
It must use a 12-point font, single line spacing, and 1″ margins (left, right, top,
and bottom). You may use articles from in the endnotes on pages 153-155, or any
additional sources if you wish. All references must be cited using APA format.
b) Create a PowerPoint presentation explaining the questions and issues raised in
the case study. The purpose of the PowerPoint is to simulate what you would use
during a presentation in a work environment to describe the suggestions, answers,
and issues you covered in your written report. The PowerPoint should be at least 15
slides long, but no more than 20. Avoid the overuse of distracting backgrounds,
make the writing easy to read, and include only essential information in the
slides.
Explain the most common forms of digital crime.
Write a three to four (3-4) page paper in which you:
Explain the four (4) major categories of computer crimes, and provide at least one (1) example for each.
Explain the most common forms of digital crime.
Determine the category of computer crimes or cyber terrorism that presents the greatest overall threat at the present time. Provide a rationale to support your response.
Summarize the roles and responses that the U.S. government, court systems, and law enforcement agencies in combatting computer crime.
Next, suggest one (1) additional way-i.e., one not discussed in the textbook-that the law enforcement agencies can better counteract computer crime.
Use at least three (3) quality references for this assignment. Note: Wikipedia and similar Websites do not qualify as quality resources.
Cryptography /Computer Network Security
Cryptography /Computer Network Security
Computer Network Security
Let n=pq, where p,q are primes of the same length and let phi be Euler’s totient
function.
Consider the following problems: (P1) computing the output p from an input n; (P2)
computing the output phi(n) from an input n. Which one of the following statements
is true?
A. if P1 is easy then P2 is easy
B. if P1 is hard then P2 is hard
C. P1 and P2 are polynomial-time equivalent
D. All of the above
2 Question 2 of 16
Consider the problem of computing discrete logarithms in a cyclic group (G,?), with
group’s order m; that is, given the group’s generator g, an element y ∈ G, compute
an integer x ∈ Zm such that g ? • • • ? g = y, where there are x − 1 occurrences of
?. Then consider the exhaustive search algorithm to search for the discrete
logarithm of y in base g for a cyclic group G of order m. Given this algorithm and
its running time t(m,n), we want to infer considerations on computing discrete
logarithm in G being easy or conjectured to be hard depending on the choices of m
as a function of the length n of the group elements. Let m_easy(n) be a value for m
such that computing discrete logarithms in G is easy and m_hard(n) be a value for m
such that computing discrete logarithms in G may be conjectured to be hard. Which
functions would you select as most meaningful for m_easy(n), m_hard(n)?
A. m_easy(n)=O(n); m_hard(n)=omega(n)
B. m_easy(n)=O(poly(n)); m_hard(n)=O(poly(n))
C. m_easy(n)=O(poly(n)); m_hard(n)=omega(poly(n))
D. m_easy(n)=O(n); m_hard(n)=O(n)
3 Question 3 of 16
You plan to use a public-key cryptosystem based on the RSA trapdoor permutation in
three different real-life applications, in which the attacker has, respectively,
only one of the following resources: (1) a single computer, (2) a collection of
computers distributed across the Internet, and (3) a quantum computer. When
choosing the length of the modulus n for the RSA trapdoor permutation, you plan to
choose a different length for each of the above three attacker resource scenarios.
Which of the following length settings is closer to your choice?
A. (a): 1024; (b): 2048; (c): 4096
B. (a): 512; (b): 1024; (c): I would not use RSA
C. (a) 2048; (b): 4096; (c): I would not use RSA
D. (a) 512; (b): 1024; (c): 2048
4 Question 4 of 16
Consider the following three assumptions:
1) The hardness of factoring integers that are product of two primes of the same
length
2) The hardness of computing discrete logarithms modulo primes
3) The hardness of inverting the RSA function.
Which of them is sufficient to construct a trapdoor function?
A. Only (1)
B. Only (2)
C. Only (3)
D. (1), (2), or (3)
5 Question 5 of 16
Let us denote as “X ci Y” the fact that random variables X and Y are
computationally indistinguishable. Assume (A1,A2) is a pair of efficiently
samplable (i.e., a variable sample can be efficiently generated) random variables
and assume the same about (B1,B2). Which of these conditions is sufficient to have
that (A1,A2) ci (B1,B2)? (Hint: Recall that when two random variables X and Y, the
probability that X=x conditioned on Y=y is equal to the probability that X=x.)
A.A1 and A2 are independent, B1 and B2 are independent, A1 ci B1, A2 ci B2
B.A1 ci B1, A2 = A1, B2 = B1
C.A2 ci B2, A1 = A2, B1 = B2
D.All of the above
6 Question 6 of 16
Consider the following three assumptions:
1) The hardness of factoring integers that are product of two primes of the same
length
2) The hardness of computing discrete logarithms modulo primes
3) The hardness of inverting the RSA function.
Which of them is sufficient to construct a pseudo-random generator, a pseudo-random
function and a pseudo-random permutation?
A. Only (1)
B. Only (2)
C.Only (3)
D.(1), (2), or (3)
7 Question 7 of 16
Which among these are the differences between the perfect indistinguishability
notion for classical symmetric encryption schemes and the (computational)
indistinguishability notion for modern symmetric encryption schemes?
A. In perfect indistinguishability the adversary’s algorithm runs in polynomial
time and his advantage can be greater than 0 while in computational
indistinguishability the adversary’s algorithm is not restricted to run in
polynomial time and his advantage has to be equal to 0
B. In perfect indistinguishability the adversary’s algorithm is not restricted to
run in polynomial time and his advantage can be greater than 0 while in
computational indistinguishability the adversary’s algorithm runs in polynomial
time and his advantage has to be equal to 0
C. In perfect indistinguishability the adversary’s algorithm is not restricted to
run in polynomial time and his advantage has to be equal to 0 while in
computational indistinguishability the adversary’s algorithm runs in polynomial
time and his advantage can be greater than 0
D. In perfect indistinguishability the adversary’s algorithm runs in polynomial
time and his advantage has to be equal to 0 while in computational
indistinguishability the adversary’s algorithm is not restricted to run in
polynomial time and his advantage can be greater than 0
8 Question 8 of 16
Assume |s1|=|s2|=n and consider the functions defined, for any s1 and s2, as:
(a) G1(s1,s2)=s1 xor s2, (b) G2(s1,s2)=(s1, s2, s1 xor s2).
We have that:
A.G1 and G2 are pseudo-random generators because their outputs are uniformly (and
thus, pseudo-randomly) distributed if so are their input
B.G1 and G2 are not pseudo-random generators because either their outputs are not
longer than their inputs or there exists a statistical test that distinguishes
their outputs from a random string of the same length
C.G1 and G2 are not pseudo-random generators because either there exists an
efficient algorithm that can compute their input from their output or their outputs
are not longer than their inputs
D.G1 and G2 can be proved to be pseudo-random generators using a proof by reduction
9 Question 9 of 16
Let us denote as “X ci Y” the fact that random variables X and Y are
computationally indistinguishable.
For any random variables X,Y,Z, consider the statements:
(a) if X ci Y then Y ci X,
(b) if X ci Y and Y ci X then X = Y,
(c) if X ci Y and Y ci Z then X ci Z,
(d) if X = Y then X ci Y,
(e) if X ci Y then X = Y.
Which of them are true?
A. (a), (c) and (d)
B.(b), (c) and (d)
C. (b), (c) and (e)
D.(a), (d) and (e)
10 Question 10 of 16
To prove that a permutation P is not a pseudo-random permutation, it suffices to
show an efficient oracle adversary that can distinguish, with not negligible
probability, the case in which its oracle is P from the case in which its oracle is
a random permutation RP with the same input and output domains. To obtain an
algorithm that makes this distinction, it suffices to find a distinguishing
condition (or a set of them) among the adversary’s query inputs and query outputs
such that: (a) if the oracle is P, then the condition holds with high (e.g., 1)
probability; (b) if the oracle is RP, then the condition holds with low (e.g.,
negligible) probability. Define the extended FT transform as the permutation that
maps (L,M,R) to (R,f_k(R) xor M,f_k(M) xor L), where k is a random key, f is a
pseudo-random function, and L,M,R are n-bit strings. Which of the following
conditions are distinguishing conditions for the 1-round iteration and 2-round
iteration of the extended FT transform, respectively? Notation: (L’,R’) and
(L”,R”) denote the 1-round and 2-round outputs, respectively, of the FT transform
on input (L,R); when we run the transform on different inputs, we use the notations
(L0,R0), (L1,R1), …. for the inputs, (L0′,R0′), (L1′,R1′), …. for the 1-round
outputs and (L0”,R0”), (L1”,R1”), …. for the 2-round outputs.
The notation for the extended FT transform is analogously defined.
A. 1-round extended FT: (L’=R); 2-round extended FT: (L0 xor L1 = L0” xor L1”)
and (R0=R1)
B. 1-round extended FT: (L’=M); 2-round extended FT: M0=M1, L0=L1 and L0”=L1”
C. 1-round extended FT: L=M=R, and R’=M’; 2-round extended FT: L=M=R, and L”=M”
D. None of the above
11 Question 11 of 16
Which among these are the differences between the indistinguishability notion with
chosen message attack and the indistinguishability notion with adaptive chosen
message attack?
A. In the indistinguishability with chosen message attack notion, the adversary can
additionally and repeatedly query the E(k,.) algorithm as an oracle even after
seeing the ciphertext and can later use these queries and responses to generate its
guess for which message was encrypted as c
B. In the indistinguishability with chosen message attack notion, the adversary can
additionally and repeatedly query the E(k,.) algorithm as an oracle even after
seeing the ciphertext but cannot later use these queries and responses to generate
its guess for which message was encrypted as c
C. In the indistinguishability with adaptive chosen message attack notion, the
adversary can additionally and repeatedly query the E(k,.) algorithm as an oracle
even after seeing the ciphertext and can later use these queries and responses to
generate its guess for which message was encrypted as c
D. In the indistinguishability with adaptive chosen message attack notion, the
adversary can additionally and repeatedly query the E(k,.) algorithm as an oracle
even after seeing the ciphertext but cannot later use these queries and responses
to generate its guess for which message was encrypted as c
12 Question 12 of 16
Let G:{0,1} n–>{0,1} 2n be a pseudo-random generator and consider the following
encryption scheme (KG,E,D), where KG generates a random string k; E, on input key k
and a message bit b, returns c = G(k) xor 1 2n if b=1 or c = G(k) if b=0 and D is
naturally defined so to satisfy the decryption correctness property.
Which of the following security notions is satisfied by (KG,E,D)?
A. security in the sense of indistinguishability
B. security in the sense of indistinguishability against chosen message attack
C. security in the sense of indistinguishability against adaptive chosen message
attack
D. none of the above
13 Question 13 of 16
Let F:{0,1}^n–>{0,1}^{n} be a pseudo-random function and consider the following
encryption scheme (KG,E,D), where KG generates a random string k; E, on input key k
and a string m, returns c =F(k,0) xor m and D is naturally defined so to satisfy
the decryption correctness property.
Which of the following security notions is satisfied by (KG,E,D)?
A. security in the sense of indistinguishability
B. security in the sense of indistinguishability against chosen message attack
C. perfect secrecy
D. none of the above
14 Question 14 of 16
Let P:{0,1}^n–>{0,1}^n be a pseudo-random permutation and consider the following
encryption scheme (KG,E,D), where KG generates a random string k; E, on input key k
and an n-bit string m, returns c =P(k,m) and D is naturally defined so to satisfy
the decryption correctness property. Which of the following security notions is
satisfied by (KG,E,D)?
A. security in the sense of indistinguishability
B. security in the sense of indistinguishability against chosen message attack
C. perfect secrecy
D. none of the above
15 Question 15 of 16
Consider the following three assumptions:
1) The hardness of factoring integers that are product of two primes of the same
length
2) The hardness of computing discrete logarithms modulo primes
3) The hardness of inverting the RSA function.
Which of them is sufficient to construct a one-way function?
A. Only (1)
B. Only (2)
C. Only (3)
D. (1), (2), or (3)
Analyse the various approaches for mitigating security risk
Analyse the various approaches for mitigating security risk
Computer Network Security
Specific issues that you need to address in the forum discussions are provided
within the first 3 topics. These questions are posed for you to reflect on in the
form of written Discussion Board (forum) posts. As this is a postgraduate course,
it is expected that your written responses will provide you an opportunity to
express your personal and professional views. There are no correct answers, however
the way you justify your answers with validated evidence is key to this activity.
Post your forum entries as you are prompted within the topics. Your Subject Co-
ordinator will respond to your first forum post, and monitor and moderate as
required the remaining 2 posts.
You must curate, collect and save your responses in a word document to be submitted
on EASTs. This activity’s final mark will be provided prior to the final assessment
item. Rationale As this is a graduate course, more is expected from students in the
way of participation, and further as a graduate reading course, the opinions of
students are actively sought to demonstrate that the reading material has been
read, understood and provoked a response.
The readings on a given topic will in general not agree on all issues in the topic,
such as the role and feasibility of cyber-insurance, and soliciting written
responses from students gives an opportunity for expressing opinions from the
professional experience of each student. Also being a distance course, regular
posting on the forum promotes the cohesion of the cohort and a notion of group
learning for this course.
This assignment is for students to meet parts of the following learning outcomes.
Be able to critically analyse the various approaches for mitigating security risk,
including when to use insurance to transfer IT risk; be able to critically evaluate
IT security risks in terms of vulnerabilities targeted by hackers and the benefits
of using intrusion detection systems, firewalls and vulnerability scanners to
reduce risk.
1250 words
7 references
References –
1. Asgharpour, F., Liu, D., & Camp, L. J. (2007). Mental models of security risks.
In Financial cryptography and data security : lecture notes in computer science
(pp. 367-377). Berlin ; New York : Springer.
2. Day, K. (2003). Inside the security mind : making the tough decisions. (329
pages). Upper Saddle River, N. J : Pearson Education.
3. Perception of Risk
Author(s): Paul Slovic
Source: Science, New Series, Vol. 236, No. 4799 (Apr. 17, 1987), pp. 280-285
Published by: American Association for the Advancement of Science
Stable URL: http://www.jstor.org/stable/1698637.