You are given the following simple 8-bit SPN with just one round and an 4-by-4 S-box (used twice: once for bits 1 through 4, and once for bits 5 to 8). The SPN operates the following way:
The key for this example is
1 0 0 1 1 1 0 0 1 1 0 1
1 1 0 0 0 1 0 1 0 1 1 0 1 0 1 1 1 0 1Show the decryption of the text, make sure that you get the original plaintext back.
Show the decryption of the text, make sure that you get the original plaintext back.
Ann, Brian, and Chris are using a Vigenere cipher with a long randomly generated key. Ann encrypts a message and sends it to Brian. The encryption looks like this:
WMLSWTDIRYYZICEXIMRLOQYJTFPICKHZGNPTXGSAZSRPFIPTSJXTAWVBrian decrypts the message, reads it, and decides to send it to Chris. To do this, he re-encrypts the plaintext using the same key. Unfortunately Brian's encryption device has a mechanical problem: every once in a while it inserts the letter X in the plaintext. Brian's encryption came out like this:
WMLSWTDIRYYZICEXXPDXRWQHGWVSWNEINODIIRFVEBGEQUSJNVAGVSXRYour task is to determine everything you can about the plaintext and the key. How difficult would it be to determine the remaining part of the plaintext and of the key without any assumptions about either?
Completely optional, no extra credit. Can you guess the rest of the plaintext? How confident are you of your guess?
Part 1.Use the Merkle-Damgard construction, compute MAC for the
message 101 110 110.
Part 2. Is the compression function second preimage resistant? If yes, please explain why; if no, demonstrate how you would solve the second preimage problem.
Part 3. Is the compression function collision resistant? If yes, please explain why; if no, demonstrate how you would solve the collision problem.
The views and opinions expressed in this page are strictly those of the page author. The contents of this page have not been reviewed or approved by the University of Minnesota.