Question: We consider a DHKE protocol over a Galois fields GF ( 2 ^ m ) . Up to now, we have been using groups but
We consider a DHKE protocol over a Galois fields GFm Up to now, we have been using groups but it is possible and simple to use GF for DHKE. Here, the generator is a polynomial denoted and we have an irreducible polymomial instead of our public prime denoted as
a In our example here, all arithmetic is done in GF with as an irreducible field polynomial.
b The primitive element for the DiflieHellman scheme is The private keys are and What is the session shared ker kae?
Hint: Derive the publickey of Alice A by using the generator and her private key g a modp in GF Do not forget to reduce using Bob can now find the session key kas through another exponentiation. Do not forget to reduce.
Step by Step Solution
There are 3 Steps involved in it
1 Expert Approved Answer
Step: 1 Unlock
Question Has Been Solved by an Expert!
Get step-by-step solutions from verified subject matter experts
Step: 2 Unlock
Step: 3 Unlock
