Score:-1

Help me to solve 3 Pass DiffiHellman protocol

jp flag

I am trying to solve 3pass Diffihellman problem. However, I could not solve it. Is there any specific rule exist to select a1 and b1 or problem in the calculation. Please help me to solve this problem. enter image description here

enter image description here

Morrolan avatar
ng flag
There is no such thing as the "3 pass Diffie Hellman protocol". Without looking at it too closely, what you describe seems to be Shamir's three-pass protocol. Can you clarify? Assuming this holds: One mistake of yours is that, when calculating $a_1^{-1} \mod{p-1}$, you pick $p - 1 = 8$ instead of $p - 1 = 16$.
Score:1
jp flag

Thank you for your comment. I have solved the problem. The solution is given below. enter image description here

kelalaka avatar
in flag
We rather prefer writing instead of photos of handwritten papers.
A. Hersean avatar
cr flag
Indeed, pictures are not hosted by stackexchange and can become 404, while a copy of the text here will stay and it can be searched. This way, your question and answer have a better chance to help someone else.
mangohost

Post an answer

Most people don’t grasp that asking a lot of questions unlocks learning and improves interpersonal bonding. In Alison’s studies, for example, though people could accurately recall how many questions had been asked in their conversations, they didn’t intuit the link between questions and liking. Across four studies, in which participants were engaged in conversations themselves or read transcripts of others’ conversations, people tended not to realize that question asking would influence—or had influenced—the level of amity between the conversationalists.