HW1 | CMSC414: Computer/Network Security

]]>But my question is that 1%anything always equals 1.

I am confused because 5*13709 does not equal 1.

Can you please explain? ]]>

can you send me the solution for p=13 and g=2 and k^u base a =7 and what is private key

]]>– In general, one can always compute a^{-1} mod b using the extended Euclidean algorithm. The details are in my book “Introduction to Modern Cryptography.”

– In this specific case, we know that the order of the group Z^*_{71} is 70 (because 71 is prime). Since a^{70} = 1 mod 71 for any a \in Z^*_{71}, we have that a^{-1} = a^{69} mod 71 for any a.

]]>[…]Lecture 1 « CMSC414: Computer/Network Security[…]…

]]>What exactly is your question…?

]]>