CRYPYOGRAPHY(Suppose that Alice the encrypts same plaintext m toBob and charles who have their RSA public keys (N,e,)and (N,C2) respectively with gcd(e 1,e 2 )=1.if you arean eves dropper observing this communication,explain how you can find m

Answered: CRYPYOGRAPHY (Suppose that Alice the…

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

Alice and Bod have decided to use a symmetric encryption algorithm. They have someassumptions about their messages:- Messages only contain capital letters (i.e. A to Z)- The length of their shared key must be greater than or equal to the length of the plaintext- They assign each letter a number as follows: (A,0), (B,1), (C,2), (D,3),…, (Z,25)Their algorithm combines the key and the message using modular addition. The numerical valuesof corresponding message and key letters are added together, modulo 26. For example, if the plaintext is “HELLO” and the key is “SECRET” then the encrypted message is calculated as following:Since the length of the plaintext is 5, we just need the first 5 letters of the key (i.e. “SECRE”), thenfor each letter, we should add corresponding letters in both the plaintext and the key modulo 26.Plaintext: H (7) E (4) L (11) L (11) O (14)Key: S (18) E (4) C (2) R (17) E(4)Cipher: Z (25) I (8) N(13) C(2) S (18) a) Write a program in Python, C/C++ or JavaScript to…
alice wants to send to all her friends, including bob, the message "SELLEVERYTHING" so that be knows that she sent it. What should she send to her friends, assuming she signs the message using the RSA cryptosystem.
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 and Bod have decided to use a symmetric encryption algorithm. They have some assumptions about their messages:- Messages only contain capital letters (i.e. A to Z)- The length of their shared key must be greater than or equal to the length of the plaintext- They assign each letter a number as follows: (A,0), (B,1), (C,2), (D,3),…, (Z,25)Their algorithm combines the key and the message using modular addition. The numerical values of corresponding message and key letters are added together, modulo 26. For example, if the plain text is “HELLO” and the key is “SECRET” then the encrypted message is calculated as following:Since the length of the plaintext is 5, we just need the first 5 letters of the key (i.e. “SECRE”), then for each letter, we should add corresponding letters in both the plaintext and the key modulo 26.Plaintext: H (7) E (4) L (11) L (11) O (14)Key: S (18) E (4) C (2) R (17) E(4)Cipher: Z (25) I (8) N(13) C(2) S (18) Write a program in Python, C/C++ or JavaScript to…
Suppose your RSA public key is PK: {n, e} = {13861, 37}. Your friend sends you a ciphertext C = 9908. But unfortunately you have forgotten your private key, now you have to crack it yourself.a) Write down a possible condition of factors p and q.p= q=b) What is your private key SK: {d}?d=c) What is the plaintext of your friend’s message?The plaintext M =d) Suppose the plaintext M is a 12-digit number consisting of a prefix “19” and 1234567890. What is the corresponding ciphertext? Since M is greater than n, you only need to encrypt four digits at a time. Ignore redundant zeros. e.g., 0001 = 1. The result should contain three integers.The ciphertext C0 =
Bob has sent his secret number m to Alice via secure RSA encryption. Break his ciphertext to find m. To factorize the number N, you can use the program. Alice's public key (e, N) = (17, 29329): Bob's ciphertext c = 16469
In the ElGamal cryptosystem, Alice and Bob use p = 17 and α = 3. Bobchooses his secret to be a = 6, so β = 15. Alice sends the ciphertext (r, t) = (7, 6). Determine the plaintext m.
After taking some courses on cryptography, Alice and Bob decide to try it out in their communication. They agree that they will use Vigenere cipher for data encryption/decryption, and RSA for sharing secrete key, where the key of Vigenere cipher only uses letters A, B,..., Jand letters in a key are encoded as digits 0,1,...,9 for RSA. For instance, the key BAJ is 109.Alice chooses a RSA public key (n. e) = (341,7). Bob uses the Vigenere cipher to encrypt a sentence and encrypt the Vigenere key by Alice's RSA public key. Then Bob sends the following message to Alice:61. Tfsgnhgs zq tadnov zuws gutoiosgoz dfiqsk vik ffgfmopf. Ov jy uuxkdz.Answer the following questions:• What is the Nigenere key used by Bob?• What is the original message from Bob?
Data Encryptions and Cryptography Suppose Conny and Shelby apply ElGamal scheme with a common prime q = 71 and a primitive root a = 7. If Conny has public key Yp = 3 and Shelby choose the random integer k = 2, what is the ciphertext of M = 30? If Shelby now chooses a different value of k so that the encoding of M = 30 is C = (59, C2), what is the integer C2 ?
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?
Alice and Bob agree to use the prime p = 1373 and the base g = 2 for communications using the Elgamal public key cryptosystem. Bob chooses b = 716 as his private key, so his public key is B ≡ 2716 ≡ 469 (mod 1373). Alice encrypts the message m = 583 using the random element k = 877. What is the ciphertext (c1, c2) that Alice sends to Bob?
Describe the differences between a monoalphabetic cipher and a polyalphabetic cipher. Is the Caesar cipher a polyalphabetic cipher? In one of his cases, Sherlock Holmes was confronted with the following message: Znk yozagzout oy mxgbk. Iusk osskjogzkre Although Watson was puzzled, Holmes was immediately able to deduce the type of cipher. Describe the cipher being used to encrypt this message. Can you decode the message? Is this cipher susceptible to brute-force cryptanalysis?

SEE MORE QUESTIONS

Recommended textbooks for you

Database System Concepts

Computer Science

ISBN:

9780078022159

Author:

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

Publisher:

McGraw-Hill Education

Starting Out with Python (4th Edition)

Computer Science

ISBN:

9780134444321

Author:

Tony Gaddis

Publisher:

PEARSON

Digital Fundamentals (11th Edition)

Computer Science

ISBN:

9780132737968

Author:

Thomas L. Floyd

Publisher:

PEARSON

Database System Concepts

Computer Science

ISBN:

9780078022159

Author:

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

Publisher:

McGraw-Hill Education

Starting Out with Python (4th Edition)

Computer Science

ISBN:

9780134444321

Author:

Tony Gaddis

Publisher:

PEARSON

Digital Fundamentals (11th Edition)

Computer Science

ISBN:

9780132737968

Author:

Thomas L. Floyd

Publisher:

PEARSON

C How to Program (8th Edition)

Computer Science

ISBN:

9780133976892

Author:

Paul J. Deitel, Harvey Deitel

Publisher:

PEARSON

Database Systems: Design, Implementation, & Manag…

Computer Science

ISBN:

9781337627900

Author:

Carlos Coronel, Steven Morris

Publisher:

Cengage Learning

Programmable Logic Controllers

Computer Science

ISBN:

9780073373843

Author:

Frank D. Petruzella

Publisher:

McGraw-Hill Education

SEE MORE TEXTBOOKS

CRYPYOGRAPHY (Suppose that Alice the encrypts same plaintext m to Bob and charles who have their RSA public keys (N,e,) and (N,C,) respectively with gcd(e 1,e 2 )=1.if you are an eves dropper observing this communication, explain how you can find m