Lecture Note
University
California State University, Los AngelesCourse
CS4780 | Cryptography and Information SecurityPages
2
Academic year
2023
Julie Elizabeth John
Views
0
Diffic - Helman Key Exchange only used for exchanging the keys. b in = a (mod p) where osis (p-1). i - descrete logarithm for the base amat 9- - Prime no. L - integer and is a Princitive root ofq. User A selects a random integer XAKq and YA = 2XA modq 111rly B selects XB 49 and YB = 2XB moda Prive that Kz (LYB) XA midd q Es same as that of K-(AA) XB nood Proof K = (YB) XA moda = (x XB moda) XA modd 9 = (xxB) XA mod q = XB XA mode = (x XA)XB moda
food prises 17: XB pass = (x? XA mod a) moda at visi = (1A)X& stirmar N 1332000 ij 1 mod a for bratzin wi Too Zimping art ford biwards P with Alige 22859 Hence P.d. pois / did Air
Diffie Helman Key Exchange
Please or to post comments