Can you crack DiffieHellman?
Computer Science Level 5
Here is Eddie's take on the DiffieHellman Cryptosystem.
However, not using large enough key sizes can be a problem.
Given below is a generator \(g\), a prime \(p\) and a public key \(B\) such that \[g^b \equiv B \pmod p \] for some private key \(b\).
Find \(b\)
1 2 3 

Your answer seems reasonable.
Find out if you're right!
Sign up to access problem solutions.
That seems reasonable.
Find out if you're right!
Already have an account? Log in here.