Scribd
Upload
25 views18 pages

Diffie

Uploaded by

poojav1142
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
25 views18 pages

Diffie

Uploaded by

poojav1142
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 18

Diffie Hellman Key exchange

&
Elliptic curve cryptography
Diffie-Hellman Key Exchange

• first public-key type scheme proposed


• by Diffie & Hellman in 1976 along with the
exposition of public key concepts
• note: now know that Williamson (UK CESG) secretly
proposed the concept in 1970
• is a practical method for public exchange of a
secret key
• used in a number of commercial products
Diffie-Hellman Key Exchange
 a public-key distribution scheme
 cannot be used to exchange an arbitrary message
 rather it can establish a common key
 known only to the two participants
 value of key depends on the participants (and
their private and public key information)
 based on exponentiation in a finite (Galois) field
(modulo a prime or a polynomial) - easy
 security relies on the difficulty of computing
discrete logarithms (similar to factoring) – hard
Diffie-Hellman Setup
 all users agree on global parameters:
 large prime integer or polynomial q
 a being a primitive root mod q
 each user (eg. A) generates their key
 chooses a secret key (number): xA < q
xA
 compute their public key: yA = a mod q
 each user makes public that key yA
Diffie-Hellman Key Exchange
 shared session key for users A & B is KAB:
x x
KAB = a A. B mod q
x
= yA B mod q (which B can compute)
x
= yB A mod q (which A can compute)

 KAB is used as session key in private-key


encryption scheme between Alice and Bob
 if Alice and Bob subsequently communicate,
they will have the same key as before, unless
they choose new public-keys
 attacker needs an x, must solve discrete log
Diffie-Hellman Example
 users Alice & Bob who wish to swap keys:
 agree on prime q=353 and a=3
 select random secret keys:
 A chooses xA=97, B chooses xB=233
 compute respective public keys:
97
 yA=3 mod 353 = 40 (Alice)
233
 yB=3 mod 353 = 248 (Bob)
 compute shared session key as:
x 97
 KAB= yB A mod 353 = 248 = 160 (Alice)
x 233
 KAB= yA B mod 353 = 40 = 160 (Bob)
ElGamal Cryptography
 public-key cryptosystem related to D-H
 uses exponentiation in a finite field
 with security based difficulty of computing
discrete logarithms, as in D-H
 each user (eg. A) generates their key
 chooses a secret key (number): 1 < xA < q-1
xA
 compute their public key: yA = a mod q
ElGamal Message Exchange
 Bob encrypts a message to send to A computing
 represent message M in range 0 <= M <= q-1
•longer messages must be sent as blocks
 chose random integer k with 1 <= k <= q-1
k
 compute one-time key K = yA mod q
 encrypt M as a pair of integers (C1,C2) where
•C1 = a mod q ; C2 = KM mod q
k

 A then recovers message by


 recovering key K as K = C1xA mod q
 computing M as M = C2 K-1 mod q
 a unique k must be used each time
 otherwise result is insecure
ElGamal Example
 use field GF(19) q=19 and a=10
 Alice computes her key:
5
 A chooses xA=5 & computes yA=10 mod 19 = 3
 Bob send message m=17 as (11,5) by
 chosing random k=6
k 6
 computing K = yA mod q = 3 mod 19 = 7
k 6
 computing C1 = a mod q = 10 mod 19 = 11;
C2 = KM mod q = 7.17 mod 19 = 5
 Alice recovers original message by computing:
5
 recover K = C1xA mod q = 11 mod 19 = 7
 compute inverse K-1 = 7-1 = 11
 recover M = C2 K-1 mod q = 5.11 mod 19 = 17
Elliptic Curve Cryptography
 majority of public-key crypto (RSA, D-H)
use either integer or polynomial arithmetic
with very large numbers/polynomials
 imposes a significant load in storing and
processing keys and messages
 an alternative is to use elliptic curves
 offers same security with smaller bit sizes
 newer, but not as well analysed
Real Elliptic Curves
 an elliptic curve is defined by an equation in
two variables x & y, with coefficients
 consider a cubic elliptic curve of form
 y2 = x3 + ax + b
 where x,y,a,b are all real numbers
 also define zero point O
 consider set of points E(a,b) that satisfy
 have addition operation for elliptic curve
 geometrically sum of P+Q is reflection of the
intersection R
Real Elliptic Curve Example
Finite Elliptic Curves
 Elliptic
curve cryptography uses curves
whose variables & coefficients are finite
 have two families commonly used:
 prime curves Ep(a,b) defined over Zp
•use integers modulo a prime
•best in software

 binary curves E2m(a,b) defined over GF(2n)


•use polynomials with binary coefficients
•best in hardware
Elliptic Curve Cryptography
 ECC addition is analog of modulo multiply
 ECC repeated addition is analog of
modulo exponentiation
 need “hard” problem equiv to discrete log
 Q=kP, where Q,P belong to a prime curve
 is “easy” to compute Q given k,P
 but “hard” to find k given Q,P
 known as the elliptic curve logarithm problem
 Certicom example: E23(9,17)
ECC Diffie-Hellman
 can do key exchange analogous to D-H
 users select a suitable curve Eq(a,b)
 select base point G=(x1,y1)
 with large order n s.t. nG=O
A& B select private keys nA<n, nB<n
 compute public keys: PA=nAG, PB=nBG
 compute shared key: K=nAPB, K=nBPA
 same since K=nAnBG
 attacker would need to find k, hard
ECC Encryption/Decryption
 several alternatives, will consider simplest
 must first encode any message M as a point on
the elliptic curve Pm
 select suitable curve & point G as in D-H
 each user chooses private key nA<n
 and computes public key PA=nAG
 to encrypt Pm : Cm={kG, Pm+kPb}, k random
 decrypt Cm compute:
Pm+kPb–nB(kG) = Pm+k(nBG)–nB(kG) = Pm
ECC Security
 relies on elliptic curve logarithm problem
 fastest method is “Pollard rho method”
 compared to factoring, can use much
smaller key sizes than with RSA etc
 for equivalent key lengths computations
are roughly equivalent
 hence for similar security ECC offers
significant computational advantages
Summary
 have considered:
 Diffie-Hellman key exchange
 ElGamal cryptography
 Elliptic Curve cryptography

You might also like