信息安全概论课件-lecture051.pptVIP

Cryptosystems Based on Discrete Logarithms Outline [1] Discrete Logarithm Problem [2] Algorithms for Discrete Logarithm A trivial algorithm Shanks’ algorithm (Baby-step Giant-step) Pollard’s algorithm Pohlig-Hellman algorithm Adleman’s algorithm (the index calculus method) [3] Cryptosystems Based on Discrete Logarithm Key distribution Encryption Digital signature [1] Discrete Logarithm Problem Let G be a finite multiplicative group (G, *). For an element α G having order n, define. α = {α i | i = 0, 1, 2, …, n-1} Then α is a subgroup of G, and α is cyclic of order n. Discrete logarithm problem  Discrete Logarithm Problem Example 1G = Z*19 = { 1, 2, …, 18}n=18, generator g = 2then log214 = 7 log26 = 14 Discrete Logarithm Problem Example 2 In Z*11 = { 1, 2, …, 10} Let G= 3 ={1, 3, 9, 5, 4}, n=5, 3 is not a generator of Z*11 but a generator of G.log35 = 3 Discrete Logarithm Problem Example 3G=GF*(23) with irreducible poly. p(x) = x3 + x +1G=Zp*/p(x) = { 1, x, x2, 1+x, 1+x2, x+x2, 1+x+x2 }n=7, generator g = xthen logx(x+1) = 3 logx(x2+x+1) = 5 logx(x2+1) = 6 Discrete Logarithm Problem Example 4Let p =1053546280395016975304616582933958731948871814925913489342608734258717883575185867300386287737705577937382925873762451990450430661350859682697410256268271147283034897563214300237166369174066615907176472549470083113107138189921280884003892629359 NB: p = 158(2800 + 25) + 1 and has 807 bits. Find such that  [2] Algorithms for Discrete Logarithm A trivial algorithm Shanks’ algorithm (Baby-step giant-step) Pollard rho discrete log algorithm Pohlig-Hellman algorithm The index calculus method A trivial algorithm Discrete Logarithm Problem in Zp*  given generator α (i.e. α= Zp*) and β in Zp* ,  find a in Zp-1={0,1,…,p-2} s.t. β = αa mod p A trivial algorithm Compute αi and test if β = αi Time complexity O(p) Shanks’ algorithm Shanks’ algorithm (Baby-step giant-step)