I implemented a prototype of a super fast XOR encryption algorithm. Can you find the cleartext? 84:9a:8f:b2:df:bc:a5:9e:8a:a5:8d:c2:e0:96:88:e0:86:81:b5:df:8f:b2:9a:ce:a1:9d:82:a5:df:9a:af:df:9c:a5:9e:8a:e0:8b:86:a9:8c:c2:e0:86:81:b5:df:9d:b5:9c:8d:a5:8c:9d:a6:8a:82:ac:86:ce:b3:90:82:b6:9a:8a:e0:8b:86:a5:df:8d:a8:9e:82:ac:98:8b:a4:df:c3:ed:df:8c:a1:9b:ce:a1:8c:9d:e1 Unfortunately the prototype currently only supports up to 3 bytes as a key. Furthermore, not all characters can be encrypted. Currently it only works for a-zA-Z,-! and space.

given:

import string

#supported alphabet alphabet = string.ascii_letters + " " + "," + "-" + "!" print(alphabet)

#decrypt function #chiffer and key need to be byte arrays as this what my unit test will pass #return value should be a string def decrypt(chiffer, key): pass

#simply returns the decrypted message, nothing else def return_message(): return "the cleartext of the message" #all other code that you need should go below here