Reference no: EM13692263
Provide the answers for the following questions:
Informally speaking, a MAC is secure if no efficient forger can generate any valid (message, tag) pair, even if the forger is given a tagging oracle. (As we discussed in class a tagging oracle is an algorithm that will tag arbitrary messages for an attacker.)
Consider a MAC technique called CBCMAC. The algorithm takes a message, m, a secret key, k, and runs CBC mode encryption on the blocks of the message. For purposes of this problem the initialization vector will always be zero. The tag is the final block of the ciphertext.
Question 1: Demonstrate that this MAC scheme is not secure for variable length messages.
Question 2: Write pseudocode for an algorithm, F, that, given a tagging oracle Tk(m), can easily generate a (message, tag) pair for a message that was not sent to the tagging oracle.
Answer these questions in details and provide examples.
What are public saving-private saving and national saving
: What are public saving, private saving, and national saving? Solve these equations for the equilibrium values of C, I, NX, and Explain what you find using a graph.
|
Content of the queue at the beginning
: Assume you are at the airport, waiting for the security check. There is one line (which is a FIFO queue), and 5 security check gates. Each person reaching in front of the queue is checked by the first available security gate.
|
Requirements for an automated home bottle
: Flexible design enables a quick change from one bottle to another and easy adjustment of the cutting locations according to the size and shape of the container
|
Demonstrate that this mac scheme is not secure
: Demonstrate that this MAC scheme is not secure for variable length messages - Write pseudocode for an algorithm, F, that, given a tagging oracle
|
Make a python program that uses the getcwd
: Make a Python program that uses the getcwd() function to provide a string of the current working directory. Save the string in the variable current folder and display the value.
|
Write a generic class called pair that stores two values
: Write a generic class called Pair that stores two values of the generic type. It should have a constructor to set them, two methods getfirst()
|
Two-way set-associative cache for a main memory
: Determining the Tag, Line, and Word values for the Direct-mapped, associative, and two-way set-associative cache for a main memory address of EEEEEE.
|
Uses the sieve of eratosthenes algorithm
: Write a complete program that uses the Sieve of Eratosthenes algorithm to list all prime numbers from 1 to 1,000 .
|