In this paper we derive lower bounds for the degree of polynomials that approximate the square root of the discrete logarithm for Elliptic Curves with orders of various specific types. These bounds can serve as evidence for the difficulty in the computation of the square root of discrete logarithms for such elliptic curves, with properly chosen parameters that result in the curve having order of any of types studied in this paper. The techniques are potentially applicable to elliptic curves of order of any specific, allowable (by Hasse's bounds), order type that is of interest for the application in hand. © 2011 Springer-Verlag.
CITATION STYLE
Meletiou, G. C., Stamatiou, Y. C., & Tsiakalos, A. (2011). Lower bounds for interpolating polynomials for square roots of the elliptic curve discrete logarithm. In Communications in Computer and Information Science (Vol. 200 CCIS, pp. 177–187). https://doi.org/10.1007/978-3-642-23141-4_17
Mendeley helps you to discover research relevant for your work.