Interpolation of the Double Discrete Logarithm

  • Gerasimos C. Meletiou
  • Arne Winterhof
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5130)


The double discrete logarithm has attracted interest as a one-way function in cryptography, in particular in group signature schemes and publicly verifiable secret sharing schemes. We obtain lower bounds on the degrees of polynomials interpolating the double discrete logarithm in multiplicative subgroups of a finite field and in the group of points on an elliptic curve over a finite field, respectively. These results support the assumption of hardness of the double discrete logarithm if the parameters are properly chosen. Similar results for other cryptographic one-way functions including the discrete logarithm, the Diffie-Hellmann mapping and related functions as well as functions related to the integer factoring problem have already been known to the literature. The investigations on the double discrete logarithm in this paper are motivated by these results on other cryptographic functions.


double discrete logarithm interpolation polynomials finite fields elliptic curves 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Adelmann, C., Winterhof, A.: Interpolation of functions related to the integer factoring problem. In: Ytrehus, Ø. (ed.) WCC 2005. LNCS, vol. 3969, pp. 144–154. Springer, Heidelberg (2006)CrossRefGoogle Scholar
  2. 2.
    Aly, H., Winterhof, A.: Polynomial representations of the Lucas logarithm. Finite Fields Appl. 12(3), 413–424 (2006)CrossRefMathSciNetzbMATHGoogle Scholar
  3. 3.
    Ateniese, G., Tsudik, G.: Some open issues and new directions in group signatures. In: Franklin, M. (ed.) FCT 1999. LNCS, vol. 1684, pp. 196–211. Springer, Heidelberg (1999)Google Scholar
  4. 4.
    Ateniese, G., Song, D., Tsudik, G.: Quasi efficient revocation group signatures. In: Blaze, M. (ed.) FC 2002. LNCS, vol. 2357, pp. 183–197. Springer, Heidelberg (2003)CrossRefGoogle Scholar
  5. 5.
    Blake, I.F., Seroussi, G., Smart, N.: Elliptic Curves in Cryptography. Reprint of the 1999 original. London Mathematical Society Lecture Note Series, vol. 265. Cambridge University Press, Cambridge (2000)Google Scholar
  6. 6.
    Brandstätter, N., Lange, T., Winterhof, A.: On the non-linearity and sparsity of Boolean functions related to the discrete logarithm in finite fields of characteristic two. In: Ytrehus, Ø. (ed.) WCC 2005. LNCS, vol. 3969, pp. 135–143. Springer, Heidelberg (2006)CrossRefGoogle Scholar
  7. 7.
    Brandstätter, N., Winterhof, A.: Approximation of the discrete logarithm in finite fields of even characteristic by real polynomials. Arch. Math. (Brno) 42(1), 43–50 (2006)MathSciNetzbMATHGoogle Scholar
  8. 8.
    Bussard, L., Roudier, Y., Molva, R.: Untraceable secret credentials: trust establishment with privacy. Pervasive Computing and Communications Workshops, 2004. In: Proceedings of the Second IEEE Annual Conference, March 14-17, 2004, pp. 122–126 (2004)Google Scholar
  9. 9.
    Camenisch, J.: Group signature schemes and payment systems based on the discrete logarithm problem. Phd-thesis, ETH Zürich, Diss. ETH No. 12520 (1998)Google Scholar
  10. 10.
    Camenisch, J., Stadler, M.: Efficient group signature schemes for large groups. In: Kaliski Jr., B.S. (ed.) CRYPTO 1997. LNCS, vol. 1294, pp. 410–424. Springer, Heidelberg (1997)Google Scholar
  11. 11.
    Coppersmith, D., Shparlinski, I.: On polynomial approximation of the discrete logarithm and the Diffie-Hellman mapping. J. Cryptology 13(3), 339–360 (2000)CrossRefMathSciNetzbMATHGoogle Scholar
  12. 12.
    Elkamchouchi, H.M., Nasr, M.E., Esmail, R.: New public key techniques based on double discrete logarithm problem. Radio Science Conference, 2004. NRSC 2004. In: Proceedings of the Twenty-First National, vol. C23, pp. 1–9 (2004)Google Scholar
  13. 13.
    El Mahassni, E., Shparlinski, I.E.: Polynomial representations of the Diffie-Hellman mapping. Bull. Austral. Math. Soc. 63, 467–473 (2001)MathSciNetzbMATHGoogle Scholar
  14. 14.
    Kiltz, E., Winterhof, A.: Lower bounds on weight and degree of bivariate polynomials related to the Diffie-Hellman mapping. Bull. Austral. Math. Soc. 69, 305–315 (2004)MathSciNetzbMATHGoogle Scholar
  15. 15.
    Kiltz, E., Winterhof, A.: Polynomial interpolation of cryptographic functions related to Diffie-Hellman and discrete logarithm problem. Discrete Appl. Math. 154, 326–336 (2006)CrossRefMathSciNetzbMATHGoogle Scholar
  16. 16.
    Korobov, N.M.: The distribution of digits in periodic fractions. Mat. Sb. (N.S.) 89(131), 654–670, 672 (1972) (Russian)MathSciNetGoogle Scholar
  17. 17.
    Konoma, C., Mambo, M., Shizuya, H.: The computational difficulty of solving cryptographic primitive problems related to the discrete logarithm problem. IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences E88-A(1), 81–88 (2005)CrossRefGoogle Scholar
  18. 18.
    Konyagin, S.V., Shparlinski, I.E.: Character Sums with Exponential Functions and Their Applications. Cambridge Tracts in Mathematics, vol. 136. Cambridge University Press, Cambridge (1999)zbMATHGoogle Scholar
  19. 19.
    Kula, M.A.: A cryptosystem based on double exponentiation. Tatra Mt. Math. Publ. 25, 67–80 (2002)MathSciNetzbMATHGoogle Scholar
  20. 20.
    Lang, S.: Elliptic Curves: Diophantine Analysis. Springer, Berlin (1978)zbMATHGoogle Scholar
  21. 21.
    Lange, T., Winterhof, A.: Polynomial Interpolation of the Elliptic Curve and XTR Discrete Logarithm. In: Ibarra, H.O., Zhang, L. (eds.) COCOON 2002. LNCS, vol. 2387, pp. 137–143. Springer, Heidelberg (2002)CrossRefGoogle Scholar
  22. 22.
    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, 223–229 (2002)MathSciNetzbMATHCrossRefGoogle Scholar
  23. 23.
    Lange, T., Winterhof, A.: Interpolation of the discrete logarithm in \( F\sb q\) by Boolean functions and by polynomials in several variables modulo a divisor of q − 1. In: International Workshop on Coding and Cryptography (WCC 2001), Paris (2001); Discrete Appl. Math. 128, 193–206 (2003) Google Scholar
  24. 24.
    Lange, T., Winterhof, A.: Interpolation of the elliptic curve Diffie-Hellman mapping. In: Fossorier, M.P.C., Høholdt, T., Poli, A. (eds.) AAECC 2003. LNCS, vol. 2643, pp. 51–60. Springer, Heidelberg (2003)CrossRefGoogle Scholar
  25. 25.
    Lysyanskaya, A., Ramzan, Z.: Group blind digital signatures: A scalable solution to electronic cash. In: Hirschfeld, R. (ed.) FC 1998. LNCS, vol. 1465, pp. 184–197. Springer, Heidelberg (1998)CrossRefGoogle Scholar
  26. 26.
    Meidl, W., Winterhof, A.: A polynomial representation of the Diffie-Hellman mapping. Appl. Algebra Engrg. Comm. Comput. 13, 313–318 (2002)CrossRefMathSciNetzbMATHGoogle Scholar
  27. 27.
    Meletiou, G.C.: Explicit form for the discrete logarithm over the field GF(p,k). Arch. Math. (Brno) 29, 25–28 (1993)MathSciNetzbMATHGoogle Scholar
  28. 28.
    Meletiou, G.C., Mullen, G.L.: A note on discrete logarithms in finite fields. Appl. Algebra Engrg. Comm. Comput. 3(1), 75–78 (1992)CrossRefMathSciNetzbMATHGoogle Scholar
  29. 29.
    Menezes, A.: Elliptic curve public key cryptosystems. Communications and Information Theory. The Kluwer International Series in Engineering and Computer Science, vol. 234. Kluwer Academic Publishers, Boston (1993)zbMATHGoogle Scholar
  30. 30.
    Mullen, G.L., White, D.: A polynomial representation for logarithms in GF(q). Acta Arith. 47(3), 255–261 (1986)MathSciNetzbMATHGoogle Scholar
  31. 31.
    Niederreiter, H.: A short proof for explicit formulas for discrete logarithms in finite fields. Appl. Algebra Engrg. Comm. Comput. 1(1), 55–57 (1990)CrossRefMathSciNetzbMATHGoogle Scholar
  32. 32.
    Niederreiter, H., Winterhof, A.: Incomplete character sums and polynomial interpolation of the discrete logarithm. Finite Fields Appl. 8(2), 184–192 (2002)CrossRefMathSciNetzbMATHGoogle Scholar
  33. 33.
    Satoh, T.: On degree of polynomial interpolations related to elliptic curve cryptography. In: Ytrehus, Ø. (ed.) WCC 2005. LNCS, vol. 3969, pp. 155–163. Springer, Heidelberg (2006)CrossRefGoogle Scholar
  34. 34.
    Schoof, R.: Elliptic curves over finite fields and the computation of square roots mod. p. Math. Comp. 44, 483–494 (1985)CrossRefMathSciNetzbMATHGoogle Scholar
  35. 35.
    Shparlinski, I.E.: Cryptographic Applications of Analytic Number Theory. Complexity Lower Bounds and Pseudorandomness. Progress in Computer Science and Applied Logic, vol. 22. Birkhäuser Verlag, Basel (2003)Google Scholar
  36. 36.
    Silverman, J.H.: The Arithmetic of Elliptic Curves. Graduate texts in mathematics, vol. 106. Springer, Heidelberg (1986)zbMATHGoogle Scholar
  37. 37.
    Stadler, M.: Publicly verifiable secret sharing. In: Maurer, U.M. (ed.) EUROCRYPT 1996. LNCS, vol. 1070, pp. 190–199. Springer, Heidelberg (1996)Google Scholar
  38. 38.
    Tso, R., Okamoto, T., Okamoto, E.: Practical strong designated verifer signature schemes based on double discrete logarithms. In: Feng, D., Lin, D., Yung, M. (eds.) CISC 2005. LNCS, vol. 3822, pp. 113–127. Springer, Heidelberg (2005)CrossRefGoogle Scholar
  39. 39.
    Wang, G., Qing, S.: Security flaws in several group signatures proposed by Popescu. In: Gervasi, O., Gavrilova, M.L., Kumar, V., Laganá, A., Lee, H.P., Mun, Y., Taniar, D., Tan, C.J.K. (eds.) ICCSA 2005. LNCS, vol. 3482, pp. 711–718. Springer, Heidelberg (2005)Google Scholar
  40. 40.
    Winterhof, A.: A note on the interpolation of the Diffie-Hellman mapping. Bull. Austral. Math. Soc. 64, 475–477 (2001)MathSciNetzbMATHGoogle Scholar
  41. 41.
    Winterhof, A.: Polynomial interpolation of the discrete logarithm. Des. Codes Cryptogr. 25, 63–72 (2002)CrossRefMathSciNetzbMATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2008

Authors and Affiliations

  • Gerasimos C. Meletiou
    • 1
  • Arne Winterhof
    • 2
  1. 1.A.T.E.I. of EpirusArtaGreece
  2. 2.Johann Radon Institute for Computational and Applied Mathematics, Austrian Academy of SciencesLinzAustria

Personalised recommendations