✦ LIBER ✦

Lower bounds on the linear complexity of the discrete logarithm in finite fields

✍ Scribed by Meidl, W.; Winterhof, A.

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Linear Complexity of the Discrete Logari

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

On the Bounded Sum-of-Digits Discrete Lo

✍ Cheng, Qi 📂 Article 📅 2005 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 174 KB

Lower bounds of the complexity of linear

✍ Dario Bini; Milvio Capovani 📂 Article 📅 1979 🏛 Elsevier Science 🌐 English ⚖ 243 KB

Interpolation of the Discrete Logarithm

✍ Tanja Lange; Arne Winterhof 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 525 KB

On the Bounds of the Bilinear Complexity

✍ Stéphane Ballet; Jean Chaumine 📂 Article 📅 2004 🏛 Springer 🌐 English ⚖ 123 KB

A note on cyclic groups, finite fields,

✍ Alfred J. Menezes; Scott A. Vanstone 📂 Article 📅 1992 🏛 Springer 🌐 English ⚖ 390 KB