We study two topics on degrees of polynomials which interpolate cryptographic functions. The one is concerned with elliptic curve discrete logarithm (ECDL) on curves with an endomorphism of degree 2 or 3. For such curves, we obtain a better lower bound of degrees for polynomial interpolation of ECDL. The other deals with degrees of polynomial interpolations of embeddings of a subgroup of the multiplicative group of a finite field to an elliptic curve. © Springer-Verlag Berlin Heidelberg 2006.
CITATION STYLE
Satoh, T. (2006). On degrees of polynomial interpolations related to elliptic curve cryptography. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3969 LNCS, pp. 155–163). Springer Verlag. https://doi.org/10.1007/11779360_13
Mendeley helps you to discover research relevant for your work.