Suppose that users Alice and Bob carry out the 3- pass Diffie-Hellman protocol with p = 101. Suppose that Alice chooses a1 = 19 and Bob chooses b1 = 13. If Alice wants to send the secret message m=5 to Bob, show all the messages exchanged between Alice and Bob

Encrypt the animal name marmot using the letter to number correspondence abc de f 8hijk 1 mnopar stuvw x y 2 e 1 2 3 4 5 6 7 8 9 18 11 12 13 14 15 16 17 18 19 28 21 22 23 24 25 and the encryption function e :n + (n +1) mod 26 The answer will be a nonsense word (no numbers).

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 Yn=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₂?

Many forms of cryptography are based on the following discrete log problem. Choose a cyclic group G (produced by one generator g) with finitely many elements. Alice and Bob want to set up a secret communication and need a secret key for that, which becomes a group element from G. They set up the following exchange (the so-called Diffie-Hellman protocol): 1. Alice chooses a secret group element a and sends unsecured g^a to Bob 2.Bob chooses a secret group element b and sends unsecured g^b to Alice 3. Alice calculates (g^b )^a and keeps this group element secret 4.Bob calculates (g^a )^b and keeps this group element secret Since a cyclic group is abelian, Alice and Bob now share the secret key (g^b )^a=(g^a )^b. The blue group elements are publicly known, the red elements are secret. The discrete log problem presented to an eavesdropper is computing say a from the publicly known data G,g,g^a. The naming of the problem comes from the solution a= glog⁡(ga ) which is generally difficult to…

Design a cryptographic solution for implementing the dinning cryptographers protocol.  You should consider the following: The secret messages shared between any two agents in the protocol are communicated over public channels only. The announcements made by each agent must be traceable in a trustworthy way to that agent.   Your solution should be a new protocol that addresses the above two requirements.

dont post copied or existing one skip skip if dont know