RSA: Alice wishes to send Bob the message POET. Suppose Bob chooses P = 29, Q...

RSA:

Alice wishes to send Bob the message POET. Suppose Bob chooses P = 29, Q = 31, E = 47, and D = 143.

Show the steps that Alice uses to encrypt the message POET (use the ascii values of the letters P, O, E, and T), and how Bob decrypts the message he receives from Alice.

You will be generating very large numbers, and will find the following calculator helpful:

https://www.calculator.net/big-number-calculator.html

Expert Solution

First of all encrypt the message at sender.
Decrypt the message at receiver.
At last verify both are same or different.

venereology answered 2 years ago

Alice wants to send a plaintext message m = 10 to Bob secretly using RSA public...

Alice wants to send a plaintext message m = 10 to Bob secretly using RSA public key cryptosystem. Bob selects p = 7, and q = 13 with e = 5. You have to perform following tasks: a. Compute and list Bob’s public and private keys. b. Compute the ciphertext that Alice will send to Bob using plaintext message m = 10. c. Recover the actual plaintext from the ciphertext sent by Alice

Alice is sending message “HIDE” to Bob. Perform encryption and decryption using RSA algorithm, with the...

Alice is sending message “HIDE” to Bob. Perform encryption and decryption using RSA algorithm, with the following information: parameters p=11,q=5, e=7 Present all the information that you will need to encrypt and decrypt only the first letter from text

Suppose Alice and Bob have RSA public keys in a file on a server. They communicate...

Suppose Alice and Bob have RSA public keys in a file on a server. They communicate regularly, using authenticated, confidential message. Eve wants to read the messages but is unable to crack the RSA private keys of Alice and Bob. However, she is able to break into the server and alter the file containing Alice’s and Bob’s public keys. (1) How should Eve alter the file to so that she can read confidential messages sent between Alice and Bob, and...

Suppose Alice is using a block cipher to send the message THE ORDER IS KARL, ANDY,...

Suppose Alice is using a block cipher to send the message THE ORDER IS KARL, ANDY, FRED AND IAN. IAN AND ANDY HAVE LEFT. to Bob. Assume that the block cipher is used in ECB mode, the English is divided into plaintext blocks of 2 letters (ignore spaces and punctuation) the ciphertext blocks are denoted C1,C2,...,C23 (a) Write down the 23 plaintext blocks. (b) Will any of the ciphertext blocks be repeated? If so, which ones? (c) Suppose an attacker...

How to generate a key pair for Alice and Bob Respectively Suppose Alice sends plaintext P=...

How to generate a key pair for Alice and Bob Respectively Suppose Alice sends plaintext P= 113, how does she encrypt and whats the ciphertext C? After Bob receives C, how does he decrypts it to get the plaintext P? Suppose Alice sends plaintext P= 113, how does she sign it and what are sent to Bob. How does Bob verify the signature? Suppose Bob sends plaintext P=113, how does he sign it and what are sent Alice. How does...

Answer digital signatures question. assume Alice has the RSA key (eA, dA, nA) and Bob has...

Answer digital signatures question. assume Alice has the RSA key (eA, dA, nA) and Bob has the RSA key(eB, dB, nB), where eA, eB, nA, and nB are public, dA is known only to Alice, and dB is known only to Bob. (a) Describe how Alice could use her RSA key to sign a public message m, and explain why this approach satisfies the objective of non repudiation. (b) Describe how Alice could encrypt and send a secret message to...

Suppose Alice flips 4 coins and Bob flips 4 coins. Find the probability that Alice and...

Suppose Alice flips 4 coins and Bob flips 4 coins. Find the probability that Alice and Bob get the exact same number of heads.

Consider an RSA system with p = 7109 and q = 7919. Generate a public and...

Consider an RSA system with p = 7109 and q = 7919. Generate a public and private key pair based on the given p and q. Show the STEPS

QUESTION 26 Consider RSA with p = 7 and q = 11. What are n and...

QUESTION 26 Consider RSA with p = 7 and q = 11. What are n and z? n z 4 points QUESTION 27 Put the following wireless encryption protocols in order from most secure to least secure. - 1. 2. 3. WPA - 1. 2. 3. WEP - 1. 2. ...

In the Diffie-Hellman key exchange, Alice sends g^x mod p to Bob, and Bob sends g^y...

In the Diffie-Hellman key exchange, Alice sends g^x mod p to Bob, and Bob sends g^y mod p to Alice. (1) How do they get a common secret? (2) Suppose an attacker is intercepting their communication, and gets to know g, p, and g^x mod p. Why can’t the attacker figure out x from these data?

Question