✦ LIBER ✦

On the complexity of the discrete logarithm and Diffie–Hellman problems

✍ Scribed by Ian F. Blake; Theo Garefalakis

Book ID: 108163745
Publisher: Elsevier Science
Year: 2004
Tongue: English
Weight: 315 KB
Volume: 20
Category: Article
ISSN: 0885-064X
DOI: 10.1016/j.jco.2004.01.002

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On Polynomial Approximation of the Discr

On Polynomial Approximation of the Discrete Logarithm and the Diffie—Hellman Mapping

✍ Don Coppersmith; Igor Shparlinski 📂 Article 📅 2000 🏛 Springer 🌐 English ⚖ 131 KB

Polynomial interpolation of cryptographi

Polynomial interpolation of cryptographic functions related to Diffie–Hellman and discrete logarithm problem

✍ Eike Kiltz; Arne Winterhof 📂 Article 📅 2006 🏛 Elsevier Science 🌐 English ⚖ 209 KB

The Twin Diffie–Hellman Problem and Appl

The Twin Diffie–Hellman Problem and Applications

✍ David Cash; Eike Kiltz; Victor Shoup 📂 Article 📅 2009 🏛 Springer 🌐 English ⚖ 629 KB

On the bit security of the weak Diffie–H

On the bit security of the weak Diffie–Hellman problem

✍ Dongyoung Roh; Sang Geun Hahn 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 149 KB

On the Distribution of the Diffie–Hellma

On the Distribution of the Diffie–Hellman Pairs

✍ Igor E. Shparlinski 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 121 KB

Let % N be a prime "eld of p elements and let g be an element of % N of multiplicative order t modulo p. We show that for any '0 and t5p>C the distribution of the Dif-2002 Elsevier Science (USA)

Linear Complexity of the Discrete Logari

Linear Complexity of the Discrete Logarithm

✍ Sergei Konyagin; Tanja Lange; Igor Shparlinski 📂 Article 📅 2003 🏛 Springer 🌐 English ⚖ 87 KB