Classical and Quantum Algorithms for Exponential Congruences

  • Wim van Dam
  • Igor E. Shparlinski
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5106)

Abstract

We discuss classical and quantum algorithms for solvability testing and finding integer solutions x,y of equations of the form afx + bgy = c over finite fields Open image in new window. A quantum algorithm with time complexity q3/8 (logq)O(1) is presented. While still superpolynomial in logq, this quantum algorithm is significantly faster than the best known classical algorithm, which has time complexity q9/8 (logq)O(1). Thus it gives an example of a natural problem where quantum algorithms provide about a cubic speed-up over classical ones.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Bacon, D., Childs, A.M., van Dam, W.: From optimal measurement to efficient quantum algorithms for the hidden subgroup problem over semidirect product groups. In: Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2005), pp. 469–478 (2005)Google Scholar
  2. 2.
    Berndt, B., Evans, R., Williams, K.S.: Gauss and Jacobi Sums. Canadian Mathematical Society Series of Monographs and Advanced Texts, vol. 21. John Wiley & Sons, Chichester (1998)MATHGoogle Scholar
  3. 3.
    Boyer, M., Brassard, G., Høyer, P., Tapp, A.: Tight bounds on quantum searching. Fortschritte der Physik 46, 493–505 (1998)CrossRefGoogle Scholar
  4. 4.
    Crandall, R., Pomerance, C.: Prime numbers: A computational perspective. Springer, Berlin (2005)MATHGoogle Scholar
  5. 5.
    Dobrowolski, E., Williams, K.S.: An upper bound for the sum \(\sum\sp {a+H}\sb {n=a+1}f(n)\) for a certain class of functions f. Proceedings of the American Mathematical Society 114, 29–35 (1992)Google Scholar
  6. 6.
    Grover, L.: A fast quantum-mechanical algorithm for database search. In: Proceedings of the 28th Annual ACM Symposium on Theory of Computing (STOC 1996), pp. 212–219 (1996)Google Scholar
  7. 7.
    Kohel, D.R., Shparlinski, I.E.: Exponential sums and group generators for elliptic curves over finite fields. In: Bosma, W. (ed.) ANTS 2000. LNCS, vol. 1838, pp. 395–404. Springer, Heidelberg (2000)CrossRefGoogle Scholar
  8. 8.
    Lenstra, A., de Weger, B.: On the possibility of constructing meaningful hash collisions for public keys. In: Boyd, C., González Nieto, J.M. (eds.) ACISP 2005. LNCS, vol. 3574, pp. 267–279. Springer, Heidelberg (2005)CrossRefGoogle Scholar
  9. 9.
    Lidl, R., Niederreiter, H.: Finite Fields. Encyclopedia of Mathematics and Its Applications, vol. 20. Cambridge University Press, Cambridge (1997)MATHGoogle Scholar
  10. 10.
    Shor, P.: Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM Journal on Computing 26, 1484–1509 (1997)MathSciNetCrossRefMATHGoogle Scholar
  11. 11.
    Storer, T.: Cyclotomy and Difference Sets. Lectures in Advanced Mathematics. Markham Publishing Company (1967)Google Scholar
  12. 12.
    Yu, H.B.: Estimates of character sums with exponential function. Acta Arithmetica 97, 211–218 (2001)MathSciNetCrossRefMATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2008

Authors and Affiliations

  • Wim van Dam
    • 1
  • Igor E. Shparlinski
    • 2
  1. 1.Department of Computer Science, Department of PhysicsUniversity of CaliforniaSanta BarbaraUSA
  2. 2.Department of ComputingMacquarie UniversityAustralia

Personalised recommendations