Alice and Bob use the ElGamal scheme with a common prime q= 131 and a primitive root a = 6. Let Bob's public key be YB=3. A. What is the ciphertext of M-9 if Alice chooses the random integer k-4? B. If Alice uses the same k to encrypt two messages M₁ and M₂ as (12, 65) and (12, 64), what is the relation between M₁ and M₂?

Alice and Bob use the ElGamal scheme with a common prime q= 131 and a primitive root a = 6. Let Bob's public key be YB=3. A. What is the ciphertext of M-9 if Alice chooses the random integer k-4? B. If Alice uses the same k to encrypt two messages M₁ and M₂ as (12, 65) and (12, 64), what is the relation between M₁ and 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

Can anyone please explain to me why we have such equations below in part b) and c)? They are the solutions to the questions, but I can't really understand why and how to get that. Many thanks. ==== QUESTION ==== In the Shamir secret sharing scheme, we distribute a secret among q different users as follows. If our secret is a message (m1, . . . , mk) from V (k, q) then, we encode it as a codeword of the Reed-Solomon RSk(q) and give one coordinate to each user. In this problem, we will use q = 7, k = 4 and the parity check matrix H4 below for RS4(7). H4 = [1 1 1 1 1 1 1, 0 1 2 3 4 5 6, 0 1 4 2 2 4 1] a) Write a generator matrix for RS4(7) b) A new secret is selected and user #1 receives share value 0, user #2 receives share value 6 and user #3 receives share value 1 and are collaborating to discover the new secret. Explain why they can’t recover the secret with only this information. c) Now, suppose users #1, #2 and #3 (as in the previous item) discover, in addition to the values of…
2.
5. As shown in the figure below, we see how Alice can send Bob a singed message. If Trudy replaces P, Bob can detect it. But what happens if Trudy replaces both P and the signature? P, DA (MD (P)) Message sent in the clear Alice signs message digest what happens? Provide explanation. Solution:
A summary of RSA algorithm is described on W10 Notes. Assume that the algorithm is used with p= 11,q=3 and e = 3. 1. Compute n, d, and the decryption key, d 2. Suppose that we wanted to use this system to send a message secretly by letting A = 2, B3,C4,...,Z 27, a - 28, b= 29,... and interleave/scramble the words in the message for extra added security purposes. Compute the plaintext message if the received ciphertext is BQRRCDIHICHM
Consider a knapsack cryptosystem with a =[2, 6, 12, 45, 70, 151). If the knapsackSum = 208, find the values for x.
3. For this task you are going to generate a key and use stream cipher. (a) Use the quadratic residue pseudorandom generator (BBS)on the prime numbers p and q of your choice, where 5000 < p, q < 9000, to generate the first five bits of your key k0, k1, k2, k3 and k4. (b) Generate a key sequence of length 40 by using the recurrence relation xn+5 = xn+4 + xn+2 + xn+1 + xn (mod 2), n ≥ 0 where the initial values are the key generated in (a). (c) Encode your last name by using the ASCII code. Use the stream cipher and the key you generated above to encrypt your last name.
4) Consider a simple RSA example. To generate, say, Bob's keypair, we select two "large" primes, p=17 and q=3. Calculate all the things needed, choosing as the encryption exponent e=3. Which one of the following is Bob's public key? A (11,32) B (11,51) C (17,32) D (3, 32) E (17,51) F (3, 51)
Recall that the sponge construction describes how to turn a public random permutation into a cryptographic hash function. Once the data to be hashed has been padded, the next step is to absorb the data r bits at a time. blk = <0>while not done: xor the next r bits of data into the first r bits of blk blk = p(blk) As a convenient (but not secure because it's too small) public random permutation, lets use the AES S-box for p. What is blk after absorbing each of the following when r=4 bits. Give your answer as exactly either 2 hexadecimal digits or 8 binary digits with no spaces (eg, 0A or 00001010). Note that the data is already padded and you should restart at blk=<0> each for each computation Data: 1001 Resulting blk:____ Data 10011001 Resulting blk:_____ Data 100110011001 Resulting blk:____
Prove that in RSA with public key (n,e) and n=pq, the amount of plaintexts x, with Ec(x)=x, is dpdq, where dp=gcd(e-1,p-1) and dq=gcd(e-1,q-1).
see image
Q.15 Explain cryptographic hash function.
Consider the following encryption scheme for a block cipher (using the notationfrequently used in class).y1 = ek(x1), y2 = ek(x1 ⊕ x2), y3 = ek(x1 ⊕ x2 ⊕ x3), etc.a. Describe the corresponding decryption scheme.b. Can encryption and/or decryption be run in parallel for this scheme?c. Taking into account that the operation of XOR is cheap, determinewhether or not this scheme improves on ECB mode or not