Martha Stewart trial: BNBPPKZAVQZLBJ The prosecution team was well aware that Martha is fond of the RSA encryption scheme and that her published public key is (n,b) = (536813567, 3602561). Furthermore, in addition to her predilection for doilies and throw pillows, she is predisposed to dealing with plaintext messages in 6-letter blocks using the usual 26-letter alphabet (converted to an integer between 0 and 266-1 in the usual way) and ciphertext messages in 7-letter blocks in the same alphabet. What did the prosecution team learn from Martha's message? Please comment on the particulars of the RSA cryptosystem used by Martha.

Martha Stewart trial: BNBPPKZAVQZLBJ The prosecution team was well aware that Martha is fond of the RSA encryption scheme and that her published public key is (n,b) = (536813567, 3602561). Furthermore, in addition to her predilection for doilies and throw pillows, she is predisposed to dealing with plaintext messages in 6-letter blocks using the usual 26-letter alphabet (converted to an integer between 0 and 266-1 in the usual way) and ciphertext messages in 7-letter blocks in the same alphabet. What did the prosecution team learn from Martha's message? Please comment on the particulars of the RSA cryptosystem used by Martha.

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

Question # 3 Assume that Dominique and Pricilla agreed to use an auto key cipher with initial keyvalue k1 = 11. Now Dominique wants to send Pricilla the following message“THE CLASS IS CANCELLED”. Encrypt the message before transmitting it over the Internet Remember: i need a Mathematics solution not computer program You must show all the steps of your work
Exercise 1 (The RSA basics ( Alice forms a public key for the "textbook" RSA public-key encryption and signature schemes, choosing N = 1073 and e = 715. 1. Encrypt the message M = 3 for Alice. 2. What is Alice's private key, and how does she use it for decrypting the received ciphertext? 3. Generate a signature on the message M = 1234567 using the following simple hash function H: {0, 1} ZN such that H(M)= 3M + 5 (mod N). 4. Verify that the signature you generated in the previous step is a valid signature.
Q16: if the following message "paperx" is encrypted by using Hill cipher and converted into cipher text "EJGPNH" what is the key matrix if you knowthat the key is (2*2) ?
Bob's public key is (55,3). Alice wants to send Bob the "message" 6. What is the cyphertext (encrypted version) of her message in the RSA cryptosystem? (Show the arithmetic, and you can use a calculator.)
Network Security problem Q1] Consider the RSA encryption algorithm. Suppose that a malicious user intercepts the ciphertext C = 18 that is being sent to Alice. If Alice's public key PUa = {5,35) is known by the malicious user, show how the malicious user will recover the plaintext M? [Hint: find M=?] Note: C stands for Ciphertext, M stands for Message (Plaintext), PUa stand for Alice's public key.
The following sentence describes steps that cryptographic code may perform to generate a ciphertext c and authentication tag t. “The message number i is concatenated with the message and encrypted with key Kenc to produce the ciphertext. The key Kauth is concatenated with i and with the message, and the resulting string is hashed with SHA3-384 to produce the tag.” Write the definitions of c and t as a formula
Question 2: You are Alice. Bob publishes his ElGamal public key (q, a, ya) = (101, 2, 14). You desire to send the secret message “CALL ME” to Bob. Using the equivalence A = 01, B = 02, and so on up to Z = 26, you encode the message into the number 03 01 12 12 13 05. Regarding each of these two-digit numbers as a plaintext block, compute the message that you will send to Bob using his public key. This requires you to pick a “random” number k; use k = 32. You are Bob. You get a message from Alice. You like Alice a lot, so you are eager to read the message. Use your secret key (101, 2, 10) to decrypt Alice’s message. Notice that you don’t need to know what value of k Alice used in order to do this.
] 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 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?
4. In the RSA public-key encryption scheme, each user has a public key, e, and a private key, d. Suppose Bob leaks his private key. Rather than generating a new modulus, he decides to generate a new public and a new private key. Is this safe?
Dexter wants to set up his own public keys. He chooses p = 23 and q = 37 with e = 7. Answer the following using RSA cryptographic method: a) Encrypt the message ‘100’ and find the CIPHER number (C) to be sent. [5] C = Me mod pq b) Find the decryption key ‘d’. c) Now decrypt the message ‘10’ (this is the CIPHER message received). M = Cd mod pq.
5. Use RSA public-key encryption to decrypt the message 111 using the private keys n = 133 and d = 5.