Scribd
Upload
121 views1 page

CS574 HW Assignment 1 Solution

This document contains the solutions to homework assignment #1 for a computer security course. It addresses topics like encryption, decryption of ciphertexts, analyzing block and stream ciphers, and calculating the time needed to crack encryption standards like DES and AES. The document provides explanations and solutions to 7 questions on these topics, awarding points for each correct answer.

Uploaded by

Nathan Azoulay
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
121 views1 page

CS574 HW Assignment 1 Solution

This document contains the solutions to homework assignment #1 for a computer security course. It addresses topics like encryption, decryption of ciphertexts, analyzing block and stream ciphers, and calculating the time needed to crack encryption standards like DES and AES. The document provides explanations and solutions to 7 questions on these topics, awarding points for each correct answer.

Uploaded by

Nathan Azoulay
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 1

San Diego State University

CS574 Computer Security


Homework Assignment #1 Solution

1. a. Do no put all of your hopes and resources into one goal or dream (10 points)

2. a. encryption works and properly implemented strong crypto systems are one of the few things
that you can rely on (10 points)

3. For 1 ≤ i ≤ 128, take ci ∈ {0, 1}128 to be the string containing a 1 in position i and then zeros
elsewhere. Obtain the decryption of these 128 ciphertexts. Let m1, m2, . . ., m128 be the
corresponding plaintexts. Now, given any ciphertext c which does not consist of all zeros, there
is a unique nonempty subset of the ci’s which we can XOR together to obtain c.
Let I(c) ⊆ {1, 2, . . ., 128} denote this subset. Observe

Thus, we obtain the plaintext of c by computing. Let 0 be the all-zero string. Note that 0 = 0 ⊕ 0.
From this we obtain E (0) = E (0 ⊕ 0) = E (0) ⊕ E (0) = 0. Thus, the plaintext of c = 0 is m = 0.
Hence, we can decrypt every c ∈ {0, 1}128 (10 points)

4 a. False. AES is a block cipher and not a stream cipher.


4.b. False. In AES, the decryption algorithm is identical to the encryption algorithm.
4.c. Yes, the friend is correct, we will have to design the substitution and permutation carefully
to guarantee the cipher to be strong. (5 points each)

5. a. REHTX EABSM MTLTT HDATL AYTES HNAOT LCTDX PEEEV OGTFI FUITU ELEIM ERRTH IEEAH
NTORH (10 points)

5. b. The two matrices are used in reverse order. First, the ciphertext is laid out in columns in
the second matrix, considering the order dictated by the second memory word. Then, the
contents of the second matrix are read left to right, top to bottom and laid out in columns in the
first matrix, considering the order dictated by the first memory word. The plaintext is then read
left to right, top to bottom. (10 points)

6. To crack a DES encryption, we need: (10 points)


(2^56 key) *100 cycles/60sec/60min/24hour/365days/2000000000hz = 114.246566 years

To crack an AES encryption, we need:


(2^128 key) *100 cycles/60sec/60min/24hour/365days/2000000000hz = 5.39514154 × 10^23
years

7. Hashing. (5 points)
Computing equipment.
Password Encryption.
Email encryption.
File and disk encryption.
Database security.
File transfer.

You might also like