1. Develop an attack tree for gaining access to customer account details from thedatabase of a bank.2. You are a junior IT executive at your department dealing with the DES encryptionkey. From the random key generator, you are given the(EOE0E0E0F1F1F1F1)hex to encrypt a message.secret keyi.What is the output of the key after it is applied with the parity bit drop processbox in Figure 1? At this point, is it a strong or weak key? Please state yourreason.Using the key-permutation compression 2 from Figure 2, decide whether thisis a strong or weak key. Justify your answer.ii.5749332517095850423426181002595143352719036052443663554739312315076254463830221406615345372921130528201204Figure 1: Parity bit drop1417240105032815062110231912042608160727201302415231374755304051453348444939563453464250362932Figure 2: Key-Permutation Compression 2

Due to the honor code, I can solve only the first question. Please resubmit the second question. 1.…

1. Develop an attack tree for gaining access to customer account details from the database of a bank. 2. You are a junior IT executive at your department dealing with the DES encryption key. From the random key generator, you are given the secret key (E0E0E0E0F1F1F1F1)hex to encrypt a message. i. What is the output of the key after it is applied with the parity bit drop process box in Figure 1? At this point, is it a strong or weak key? Please state your reason. ii. Using the key-permutation compression 2 from Figure 2, decide whether this is a strong or weak key. Justify your answer. 57 49 41 33 25 17 01 58 50 42 34 26 18 10 02 59 51 43 35 27 19 03 60 52 44 36 63 55 47 39 31 23 15 07 62 54 46 38 30 22 14 06 61 53 45 37 29 21 13 05 28 20 12 04 Figure 1: Parity bit drop 14 17 24 01 05 03 28 15 06 21 10 23 19 12 04 26 08 16 07 27 20 13 02 41 52 31 37 47 55 30 40 51 45 33 48 44 49 39 56 34 53 46 42 50 36 29 32 Figure 2: Key-Permutation Compression 2

1. Develop an attack tree for gaining access to customer account details from the database of a bank. 2. You are a junior IT executive at your department dealing with the DES encryption key. From the random key generator, you are given the secret key (E0E0E0E0F1F1F1F1)hex to encrypt a message. i. What is the output of the key after it is applied with the parity bit drop process box in Figure 1? At this point, is it a strong or weak key? Please state your reason. ii. Using the key-permutation compression 2 from Figure 2, decide whether this is a strong or weak key. Justify your answer. 57 49 41 33 25 17 01 58 50 42 34 26 18 10 02 59 51 43 35 27 19 03 60 52 44 36 63 55 47 39 31 23 15 07 62 54 46 38 30 22 14 06 61 53 45 37 29 21 13 05 28 20 12 04 Figure 1: Parity bit drop 14 17 24 01 05 03 28 15 06 21 10 23 19 12 04 26 08 16 07 27 20 13 02 41 52 31 37 47 55 30 40 51 45 33 48 44 49 39 56 34 53 46 42 50 36 29 32 Figure 2: Key-Permutation Compression 2

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

Modes of operation such as CFB and CBC require the use of an initial variable (IV), which must be known by both the sender and receiver. Discuss the pros and cons of the following suggestions for selection of IVs Randomly generate each IV; Use a counter that is incremented after each message as the IV; Use the last ciphertext block of the previous message as the IV
Encrypt the first 4 letters of your last name as a block of data to be encrypted. (Let A=1, B=2, C=3,...Z=26). Decrypt the encrypted number to demonstrate that your system works. lastname is john
Design a cryptographic solution for implementing the dinning cryptographers protocol. You should consider the following: The secret messages shared between any two agents in the protocol are communicated over public channels only. The announcements made by each agent must be traceable in a trustworthy way to that agent. Your solution should be a new protocol that addresses the above two requirements.
Alice uses RSA to send a key to Bob for use in encryption of future messages. The key is the word "CINEMA" and the encoding from letters to numbers is done using the ASCII: A = 65... Z = 90, space = 99. The public parameters (n, e) = (9379, 11) are shared. Encrypt Alice's key word, using 2-letter blocks. Please show work.
Write a program (in JAVA) that gives the user options to encrypt and decrypt with DES and AES. The program should further offer the user to select a block mode from the options: ECB, CBC, OFB, CFB, and CTR. Your program should be able to work with any length of plaintext message.
The operator of a Vigenere encryption machine is bored and encrypts a plaintext consisting of the same letter of the alphabet repeated several hundred times. The key is a seven-letter English word. Eve knows that the key is a word but does not yet know its length. What property of the ciphertext will make Eve suspect that the plaintext is one repeated letter and will allow her to guess that the key length is seven? What will the number of matches be for the different displacements?
2. Create your own encrypted message using a standard transposition code. Show the work below, and write the key, the message, and the encrypted message. Key: Message: Encrypted message:
Encrypt the message " MATH " by translating the letters into numbers and then applying the encryption function given, and then translating the numbers back into letters. (a) ?(?)=(7?+2) mod 26f(p)=(7p+2) mod 26 (b) ?(?)=(7?+14) mod 26f(p)=(7p+14) mod 26
Alice and Bod have decided to use a symmetric encryption algorithm. They have some assumptions about their messages:- Messages only contain capital letters (i.e. A to Z)- The length of their shared key must be greater than or equal to the length of the plaintext- They assign each letter a number as follows: (A,0), (B,1), (C,2), (D,3),…, (Z,25)Their algorithm combines the key and the message using modular addition. The numerical values of corresponding message and key letters are added together, modulo 26. For example, if the plain text is “HELLO” and the key is “SECRET” then the encrypted message is calculated as following:Since the length of the plaintext is 5, we just need the first 5 letters of the key (i.e. “SECRE”), then for each letter, we should add corresponding letters in both the plaintext and the key modulo 26.Plaintext: H (7) E (4) L (11) L (11) O (14)Key: S (18) E (4) C (2) R (17) E(4)Cipher: Z (25) I (8) N(13) C(2) S (18) Write a program in Python, C/C++ or JavaScript to…
Affine Cipher is an example of a Monoalphabetic substitution cipher. The encryption process is substantially mathematical done by using the following formula: C = (P ∗ ?1 + ?2) mod 26. Where k1, k2 are two integers representing the key (selected randomly), C is the ciphertext value, and P is the plaintext value. Where C and P integers with values between 0 and 25. 1) Write an Octave programme to implement this system, run your programme using the Plaintext: “the quick brown fox jumped over the lazy dog”. Show the obtained ciphertext with the selected values of the keys k1 & k2. 2) Given that the plaintext “s” mapped to ciphertext “W”, plaintext “x” mapped to ciphertext “Z” when encrypted with Affine Cipher. Determine, mathematically, the values for the two keys K1 and K2. I need an octave code for the first part of this question, that i can just copy and paste. In addition, to an explanation of the steps done to…
If you're sending a huge file, you'll need to use cypher block chaining or cypher feedback mode. By how much is one more efficient?