[PDF][PDF] The discrete logarithm problem and its application in Cryptography
R Oyono - Lectures in Cryptography for Master Class …, 2009 - verso.mat.uam.es
Lectures in Cryptography for Master Class. Universidad Autónoma de …, 2009•verso.mat.uam.es
DLP (ElGamal Cryptosystem, Diffie-Hellman key exchange): Let G be a cyclic finite abelian
group and g∈ G be a generator of G. The discrete logarithm problem (DLP) in G is the
following: Given an element h∈ G, find the smallest positive integer x such that h=[x] g
(additive group)/h= gx (multiplicative group).
group and g∈ G be a generator of G. The discrete logarithm problem (DLP) in G is the
following: Given an element h∈ G, find the smallest positive integer x such that h=[x] g
(additive group)/h= gx (multiplicative group).
DLP (ElGamal Cryptosystem, Diffie-Hellman key exchange): Let G be a cyclic finite abelian group and g∈ G be a generator of G. The discrete logarithm problem (DLP) in G is the following: Given an element h∈ G, find the smallest positive integer x such that h=[x] g (additive group)/h= gx (multiplicative group).
verso.mat.uam.es
以上显示的是最相近的搜索结果。 查看全部搜索结果