IT Security

   1. To preserve knowledge, one must preserve across potential poison threats True/False clear your answer 2. Which are the imbecilityes of a transfer nothing? A.  Natural discourse note abundance makes them lenient to decode.  B. The compute of notes in the alphabet makes them lenient to decode. C.  Once the transfer is fixed the communication is decoded. D.  Once you accept the principle book you can deprinciple the communication instantly E. A&B F. A, B & C G. A, B, C and D H. A & C No deduce required 3. What is the object of the new-fashioned cryptography? _________________ A. the laws of mathematics  B. composture of data C. creating disguises for knowledge  D. none of the aloft Reason: 4. Historically, the elementary and compelling deduce for advances in cryptography has been _____________. a. preserveing vocation assets b. the insufficiency for personal privacy c. wars d. maintenance prudent conversations covert Reason: _ 5. A _______________ requires that the nothing alphabet changes throughout the encryption manner. a. monoalphabetic superabundance nothing b. polyalphabetic superabundance nothing c. quantum nothing d. alphanumeric transfer nothing Reason: _ 6. one of the Network threats is    A. buffer overflow B. slowing the computer C. rejection of service  D. computer lock up how it happens: _ 7. Risk is __. A. a imbecility in the classification B. a particular that may object privation or is potential danger C. is a snare that can be exploited  D. Nothing to irritate about Reason: _ 8. The safety of a classification is impaired beobject of. a. require for keys b. faith decrease c. snare to risks d. bad weather Reason: _ 9. The _______ controls the exercise of the algorithm. a. The assent-tor  b. the diffusiveness of the obvious quotation c. nothing quotation d. key Reason: _ 10. What has grace a elder web amount delay i-elation to safety? a. mapping attacks b. on-line surveys c. user ignorance d. scripting errors  Reason: _    ______________________________________________________________________________Part II (6 points each, Total 30) Q1a  Complete the aftercited Truth Table: F denotes sophistical and T denotes true    A B C=A or B D= A xor B E= A and B   F F   F T   T T   T F Q1b In the aftercited Θ denotes one of the aftercited operators: ’or’, ‘xor’ or ‘and’. Input1 Θ input2 = Result  where, input1 and, Inpuut2 are ‘A’ and ‘B’ and Upshot is one of C, D, or E from the aloft board. Which exercise get relinquish? (what is Θ?) input1 Θ upshot = input 2  input2 Θ upshot = input 1 Please demonstration probation for one, or contradict other two Hint: Check  Input1 OR upshot = Input2? Input2 OR upshot = Input1? For upshots C, D and E, and inputs A and B Repeat replacing OR delay AND, and XOR As before-long as the ardent operator is not conclusive for an exercise go to the instant operator. Q2  Using the English alphabet (i.e., mod 26 arithmetic) let obviousquotation = {p1, p2, pn} and similar nothing quotation = {c1, c2, cn}.  Suppose the encryption employment is ci = pi + 6 (mod 26).  You assent-to the nothing quotation communication ASAIOYZNKHKYZYINUUR What is the decryption employment, and the decrypted/recovered obvioustext?  What expression of nothing is this?  Show all your steps.  Q3 You are Alice. You accept agreed delay your ally Bob that you get use the Diffie-Hellman notorious-key algorithm to change covert keys. You and Bob accept agreed to use the notorious ignoble g = 9 and notorious modulus p = 817.   You accept covertly excellent the rate SA = 23 You originate the meeting by casting Bob your conducive rate of TA. Bob responds by casting you the rate TB = 272.  What is the rate of TA  What is the rate of your shared covert key? Can you conjecture Bob’s covert rate SB and what it would be?  Show each and full step of your circumspections, if you use Excel or any other course of mod circumspection, embrace the spreadsheet or the steps in that course (for mod circumspection, the aftercited sameness may be useful Mod ( X^n, p) = mod [mod(X,p)*mod(X^n-1, p), p]  mod(X*Y,p) = mod[mod(X,p)*mod(Y,p),p] Q4 Bob believes that he has succeed up delay a nifty hash employment. He assigns a numeric rate VChar to each note in the alphabet resembling to the note’s posture in the alphabet, i.e., VA = 1, VB = 2, …, VZ = 26. For a communication, he calculates the hash rate H = (VChar 1 x VChar 2 x VChar 3 …x VChar N) mod (26).  Bob uses this employment to cast a one-word communication, Koinonia to his supervisor Bill, concurrently delay his conducive hash rate for the communication. Alice is cogent to catch the communication and generates an resource communication that has a hash rate that collides delay Bob’s peculiar hash rate.  Give restrictedation and properties of the hash employment.  Show a communication that Alice may accept used to spoof Bob’s communication and teach that its hash rate collides delay Bob’s peculiar hash. Q5 Consider the aftercited obviousquotation communication: IT IS EXCITING TO KNOW THAT WE MAY HAVE FOUND THE MISSING MATTER IN THE UNIVERSE. a. (3 pts) If this communication is sent unencrypted and successfully assent-tod, what is its entropy? And why? b. (3 pts) If this communication is encrypted delay DES using a aimless 56-bit key, what is the encrypted communication’s entropy?  And why ______________________________________________________________________________ Part III Essay Question: Length: 800- 900 words. Use APA format for in-line citations and references. (30 pts.) Compare and dissimilarity symmetric and asymmetric encryption algorithms.  · Your defense should embrace a brief overview of the cryptographic object for each expression of algorithm, and a similitude of their strengths and vulnerabilities.  · Describe how a hacker energy go about cracking a communication encrypted delay each expression of algorithm.  · Suggest a restricted impression for each expression of algorithm (symmetric and asymmetric) where the advantages explicitly outbalance the disadvantages.  · Remember to oration all points