Finite fields
Some Estimates for Character Sums and Applications
Designs, Codes and Cryptography
Incomplete Character Sums and Polynomial Interpolation of the Discrete Logarithm
Finite Fields and Their Applications
On the Representation of Boolean Predicates of the Diffie-Hellman Function
STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
Polynomial Interpolation of the Elliptic Curve and XTR Discrete Logarithm
COCOON '02 Proceedings of the 8th Annual International Conference on Computing and Combinatorics
Discrete Applied Mathematics - Special issue: International workshop on coding and cryptography (WCC 2001)
Discrete Applied Mathematics - Special issue: Coding and cryptography
Interpolation of the Double Discrete Logarithm
WAIFI '08 Proceedings of the 2nd international workshop on Arithmetic of Finite Fields
Polynomial Interpolation of the k-th Root of the Discrete Logarithm
CAI '09 Proceedings of the 3rd International Conference on Algebraic Informatics
Discrete Applied Mathematics - Special issue: Coding and cryptography
Complexity theoretic aspects of some cryptographic functions
COCOON'03 Proceedings of the 9th annual international conference on Computing and combinatorics
Interpolation of functions related to the integer factoring problem
WCC'05 Proceedings of the 2005 international conference on Coding and Cryptography
Mathematical and Computer Modelling: An International Journal
Polynomial representations of the Lucas logarithm
Finite Fields and Their Applications
Incomplete Character Sums and Polynomial Interpolation of the Discrete Logarithm
Finite Fields and Their Applications
| Hi-index | 0.00 |
Recently, Coppersmith and Shparlinski proved several results on the interpolation of the discrete logarithm in the finite prime field \Bbb{F}_p by polynomials modulo p and modulo p-1, respectively. In this paper most of these results are extended to arbitrary \Bbb{F}_{p^r}.