Let the modulus be p = 23. Bob sends to Alice the value B = 9. Alice’s secret value is a = 10. Compute the secret key kAB to be shared between Alice and Bob. (Explain your computation.) Tip: Perform computation of kAB as it is to be done by Alice. (For completeness, we note that the generator g = 6, but you do not need it for this computation.)
Solution:
=>Symmetric key cryptography is used.
=>Modulus(p) = 23
=>Bob's public key(B) = 9
=>Alice secret number(a) = 10
Explanation:
Calculating the secret key kAB:
=>Secret key(kAB) = (B)^a mod p
=>Secret key(kAB) = (9)^10 mod 23
(9^5 mod 23 = 8 so 8*8 mod 23 = 18)
=>Secret key(kAB) = 18
=>Hence the shared key between Alice and Bob = 18
I have explained each and every part with the help of statements attached to the answer above.
5. Diffie-Hellman key exchange. Alice and Bob use Diffie-Hellman key exchange protocol to communicate in secret. They publicly announce a prime number p = 23 and a primitive root r = 5 under modulus 23, Alice picks a secret key a-6 and in turn receive the key ß-19 from Bob (a.) (2 points) What is the key that Alice sends to Bob? b) (2 points) What is the shared secret key?
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...
Need help!! please explain — crypto math
thank you!!
7. Alice and Bob use the ElGamal public key cryptosystem with p 19, and a 3. Bob chooses the secret x = 4, What is β? Alice sends the ciphertext (2.3). What is the message? 8. The points (3, +5) e on the elliptic curve y2-a3 2. Find another poin with rational coordinates on this curve. 9. For the elliptic curve y2--2 (mod 7), calculate (3,2)(5,5) 0. Let P (,0) be...
The Diffie-Hellman key exchange is vulnerable to the following type of attack. An opponent Carol intercepts Alice’s public value and sends her own public value to Bob. When Bob transmits his public value, Carol substitutes it with her own and sends it to Alice. After this exchange, Carol simply decrypts any messages sent out by Alice or Bob, and then reads and possibly modifies them before re-encrypting with the appropriate key and transmitting them to the other party. Choose all...
Diffie-Hellman Key Exchange: Alice and Bob wants to agree on a key. First, both agree on p = 23 and g = 5 which is public. Alice chooses her secret key xA = 8 and Bob xB = 14. (a) What will be the shared secret key? (b) DH Key exchange is vulnerable to the following attack. Adversary sits between Alice and Bob, intercepting all messages. Alice and Bob thinks they talk to each other while in fact both talking...
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...
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...
Can some one please help me with this problem based on
cryptography except let p= 521 and a=3 i need help as soon as
possibles thanks in advance
8.5. Compute the two public keys and the common key for the DHKE scheme with the parameters p 467, a 2, and 1. a-3,b-5 2. a 400, b 134 3. a-228, b-57 In all cases, perform the computation of the common key for Alice and Bob. This is also a perfect check...
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...
2. Alice is a student in CSE20. Having learned about the RSA cryptosystem in class, she decides to set-up her own public key as follows. She chooses the primes p=563 and q = 383, so that the modulus is N = 21 5629. She also chooses the encryption key e-49. She posts the num- bers N = 215629 and e-49 to her website. Bob, who is in love with Alice, desires to send her messages every hour. To do so,...