![In this question, we will use the following notations: PU and PR are the Public and its corresponding Private keys K is a symmetric Key. 1. [M]K message M is decrypted with K MjPu: message M is encrypted/verified with P is the correspondin is a Message an Cipher M h: message M is encrypted with K. H(M): the hash of message M. Assume that Bob and Alice agree on a shared secret K. Bob wants to authenticate himself to Alice using any of the following methods: (a) Bob sends Alice: C K K) (b) Bob sends Alice: C-{K ^PU-Alice (c) Bob sends Alice: C H(K) (d) Bob sends Alice: CH(K)) PR-Bob (e) Bob sends Alice: C-{K) PU-Alice PR-Bob In each method, describe what Alice should do (compute) when she receives C in order to authenticate Bob.](http://img.homeworklib.com/questions/70db45c0-bac6-11eb-b52a-4f70dfee8007.png?x-oss-process=image/resize,w_560)
Homework Answers
Add Answer to:
In this question, we will use the following notations: PU and PR are the Public and...
your answer. Refer to attack scenarios on mutual authentication protocols that were discussed during the Lecture-7 and...
your answer. Refer to attack scenarios on mutual authentication protocols that were discussed during the Lecture-7 and Tutorial-7.] 5 Marks] Q5 (OpenSSL and IPFS) Assume that the School of Science of RMIT University is planning to use IPFS-based repository of sensitive files for sharing among staffs. An owner of a particular file, say Alice wants to share the file to her supervisor, say Bob. Therefore, Alice encrypts the file with Alice and Bob's shared AES secret key (KaB) using OpenSSL,...
The Diffie-Hellman public-key encryption algorithm is an alternative key exchange algorithm that is used by protocols...
The Diffie-Hellman public-key encryption algorithm is an alternative key exchange algorithm that is used by protocols such as IPSec for communicating parties to agree on a shared key. The DH algorithm makes use of a large prime number p and another large number, g that is less than p. Both p and g are made public (so that an attacker would know them). In DH, Alice and Bob each independently choose secret keys, ?? and ??, respectively. Alice then computes...
Question1: Alice and Bob use the Diffie–Hellman key exchange technique with a common prime q =...
Question1: Alice and Bob use the Diffie–Hellman key exchange technique with a common prime q = 1 5 7 and a primitive root a = 5. a. If Alice has a private key XA = 15, find her public key YA. b. If Bob has a private key XB = 27, find his public key YB. c. What is the shared secret key between Alice and Bob? Question2: Alice and Bob use the Diffie-Hellman key exchange technique with a common...
Demonstrate how you can construct an Iterative Hash h function using the Merkle- Damgard Design. Use...
Demonstrate how you can construct an Iterative Hash h function using the Merkle- Damgard Design. Use as your compression function f:{0, 1}^v times {0, 1}^b rightarrow {0, 1}^v, AES with 512-bit keys. Explain what the values of v and b will be in your compression function and where in the block cipher (AES) are you using the blocks of the message you want to hash. Using the iterative hash function you just create above, show how a digest for a...
(8) In an RSA cryptosystem, Bob’s public key is (n = 629, e = 43). Alice...
(8) In an RSA cryptosystem, Bob’s public key is (n = 629, e = 43). Alice uses this public key to encrypt the word “MARCH” and send the ciphertext to Bob. First, she represents this word in ASCII where the capital letters A, B, C, . . . , X, Y, Z are represented by integers 65, 66, 67, . . . , 88, 89, 90 respectively. Then she encrypts the five integers that represent M, A, R, C, H...
Problem 6.2 In this problem, we will look at a simple application of probability to cryptog raphy...
Problem 6.2 In this problem, we will look at a simple application of probability to cryptog raphy. Alice would like to communicate a message to Bob but does not want Eve to learn the message. The difficulty is that Eve can hear everything that Alice says. However, Alice and Bob both have access to a shared random key, which will allow Alice to hide the message from Eve. The block diagram below should help you visualize the scenario. We've kept...
QUESTION 2 Ensuring that data is genuine, meaning that the sender of the data is who...
QUESTION 2 Ensuring that data is genuine, meaning that the sender of the data is who they say they are, that the data received is the data that the sender meant to send, and that the receiver is who they say they are a. confidentiality b. authentication c. non-repudiation d. integrity 2 points QUESTION 3 Cryptography method that uses a single key for both encryption and decryption a. prime factorization b. asymmetric c. symmetric d. message authentication code 2...
You are wanting to communicate secret messages with your friend, and you choose to do this with matrices. The encoding matrix that you choose to use is 2 -2 -1 6 You use the following key to convert...
You are wanting to communicate secret messages with your friend, and you choose to do this with matrices. The encoding matrix that you choose to use is 2 -2 -1 6 You use the following key to convert your message into a string of numbers, where "O" is used as a placeholder where required. A B C D EF G H IJ K L M 10 2 11 24 19 5 25 20 3 7 16 6 14 N O...
5. We must assume that keys are not secure forever, and will eventually be discovered; thus...
5. We must assume that keys are not secure forever, and will eventually be discovered; thus keys should be changed periodically. Assume Alioe sets up a RSA cryptosystem and announces N = 3403, e = 11. (a) Encrypt m = 37 using Alice's system (b) At some point. Eve discovers Alice's decryption exponent is d = 1491. Verify this (by decrypting the encrypted value of rn = 37). (c) Alice changes her encryption key to e = 31, Encrypt rn...
Cryptography, the study of secret writing, has been around for a very long time, from simplistic...
Cryptography, the study of secret writing, has been around for a very long time, from simplistic techniques to sophisticated mathematical techniques. No matter what the form however, there are some underlying things that must be done – encrypt the message and decrypt the encoded message. One of the earliest and simplest methods ever used to encrypt and decrypt messages is called the Caesar cipher method, used by Julius Caesar during the Gallic war. According to this method, letters of the...
your answer. Refer to attack scenarios on mutual authentication protocols that were discussed during the Lecture-7 and Tutorial-7.] 5 Marks] Q5 (OpenSSL and IPFS) Assume that the School of Science of RMIT University is planning to use IPFS-based repository of sensitive files for sharing among staffs. An owner of a particular file, say Alice wants to share the file to her supervisor, say Bob. Therefore, Alice encrypts the file with Alice and Bob's shared AES secret key (KaB) using OpenSSL,...
Demonstrate how you can construct an Iterative Hash h function using the Merkle- Damgard Design. Use as your compression function f:{0, 1}^v times {0, 1}^b rightarrow {0, 1}^v, AES with 512-bit keys. Explain what the values of v and b will be in your compression function and where in the block cipher (AES) are you using the blocks of the message you want to hash. Using the iterative hash function you just create above, show how a digest for a...
Problem 6.2 In this problem, we will look at a simple application of probability to cryptog raphy. Alice would like to communicate a message to Bob but does not want Eve to learn the message. The difficulty is that Eve can hear everything that Alice says. However, Alice and Bob both have access to a shared random key, which will allow Alice to hide the message from Eve. The block diagram below should help you visualize the scenario. We've kept...
You are wanting to communicate secret messages with your friend, and you choose to do this with matrices. The encoding matrix that you choose to use is 2 -2 -1 6 You use the following key to convert your message into a string of numbers, where "O" is used as a placeholder where required. A B C D EF G H IJ K L M 10 2 11 24 19 5 25 20 3 7 16 6 14 N O...
5. We must assume that keys are not secure forever, and will eventually be discovered; thus keys should be changed periodically. Assume Alioe sets up a RSA cryptosystem and announces N = 3403, e = 11. (a) Encrypt m = 37 using Alice's system (b) At some point. Eve discovers Alice's decryption exponent is d = 1491. Verify this (by decrypting the encrypted value of rn = 37). (c) Alice changes her encryption key to e = 31, Encrypt rn...
Most questions answered within 3 hours.
-
The extent to which assets are financed by borrowed funds and
other liabilities is indicated by:...
asked 1 minute ago -
Explain in detail
Germany is the fifth largest economy
explain what goods and services Germany specializes...
asked 15 minutes ago -
The density of platinum is 21.45 g/mL. If a cube of platinum
with a mass of...
asked 21 minutes ago -
Accounts Receivable
Sales
A/R Posting
Extended Sales Invoice
Packing Slip
Compare invoice to packing slip 2...
asked 24 minutes ago -
Michaella, age 23, is a full-time law student and is claimed by
her parents as a...
asked 24 minutes ago -
Why are polymers not typically casted into products?
asked 41 minutes ago -
When rolling a die 129 times, what is the probability of rolling
a 6 no more...
asked 58 minutes ago -
4. A call option currently sells for $7.75. It has a strike
price of $85 and...
asked 47 minutes ago -
1.
You need to prepare 10.0 liters of an acid aqueous solution with a
pH of...
asked 50 minutes ago -
Along an aggregate supply curve, if the level of output is less
than the natural level...
asked 50 minutes ago -
By 2025, annual consumption in emerging markets will total $30
trillion and contribute more than ________...
asked 55 minutes ago -
At what point does reformation cease to be a viable option for
those who are oppressed...
asked 59 minutes ago