Add to ORKGsummary:We obtain lower bounds on degree and additive complexity of real polynomials approximating the discrete logarithm in finite fields of even characteristic. These bounds complement earlier results for finite fields of odd characteristic
Recently, several striking advances have taken place regarding the discrete logarithm problem (DLP) ...
In this paper, we revisit the ZigZag strategy of Granger, Kleinjung and Zumbrägel. In particular, we...
We propose various strategies for improving the computation of discrete logarithms in non-prime fiel...
summary:We obtain lower bounds on degree and additive complexity of real polynomials approximating t...
summary:We obtain lower bounds on degree and additive complexity of real polynomials approximating t...
AbstractRecently, Shparlinski proved several results on the interpolation of the discrete logarithm ...
AbstractWe deduce exact formulas for polynomials representing the Lucas logarithm and prove lower bo...
Recently, Shparlinski proved several results on the interpolation of the discrete logarithm in finit...
Recently, Shparlinski proved several results on the interpolation of the discrete logarithm in finit...
Recently, Shparlinski proved several results on the interpolation of the discrete logarithm in finit...
Recently, Shparlinski proved several results on the interpolation of the discrete logarithm in finit...
Recently, Shparlinski proved several results on the interpolation of the discrete logarithm in finit...
Recently, Shparlinski proved several results on the interpolation of the discrete logarithm in finit...
AbstractIn the first part of the paper, certain incomplete character sums over a finite field Fpr ar...
The discrete logarithm over finite fields of small characteristic can be solved much more efficientl...
Recently, several striking advances have taken place regarding the discrete logarithm problem (DLP) ...
In this paper, we revisit the ZigZag strategy of Granger, Kleinjung and Zumbrägel. In particular, we...
We propose various strategies for improving the computation of discrete logarithms in non-prime fiel...
summary:We obtain lower bounds on degree and additive complexity of real polynomials approximating t...
summary:We obtain lower bounds on degree and additive complexity of real polynomials approximating t...
AbstractRecently, Shparlinski proved several results on the interpolation of the discrete logarithm ...
AbstractWe deduce exact formulas for polynomials representing the Lucas logarithm and prove lower bo...
Recently, Shparlinski proved several results on the interpolation of the discrete logarithm in finit...
Recently, Shparlinski proved several results on the interpolation of the discrete logarithm in finit...
Recently, Shparlinski proved several results on the interpolation of the discrete logarithm in finit...
Recently, Shparlinski proved several results on the interpolation of the discrete logarithm in finit...
Recently, Shparlinski proved several results on the interpolation of the discrete logarithm in finit...
Recently, Shparlinski proved several results on the interpolation of the discrete logarithm in finit...
AbstractIn the first part of the paper, certain incomplete character sums over a finite field Fpr ar...
The discrete logarithm over finite fields of small characteristic can be solved much more efficientl...
Recently, several striking advances have taken place regarding the discrete logarithm problem (DLP) ...
In this paper, we revisit the ZigZag strategy of Granger, Kleinjung and Zumbrägel. In particular, we...
We propose various strategies for improving the computation of discrete logarithms in non-prime fiel...