CLA204H1 Final: CLA204 Lecture 2 study notes

Consider a very simple symmetric block encryption algorithm in which 32-bits blocks of
plainext are encrypted using a 64-bit key. Encryption is defined as
C = (P⊕K0 ) ⊞ K1

where C = ciphertext, K = secret key, K0 = leftmost 64 bits of K, K1 = rightmost 64 bits of K,
⊕ = bitwise exclusive OR, and ⊞ is addition mod 264
.

a) Show the decryption equation. That is, show the equation for P as a function of C, K0,
and K1.
b) Suppose and adversary has access to two sets of plaintexts and their corresponding
ciphertexts and wishes to determine K. We have the two equations:

C = (P⊕K0 ) ⊞ K1 ; C’

= (P’⊕K0 ) ⊞ K1

First, derive an equation in one unknown (e.g., K0). Is it possible to proceed further to
solve for K0?

Question 11. [5 MARKS] Each code fragment in the table below operates on list L, which has length k where k is very large - at least in the tens of thousands. For each fragment, give an expression in terms of k for how many times happy! is printed, and circle whether the behaviour is constant, linear, quadratic or something else. Code How many times is happy! printed? Complexity (circle one) for i in range (len (L)): print('happy!') for item in L: print('happy!') constant linear quadratic something else for i in range (len(L)) for item in L[:i]: print('happy!' constant linear quadratic something else # Precondition: len(L) % 10 == 0 i = 0 while i < len(L): print("happy!') i = i + len(L) // 10 constant linear quadratic something else for item in L[1000:2000] : print('happy!' constant linear quadratic something else for item in L[10:] : print('happy!' constant linear quadratic something else