Classical and Quantum Algorithms for Exponential Congruences

T. Storer, Cyclotomy and Difference Sets , Lectures in Advanced Mathematics, Markham Publishing Company, 1967

1967

Earlier work this paper cites.

E. Dobrowolski and K. S Williams, An upper bound for the sum ∑ n = a + 1 a + H f ⁡ ( n ) \sum^{a+H}_{n=a+1}f(n) for a certain class of functions f f , Proceedings of the American Mathematical Society , Vol. 114 (1992), pp. 29–35

1992

Earlier work this paper cites.

L. Grover, A fast quantum-mechanical algorithm for database search, Proceedings of the 28th Annual ACM Symposium on Theory of Computing (STOC’96) , 1996, pp. 212–219

1996

Earlier work this paper cites.

R. Lidl and H. Niederreiter, Finite Fields , Encyclopedia of Mathematics and Its Applications, Volume 20, Cambridge University Press, Cambridge, 1997

1997

Earlier work this paper cites.

P. Shor, Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer, SIAM Journal on Computing , Vol. 26 (1997), pp. 1484–1509

1997

Cited alongside, same era.

B. Berndt, R. Evans and K. S. Williams, Gauss and Jacobi Sums , Canadian Mathematical Society Series of Monographs and Advanced Texts, Volume 21, John Wiley & Sons, 1998

1998

Cited alongside, same era.

M. Boyer, G. Brassard, P. Høyer and A. Tapp, Tight bounds on quantum searching, Fortschritte der Physik , Vol. 46 (1998), pp. 493–505

1998

Cited alongside, same era.

D. R. Kohel and I. E. Shparlinski, Exponential sums and group generators for elliptic curves over finite fields, Lecture Notes in Computer Science , Springer-Verlag, Berlin, Vol. 1838 (2000), pp. 395–404

2000

Cited alongside, same era.

H. B. Yu, Estimates of character sums with exponential function, Acta Arithmetica , Vol. 97 (2001), pp. 211–218

Original

2001

Later among the works it cites.

D. Bacon, A. M. Childs and W. van Dam, From optimal measurement to efficient quantum algorithms for the hidden subgroup problem over semidirect product groups, Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS’05) , 2005, pp. 469–478

2005

Later among the works it cites.

R. Crandall and C. Pomerance, Prime numbers: A computational perspective , Springer-Verlag, Berlin, 2005

2005

Later among the works it cites.

A. Lenstra and B. de Weger, On the possibility of constructing meaningful hash collisions for public keys, Lecture Notes in Computer Science , Springer-Verlag, Berlin, Vol. 3574 2005, pp. 267–279

2005

Later among the works it cites.