Hostname: page-component-7c8c6479df-995ml Total loading time: 0 Render date: 2024-03-19T04:04:06.473Z Has data issue: false hasContentIssue false

ON FINDING SOLUTIONS TO EXPONENTIAL CONGRUENCES

Published online by Cambridge University Press:  27 December 2018

IGOR E. SHPARLINSKI*
Affiliation:
Department of Pure Mathematics, University of New South Wales, Sydney, NSW 2052, Australia email igor.shparlinski@unsw.edu.au

Abstract

We improve some previously known deterministic algorithms for finding integer solutions $x,y$ to the exponential equation of the form $af^{x}+bg^{y}=c$ over finite fields.

Type
Research Article
Copyright
© 2018 Australian Mathematical Publishing Association Inc. 

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Footnotes

During the preparation of this work, the author was supported in part by the Australian Research Council Grant DP170100786.

References

Berndt, B., Evans, R. and Williams, K. S., Gauss and Jacobi Sums, Canadian Mathematical Society Series of Monographs and Advanced Texts, 21 (John Wiley & Sons, New York, 1998).Google Scholar
Crandall, R. and Pomerance, C., Prime Numbers: A Computational Perspective (Springer, Berlin, 2005).Google Scholar
Lenstra, A. K. and de Weger, B., On the Possibility of Constructing Meaningful Hash Collisions for Public Keys, Lecture Notes in Computer Science, 3574 (Springer, Berlin, 2005), 267279.Google Scholar
Sasaki, Y., ‘On zeros of exponential polynomials and quantum algorithms’, Quantum Inf. Processing 9 (2010), 419427.Google Scholar
Shanks, D., Class Number, A Theory of Factorization and Genera, Proceedings of Symposia in Pure Mathematics, 20 (American Mathematical Society, Providence, RI, 1971), 415440.Google Scholar
Storer, T., Cyclotomy and Difference Sets, Lectures in Advanced Mathematics, 2 (Markham Publishing Company, Chicago, IL, 1967).Google Scholar
van Dam, W. and Shparlinski, I. E., Classical and Quantum Algorithms for Exponential Congruences, Lecture Notes in Computer Science, 5106 (Springer, Berlin, 2008), 110.Google Scholar