Approximation of the discrete logarithm in finite fields of even characteristic by real polynomials

 Access to full text

 Full (PDF)

 Access to full text

1. Cochrane T., On a trigonometric inequality of Vinogradov, J. Number Theory 27 (1987), 9–16. (1987) Zbl0629.10030MR0904002
2. Coppersmith D., Shparlinski I., On polynomial approximation of the discrete logarithm and the Diffie-Hellman mapping, J. Cryptology 13 (2000), 339–360. Zbl1038.94007MR1768482
3. Ding C., Helleseth T., On cyclotomic generator of order $r$, Inform. Process. Lett. 66 (1998), 21–25. (1998) Zbl1078.94511MR1626061
4. Kiltz E., Winterhof A., Polynomial interpolation of cryptographic functions related to Diffie-Hellman and discrete logarithm problem, Discrete Appl. Math. 154 (2006), 326–336. Zbl1092.94024MR2194405
5. Konyagin S., Lange T., Shparlinski I., Linear complexity of the discrete logarithm, Des. Codes Cryptogr. 28 (2003), 135–146. Zbl1024.11078MR1962801
6. Lange T., Winterhof A., Polynomial interpolation of the elliptic curve and XTR discrete logarithm, Lecture Notes in Comput. Sci. 2387 (2002), 137–143. Zbl1077.94518MR2064510
7. Lange T., Winterhof A., Incomplete character sums over finite fields and their application to the interpolation of the discrete logarithm by Boolean functions, Acta Arith. 101 (2002), 223–229. Zbl0998.11070MR1875841
8. Lange T., Winterhof A., Interpolation of the discrete logarithm in $F_q$ by Boolean functions and by polynomials in several variables modulo a divisor of $q-1$, Discrete Appl. Math. 128 (2003), 193–206. MR1991426
9. Meidl W., Winterhof A., Lower bounds on the linear complexity of the discrete logarithm in finite fields, IEEE Trans. Inform. Theory 47 (2001), 2807–2811. Zbl1032.94004MR1872841
10. Meletiou G. C., Explicit form for the discrete logarithm over the field $\text{G}F(p,k)$, Arch. Math. (Brno) 29 (1993), 25–28. (1993) Zbl0818.11049MR1242625
11. Meletiou G. C., Explicit form for the discrete logarithm over the field $\text{G}F(p,k)$, Bul. Inst. Politeh. Iaşi. Secţ. I. Mat. Mec. Teor. Fiz. 41(45) (1995), 1–4. (1995) MR1491193
12. Meletiou G. C., Mullen G. L., A note on discrete logarithms in finite fields, Appl. Algebra Engrg. Comm. Comput. 3 (1992), 75–78. (1992) Zbl0749.11055MR1325748
13. Menezes A. J., van Oorschot P. C., Vanstone S. A., Handbook of applied cryptography, CRC Press, Boca Raton, FL 1997. (1997) Zbl0868.94001MR1412797
14. Mullen G. L., White D., A polynomial representation for logarithms in $\text{G}F\left(q\right)$, Acta Arith. 47 (1986), 255–261. (1986) MR0870668
15. Niederreiter H., A short proof for explicit formulas for discrete logarithms in finite fields, Appl. Algebra Engrg. Comm. Comput. 1 (1990), 55–57. (1990) Zbl0726.11079MR1325511
16. Niederreiter H., Winterhof A., Incomplete character sums and polynomial interpolation of the discrete logarithm, Finite Fields Appl. 8 (2002), 184–192. (192.) MR1894512
17. Risler J.-J., Khovansky’s theorem and complexity theory, Rocky Mountain J. Math. 14 (1984), 851–853. (1984) MR0773123
18. Risler J.-J., Additive complexity of real polynomials, SIAM J. Comp. 14 (1985), 178–183. (1985) MR0774937
19. Rojas J. M., Additive complexity and p-adic roots of polynomials, Lecture Notes in Comput. Sci. 2369 (2002), 506–516. MR2041107
20. Rojas J. M., Arithmetic multivariate Descartes’ rule, Amer. J. Math. 126 (2004), 1–30. Zbl1046.12001MR2033562
21. Shparlinski I., Number theoretic methods in cryptography. Complexity lower bounds, Birkhäuser, Basel 1999. (1999) Zbl0912.11057MR1707287
22. Shparlinski I., Cryptographic applications of analytic number theory. Complexity lower bounds and pseudorandomness, Birkhäuser, Basel 2003. MR1954519
23. Winterhof A., Some estimates for character sums and applications, Des. Codes Cryptogr. 22 (2001), 123–131. Zbl0995.11067MR1813781
24. Winterhof A., Incomplete additive character sums and applications, In: Jungnickel, D. and Niederreiter, H. (eds.): Finite fields and applications, 462–474, Springer, Heidelberg 2001. Zbl1019.11034MR1849268
25. Winterhof A., Polynomial interpolation of the discrete logarithm, Des. Codes Cryptogr. 25 (2002), 63–72. Zbl1017.11065MR1881340
26. Winterhof A., A note on the linear complexity profile of the discrete logarithm in finite fields, Progress Comp. Sci. Appl. Logic 23 (2004), 359–367. Zbl1063.11052MR2090662