Problem 3: Breaking a two-time pad A one-time pad simply involves the xor of a message with a key to produce a ciphertext:cmek It is essential that the key be as long as the message, or in other words that the key not be repeated for two distinct message blocks Your task: In this problem you will break a cipher when the one-time pad is re-used. C1 = 57fbbaa76f6513d4b0685e651dc75dfed0a2dca24b9e42bf c2 71b5edb269784099b77556201ec142f0d0a6c1ed5e9d55b9 These are two hex-encoded ciphertexts that were formed by applying a "one-time pad" to two different messages with the same key. Find the two corresponding messages mi and m2. Okay, to make your search simpler, let me lay out a few ground rules. First, every character in the text is either a lowercase letter or a space, aside from perhaps the first character in each message which might be capitalized. As a consequence, no punctuation appears in the messages. Second, the messages consist of English words in ASCII. Finally, all but one of the words within each message is guaranteed to come from the set of the 100 most common English words: https: //en.wikipedia.org/wiki/Most.common_words_in English. Your output: Output the concatenation of strings mi and m2. (Don't worry if words get smashed together as a result.) SHA-256 hash of output: 547b4b369c22ef6d6a772bla5elf534fbe91fd0423a7e7fe866970357369fflb Problem 3: Breaking a two-time pad A one-time pad simply involves the xor of a message with a key to produce a ciphertext:cmek It is essential that the key be as long as the message, or in other words that the key not be repeated for two distinct message blocks Your task: In this problem you will break a cipher when the one-time pad is re-used. C1 = 57fbbaa76f6513d4b0685e651dc75dfed0a2dca24b9e42bf c2 71b5edb269784099b77556201ec142f0d0a6c1ed5e9d55b9 These are two hex-encoded ciphertexts that were formed by applying a "one-time pad" to two different messages with the same key. Find the two corresponding messages mi and m2. Okay, to make your search simpler, let me lay out a few ground rules. First, every character in the text is either a lowercase letter or a space, aside from perhaps the first character in each message which might be capitalized. As a consequence, no punctuation appears in the messages. Second, the messages consist of English words in ASCII. Finally, all but one of the words within each message is guaranteed to come from the set of the 100 most common English words: https: //en.wikipedia.org/wiki/Most.common_words_in English. Your output: Output the concatenation of strings mi and m2. (Don't worry if words get smashed together as a result.) SHA-256 hash of output: 547b4b369c22ef6d6a772bla5elf534fbe91fd0423a7e7fe866970357369fflb