首页
网站开发
桌面应用
管理软件
微信开发
App开发
嵌入式软件
工具软件
数据采集与分析
其他
首页
>
> 详细
158.235语言辅导、Java,c++程序辅导
项目预算:
开发周期:
发布时间:
要求地区:
158.235 Networks, Security, and Privacy
Assignment 2
Deadline 18 October 2021, Monday, 23:59pm
Evaluation 25 marks (= 25% of your final grade)
Late
submission
1 mark off per day late
Work This assignment must be done individually. Your submission will be
checked for plagiarism against other assignments.
Purpose To demonstrate student’s understandings in the concepts and constructs of
security and privacy.
Submission A report (PDF) that contains the answers for Question1 – 4 must be
submitted. GNS files for Question 4 also need to be submitted.
[Start of Questions]
Question 1: Understanding and Predicting Threats
[Total 6 Marks]
Carefully read the following two reports from the leading security firms (available for
downloads from the stream website).
1. Sophos 2021 Threat Report
2. McAfee Labs Threat Report 2021
Question 1.1: What are the top THREE growing threats in your opinion? Provie a
summary of threat, impact, potential mitigation techniques & limitations, and future
direction to address the concern, for each threat (Maximum 1 page for each case). You
may need further research to find mitigations and future technologies that may be useful in
stopping the threats.
Question 1.2: Which of the recent technologies are most exploited and why do you think
they become the growing target? (Maximum 1 page)
Question 2: Brute Forcing Keys.
[Total 6 Marks]
One way to decrypt an encrypted message is to try every possible key. This kind of attack
is known as a brute-force attack or a key search attack. The longer the key, the harder the
attack becomes.
The table below lists some common cryptographic algorithms and the key sizes that they
use:
Cipher Key Size
Data Encryption Standard (DES) 56 bits
Rivest Cipher 4 (RC4) 40-2048 bits
Advanced Encryption Standard (AES) 128, 192 or 256 bits
Cipher Key Size
Blowfish 32- 48 bits
The length of the key is a key factor when evaluating how likely it is than an attacker can
determine the key used to encipher a message. This is because an attacker who is in
possession of a sealed message can always mount a brute-force attack. Since longer keys
have more possible values than shorter keys, longer keys are more resistant to brute-force
attacks. (Note: this assumes there are no flaws in the cryptographic algorithm that
weakens them)
In general, because a key of n bits can have 2
n
possible values (where a
^
b means a to the
power of b), there can be at most 2
n
different keys. For example, a 16-bit key can have
216 or 65,536 different values. If you had a computer that could try 100 of these keys
every second, it would take 654 seconds or roughly 11 minutes to try all possible keys.
(Note: if you are cracking many keys, the expected time to crack any given key is half that,
as on average you will need to try half of the keys before you find the right one. Of course
you could get lucky and try the key on your first attempt, or you could be unlucky and
have to try nearly every single key.)
With clever programming a modern desktop computer can try roughly 1 million RC4 keys
every second. (Indeed, there are services available that will use multiple computers and
specialised hardware to speed up brute forcing of keys for specific cryptographic
algorithms, such as crack.sh.
Question 2.1: Microsoft Office 1997-2003 used 40-bit RC4 to protect documents with a
user-supplied password. This was due to the export of cryptographic technology and
devices from the United States were severely restricted by U.S. law at the time.
What is the maximum amount of time that it would take for a computer that can try 1
million RC4 keys every second to do a brute-force attack on a Microsoft Office document
protected using a 40-bit shared secret?
Question 2.2: Microsoft Office 2007 onwards allows the use of the AES cryptographic
algorithm with a 128-bit shared secret to protect access to documents. If AES keys can be
tried with the same speed as RC4 keys using the computer described in Question 1.1, what
is the maximum amount of time that it would take for a brute-force attack on a single
document?
Question 2.3: With advances in quantum computing it may be possible at some point in
the future to build a computer that can implement Grover's algorithm than gives a
reduction in time from n to the square root of n. For example, AES-128 has a 128-bit key
requiring 2128 tries. Grover reduces this to 264 tries.
If you upgrade your computer to quantum computer that can implement Grover's
algorithm, is your secret still safe from attack? Justify your answer. (Note: assume that it
can check AES keys at the same rate as before).
Question 3: Stealing the Examination
[Total 6 Marks]
As part of your preparation for the upcoming examination, you have the goal of stealing a
copy of the 158.235 examination.
*Note that this is a thought experiment that is you should not try it out in real life.
When preparing the exam, the files are stored on the IT servers in a private directory only
accessible to academic and examination admin staff (e.g., Julian and Sunil). All staff use
their Massey username and passwords to authenticate themselves and gain access. A
physical copy of the examination is also stored in the School office in a locked file cabinet
and in the Science Faculty office in a locked room. Neither Julian nor Sunil has copies of
the examination stored in their offices.
If you are permitted to only use publicly available information when building your
profile, describe a scenario explaining how you use the social engineering techniques, e.g.,
phishing, pre-texting, baiting, quid pro quo and tailgating, —as described in the lecture—
to achieve your goal.
Note that you do not need to include filenames or directory name but you should be as
specific as possible in your answer.
Question 3.1: Name the human target or target(s) for the scenario.
Question 3.2: Identify ONLY the information necessary for the attack, the reason why
each piece of information is required and the source of the information (provide URLs
where appropriate).
Question 3.3: What are the steps describing how you will carry out the attack? These
should be written such that you could provide these steps plus the previous information to
a third party to carry out the attack.
Question 3.4: Describe which of the concepts from the course that have been applied in
your attack (you should use at least one!).
Question 4: Setting Up a Firewall and a NAT
[Total 7 Marks]
Understanding the importance of protecting organisation’s assets (data, network, software
and hardware), Cyber University wants to strengthen its security posture by installing a
firewall to filter any unwanted traffic.
The Cyber University has two subnets:
(1) Student subnet with network address 192.168.5.128 /25 which can accommodate
126 hosts (add only 3 PCs to Packet tracer – see Figure 1)
(2) HR subnet with network address 192.168.5.0 /25 which can accommodate 126
hosts (add only 2 PCs to Packet tracer – see Figure 1)
Cyber security can access to a Third Party Finance network for financial affairs, the
Finance network includes 3 PCs.
Question 4.1: Access-list
Your task is to build a firewall, using the Packet Tracer, for the Cyber University that
satisfies the following firewall policy (networks are given in Figure 1).
Source Network Hosts IP Destination Network Hosts IP Action
192.168.5.128 /25 any 192.168.5.0 /25 any Deny
192.168.5.0 /25 any 192.168.11.0 /24 any Allow
Note that you need to use DHCP to give dynamic IP addresses to the Hosts in each
network.
Question 4.2: NAT
Cyber University would also like to employ Network Address Translation (NAT) to shield
the private network from the public network. Your task it to build a NAT, using the Packet
Tracer, for the Cyber University that satisfies the following address translation table.
Describe in the report how private addresses can be protected when the messages from
these private addresses are going out through the Internet.
Private Address Public Address NAT
Cyber
University
192.168.5.* (all hosts) 208.150.100.20-25 /24 NAT Pool
Third Party
Finance
Company
192.168.11.0 /24 (all hosts) 208.150.100.30 /24 Nat overload translation (port)
Submit two separate GNS3 packages for Question 4.1 and Question 4.2.
Figure 1: Cyber Security Network (Question 3)
Note that this figure only illustrates the network, you need to implement this network in GNS3 and
label the PCs
[End of Questions]
软件开发、广告设计客服
QQ:99515681
邮箱:99515681@qq.com
工作时间:8:00-23:00
微信:codinghelp
热点项目
更多
代写dts207tc、sql编程语言代做
2024-12-25
cs209a代做、java程序设计代写
2024-12-25
cs305程序代做、代写python程序...
2024-12-25
代写csc1001、代做python设计程...
2024-12-24
代写practice test preparatio...
2024-12-24
代写bre2031 – environmental...
2024-12-24
代写ece5550: applied kalman ...
2024-12-24
代做conmgnt 7049 – measurem...
2024-12-24
代写ece3700j introduction to...
2024-12-24
代做adad9311 designing the e...
2024-12-24
代做comp5618 - applied cyber...
2024-12-24
代做ece5550: applied kalman ...
2024-12-24
代做cp1402 assignment - netw...
2024-12-24
热点标签
mktg2509
csci 2600
38170
lng302
csse3010
phas3226
77938
arch1162
engn4536/engn6536
acx5903
comp151101
phl245
cse12
comp9312
stat3016/6016
phas0038
comp2140
6qqmb312
xjco3011
rest0005
ematm0051
5qqmn219
lubs5062m
eee8155
cege0100
eap033
artd1109
mat246
etc3430
ecmm462
mis102
inft6800
ddes9903
comp6521
comp9517
comp3331/9331
comp4337
comp6008
comp9414
bu.231.790.81
man00150m
csb352h
math1041
eengm4100
isys1002
08
6057cem
mktg3504
mthm036
mtrx1701
mth3241
eeee3086
cmp-7038b
cmp-7000a
ints4010
econ2151
infs5710
fins5516
fin3309
fins5510
gsoe9340
math2007
math2036
soee5010
mark3088
infs3605
elec9714
comp2271
ma214
comp2211
infs3604
600426
sit254
acct3091
bbt405
msin0116
com107/com113
mark5826
sit120
comp9021
eco2101
eeen40700
cs253
ece3114
ecmm447
chns3000
math377
itd102
comp9444
comp(2041|9044)
econ0060
econ7230
mgt001371
ecs-323
cs6250
mgdi60012
mdia2012
comm221001
comm5000
ma1008
engl642
econ241
com333
math367
mis201
nbs-7041x
meek16104
econ2003
comm1190
mbas902
comp-1027
dpst1091
comp7315
eppd1033
m06
ee3025
msci231
bb113/bbs1063
fc709
comp3425
comp9417
econ42915
cb9101
math1102e
chme0017
fc307
mkt60104
5522usst
litr1-uc6201.200
ee1102
cosc2803
math39512
omp9727
int2067/int5051
bsb151
mgt253
fc021
babs2202
mis2002s
phya21
18-213
cege0012
mdia1002
math38032
mech5125
07
cisc102
mgx3110
cs240
11175
fin3020s
eco3420
ictten622
comp9727
cpt111
de114102d
mgm320h5s
bafi1019
math21112
efim20036
mn-3503
fins5568
110.807
bcpm000028
info6030
bma0092
bcpm0054
math20212
ce335
cs365
cenv6141
ftec5580
math2010
ec3450
comm1170
ecmt1010
csci-ua.0480-003
econ12-200
ib3960
ectb60h3f
cs247—assignment
tk3163
ics3u
ib3j80
comp20008
comp9334
eppd1063
acct2343
cct109
isys1055/3412
math350-real
math2014
eec180
stat141b
econ2101
msinm014/msing014/msing014b
fit2004
comp643
bu1002
cm2030
联系我们
- QQ: 9951568
© 2021
www.rj363.com
软件定制开发网!