You are on page 1of 2

CS535(E)_Week#9_16301_LaxmanaRaoGaridepalli

REVIEW QUESTIONS:
10.1 Briefly explain diffie-hellman key exchange?
Ans: the first published public-key algorithm appeared in the seminal paper by diffie and hellman that
defined public-key cryptography and is generally referred to as diffie-hellman key exchange. A number
of commercial products employ this key exchange technique.
The purpose of the algorithm is to enable two users to securely exchange a key that can then be
used for subsequent symmetric encryption of messages. The algorithm itself is limited to the exchange
of secret values.
This algorithm depends for its effectiveness on the difficulty of co,putting discrete logarithms.
10.2 what is an elliptic curve?
Ans: an elliptic curve is defined by an equation in two variables with coefficients. For cryptography,
the variables and coefficients are restricted to elements in a finite field, which results in the definition
of a finite abelian group.
10.3 what is the zero point of an elliptic curve?
Ans: If three points on an elliptic curve lie on a straight line, their sum is O.

m
er as
co
Problems

eH w
10.1
Users A and B use the Diffie-Hellman key exchange technique with a common prime q = 71 and a

o.
primitive root a = 7.
rs e
a. If user A has private key XA = 5, what is A’s public key YA?
ou urc
b. If user B has private key XB = 12, what is B’s public key YB?
c. What is the shared secret key?
o

Answers:-
aC s

a . YA = 75 mod 71= 51
vi y re

b. YB = 712 mod 71= 4


c.
If it is public it cannot be secret...
ed d

A key is "a parameter for an algorithm, which concentrates secrecy". This means that the key is not
ar stu

only secret, but, normally, nothing else.


A public key is a paradoxical terminology which was coined when asymmetric cryptography was
invented. The "real" key is what we call the private key. It is the secret parameter which allows for
is

performing an operation which only the key owner should be able to do


You can imagine the public key as the face of a human being: it is distinctive and can convey
Th

information, but recognizing the face does not tell you what goes inside the brain.
So a "public key" is not really a "key" in the strict sense of the term; and the "private key" could be
sh

called simply "key" or "secret key" because that's what it is.

However, Tradition dictates that we say "private key" for a key of the asymmetric kind
(a key with enough mathematical structure to have a public face, which can be revealed without
endangering the secrecy of the private key),
while keys which are just bunches of bits, for symmetric encryption and similar algorithms, are called
"secret keys" (or "symmetric keys")

This study source was downloaded by 100000806789921 from CourseHero.com on 09-29-2021 05:40:23 GMT -05:00

https://www.coursehero.com/file/19562787/CS535E-Week9-16301gl-LaxmanaRaoGaridepalli/
CS535(E)_Week#9_16301_LaxmanaRaoGaridepalli

10.2 Consider a Diffie-Hellman scheme with a common prime q = 11 and a primitive root a = 2. a.
Show that 2 is a primitive root of 11.
b. If user A has public key YA = 9, what is A’s private key XA?
c. If user B has public key YB = 3, what is the secret key K shared with A?

sol: a. (11) = 10
210 = 1024 = 1 mod 11
If you check 2n for n < 10, you will find that none of the values is 1 mod 11.
b. 6, because 26 mod 11 = 9
c. K = 36 mod 11= 3
10.4 this problem illustrates the point that the diffie-hellman protocol is not secure with out
the step where you take the modules; i.e. the “indiscrete Log Problem” is not a hard
problem! You are eve and have captured Alice and Bob and imprisoned them. You
overhear the following dialog.
Bob: oh,lets not bother with the prime in the diffie-hellman protocol, it will make things easier.

m
er as
Alice: okay, but we still need a base α to raise things to.How about α=3?
Bob: All right, then my result is 27.

co
eH w
Alice: and mine is 243.
What is Bob’s private key XB and Alice’s private key XA:what is their secret combined key?

o.
Sol: rs e
ou urc
xB = 3, xA = 5, the secret combined key is (33)5 = 315 = 14348907.
o
aC s
vi y re
ed d
ar stu
is
Th
sh

This study source was downloaded by 100000806789921 from CourseHero.com on 09-29-2021 05:40:23 GMT -05:00

https://www.coursehero.com/file/19562787/CS535E-Week9-16301gl-LaxmanaRaoGaridepalli/
Powered by TCPDF (www.tcpdf.org)

You might also like