Alice decides to set up an RSA public key encryption using the two primes p = 31 and q = 41 and the encryption key e = 11. You must show all calculations, including MOD- calculations using the division algorithm! (1) Bob decides to send the message M = 30 to her using this encryption. What is the code C that he will send her? (2) What is Alice's decryption key d? Remember that you have to show all your work using the Euclidean algorithm. (3) Alice also receives the message C = 101 from Carla. What was her original message M?

Alice decides to set up an RSA public key encryption using the two primes p = 31 and q = 41 and the encryption key e = 11. You must show all calculations, including MOD- calculations using the division algorithm! (1) Bob decides to send the message M = 30 to her using this encryption. What is the code C that he will send her? (2) What is Alice's decryption key d? Remember that you have to show all your work using the Euclidean algorithm. (3) Alice also receives the message C = 101 from Carla. What was her original message M?

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

Using public key cryptography, Bob wants to send a secret message M to Alice (only Alice and Bob should see M), and Alice wants to make sure that M is sent by Bob. Then Bob should: sign the message, and send signature to Alice encrypt M with his public key, encrypt the result with Alice's private key, and then send to Alice Answer is not given encrypt M with his private key, encrypt the result with Alice's public key, and then send to Alice encrypt M with Alice's public key and then send to Alice encrypt M with his public key, encrypt the result with Alice's public key, and then send to Alice encrypt M with his private key, encrypt the result with Alice's private key, and then send to Alice encrypt M with Alice's private key, encrypt the result with his private key, and then send to Alice
Alice wishes to authenticate a message to Bob using RSA. She will use public exponent e = 3, and ‘random’ primes p = 11 and q = 23. (2 pts) Give the numbers that make up the public key that is shared with Bob (2 pts) Find the secret exponent that Alice will use to sign her messages. (3 pts) Use the secret exponent to produce the signature of the message m = 29. Then use the public exponent to decrypt the signature and get the original message back, as Bob would do to verify.
igital Signature using the RSA algorithm: Alice is sending an integer value mA = 3 to Bob with RSA signing. Alice's public key and private key are (5, 14) and (11, 14). Alice first releases her public key to public. How to calculate the signature sig(mA).
Alice and Bob are using the ElGamal cipher with the parameters p = 53 and a = 2. Alice makes the mistake of using the same ephemeral key for two plaintexts, x1 and x2. The eavesdropper Eve suspects that x1 = 5. She sees the two ciphertexts y1 = 41 and y2 47 in transit; these are the encryptions of a1 and x2, respectively. a) What is the masking key kM? b) What is the plaintext x2?
Alice sets up an RSA public/private key, but instead of using two primes, she chooses three primes p, q, and r and she uses n=pqr as her RSA-style modulus. She chooses an encryption exponent e and calculates a decryption exponent d. Encryption and Decryption are defined: C ≡ me mod n and m ≡ Cd mod n where C is the ciphertext corresponding to the message m. Decryption: de ≡ 1 mod φ(n) | Let p = 5, q = 7, r = 3, e = 11, and the decryption exponent d = -13. n = 105 & φ(n) = 48 Q: Alice upgrades to three primes that are each 200 digits long. How many digits does n have?
] You receive a message that was encrypted using the RSA system with public key (43, 143), where 43 is the public exponent. A message encrypted using this cryptosystem was captured by an enemy and consisted of the following numbers: 6 82 132 115. Can you decipher what was the original message? (Hint: As a first step, you need to find p and q.)
Alice wants to communicate with Bob, using public-key cryptography. She establishes a connection to someone she hopes is Bob. She asks him for his public key and he sends it to her in plaintext along with an X.509 certificate signed by the root CA. Alice already has the public key of the root CA. What steps does Alice carry out to verify that she is talking to Bob? Assume that Bob does not care who he is talking to (e.g., Bob is some kind of public service).
Encrypt the 12-bit plaintext 101010100111 using Simplified B-DES and the 9-bit key K = 010001111. This is a non-computer problem and you need to show all the steps of the encryption process
Alice uses a shift cipher with a shift of 4 to encrypt her message to Bob. If the ciphertext she obtains is "ksshpygo", what is her message in plaintext?
Let's assume that Bob and Alice share a secret key in a symmetric key system. Bob wishes tobegin a conversation with Alice, and sends her a message that essentially says "let's talk". Aliceis suspicious that the person contacting her might not be Bob, so Alice generates a single-userandom number (a nonce) and sends it to Bob. Bob encrypts the nonce with the secret key heshares with Alice and sends it back. Alice decrypts this message and retrieves the same nonceshe sent to Bob. Which of the following is true, provided the secret key K has not been compromised?
Alice wants to securely send Bob an arbitrary numberM from the set {0, 1, . . . , N − 1} for some positive integer N. She wants to have ascheme with perfect secrecy. She heard of the One Time Pad (OTP), but OTP isfor bitstrings, not numbers. She decides to use the following scheme. The key spaceis {0, 1, . . . , N − 1}. A ciphertext C for M is computed as (M + K) mod N anddecryption performs (C − K) mod N.Prove that this scheme is perfectly secure
The following parameters are chosen to generate the public and private keys for the RSA cryptosystem. p = 7q = 11e = 13d = 37 If the plaintext is m = 4, then what is the ciphertext c? c =