ZuoTi.Pro
Question

In ElGamal encryption scheme, assume that a prime modulus p = 451 and a generator g=288....

In ElGamal encryption scheme, assume that a prime modulus p = 451 and a generator g=288. If the private key is 23, what is the public key? Encrypt a message m=31 with a random value k=41 and decrypt the ciphertext.

engineering   Computer-Science   
0 0
Add a comment Improve this question Transcribed image text
Next > < Previous
Sort answers by oldest

Homework Answers

Answer #1

0 0
Add a comment
Know the answer?
Add Answer to:
In ElGamal encryption scheme, assume that a prime modulus p = 451 and a generator g=288....
Your Answer:

Post as a guest

Your Name:

What's your source?

Earn Coins

Coins can be redeemed for fabulous gifts.

Log In

Sign Up

Not the answer you're looking for? Ask your own homework help question. Our experts will answer your question WITHIN MINUTES for Free.
Similar Homework Help Questions

  • Digital Signature (5-5): In the course notes we looked at RSA for encryption and signatures (using...

    Digital Signature (5-5): In the course notes we looked at RSA for encryption and signatures (using exactly the same mathematical formula), and ElGamal for encryption. There has been several questions on using ElGamal for signature. The ElGamal encryption algorithm cannot be used for signatures but there are signature schemes that is based on discrete logarithm. (a) Search for simple explanation of the ElGamal signature scheme and DSA signature scheme (Hint: Wikipedia). Can these algorithms be used to encrypt a message?...

  • all infor given 4. Supppose Alice and Bob are using the prime p = 1451 and...

    all infor given 4. Supppose Alice and Bob are using the prime p = 1451 and the base g = 2 for an ElGamal cryptosystem. (a) Alice chooses a = 753 as her private key. What is the value of her public key A? (b) Now suppose Bob chooses b = 500 as his private key, and thus his public key is 464 mod 1451. Alice encrypts the message m = 284 using the ephemeral key k=512. What is the...

  • 8.17. Considering the four examples from Problem 8.13, we see that the Elgamal scheme is nondeterministic:...

    8.17. Considering the four examples from Problem 8.13, we see that the Elgamal scheme is nondeterministic: A given plaintext x has many valid ciphertexts, e.g., both x=33 and x=248 have the same ciphertext in the problem above. 1. Why is the Elgamal signature scheme nondeterministic? 2. How many valid ciphertexts exist for each message x (general expression)? How many are there for the system in Problem 8.13 (numerical answer)? 3. IstheRSA crypto systemnondeterministic once the public key has been chosen?...

  • 5. Consider the RSA encryption scheme, Alice wants to send a message to Bob. Both Alice...

    5. Consider the RSA encryption scheme, Alice wants to send a message to Bob. Both Alice and Bob have p= 17,9 = 19. Alice has e=31 and Bob has e=29. a. What is the public key pair used in the transmission? 2 marks b. What is the secret key pair used in the transmission? 4 marks c. Encrypt the message m=111. 4 marks d. Decrypt the resulting ciphertext. 4 marks e. What's the security problem between Alice and Bob? How...

  • The Diffie-Hellman public-key encryption algorithm is an alternative key exchange algorithm that is used by protocols...

    The Diffie-Hellman public-key encryption algorithm is an alternative key exchange algorithm that is used by protocols such as IPSec for communicating parties to agree on a shared key. The DH algorithm makes use of a large prime number p and another large number, g that is less than p. Both p and g are made public (so that an attacker would know them). In DH, Alice and Bob each independently choose secret keys, ?? and ??, respectively. Alice then computes...

  • 7) (i) You and Bob use Elgamal encryption with p=17 and g=3. You choose your private...

    7) (i) You and Bob use Elgamal encryption with p=17 and g=3. You choose your private key a=4 and send A=-4 mod 17 to Bob (-4 is congruent to 3^4 mod 17), and Bob sends you (2,7). What is Bob's message? (ii) Alice and Bob use Elgamal encryption with p=13 and g=2. You noticed that Alice has sent A=11 mod 13 to Bob, and Bob has sent (5,7) to Alice. What is Bob's message?

  • Question1: Alice and Bob use the Diffie–Hellman key exchange technique with a common prime q =...

    Question1: Alice and Bob use the Diffie–Hellman key exchange technique with a common prime q = 1 5 7 and a primitive root a = 5. a. If Alice has a private key XA = 15, find her public key YA. b. If Bob has a private key XB = 27, find his public key YB. c. What is the shared secret key between Alice and Bob? Question2: Alice and Bob use the Diffie-Hellman key exchange technique with a common...

  • prime factorization. Assume that zoy wants to send a message to sam. sam generates public and...

    prime factorization. Assume that zoy wants to send a message to sam. sam generates public and private keys using RSA Encryption algorithm and publishes the public key (n=4717, e=19). zoy has a secret message M to send. Nobody knows the value of M. She encrypts the message M using the public key and sends the encrypted message C=1466 to sam. alex is an intruder who knows RSA and prime factorization well. She captures the encrypted message C=1466. She also has...

  • Question 11 (1 point) Approximately how many different starting settings could be created from the Enigma...

    Question 11 (1 point) Approximately how many different starting settings could be created from the Enigma machine's remarkably simple architecture. Question 11 options: 160 X 10 ^9 160 X 10^36 160 X 10^72 160 X 10^18 Question 12 (1 point) PGP uses a two-phase encryption approach to encrypt a message, and a second two-phase approach to decrypt a message. Alice wishes to send a message to Bob that will be confidential and also prove to Bob that Alice was the...

  • 4. Suppose you wish to encrypt the message, M 42 using RSA encryption. Given a public...

    4. Suppose you wish to encrypt the message, M 42 using RSA encryption. Given a public key where p- 23 and q-11 and the relative prime e- 7. Find n, and show all necessary steps to encrypt your message (42). (Hint: check p.411 of the text for information on public key RSA) (5 points)

ADVERTISEMENT
Free Homework Help App
Download From Google Play
Scan Your Homework
to Get Instant Free Answers
Need Online Homework Help?
Ask a Question
Get Answers For Free
Most questions answered within 3 hours.
ADVERTISEMENT
ADVERTISEMENT
ADVERTISEMENT