In this paper, we prove that for any polynomial function / of fixed degree without multiple roots, the probability that all the (f(x + l), f(x + 2),..., f(x + k)) are quadratic non-residue is ≈ 1/2k. In particular for f(x) = x3 + ax + b corresponding to the elliptic curve y2 = x3 +ax + b, it implies that the quadratic residues (f(x + 1), f(x + 2),... in a finite field are sufficiently randomly distributed. Using this result we describe an efficient implementation of El-Gamal Cryptosystem. that requires efficient computation of a mapping between plain-texts and the points on the elliptic curve. © Springer-Verlag Berlin Heidelberg 2007.
CITATION STYLE
Muralidhara, V. N., & Sen, S. (2007). A result on the distribution of quadratic residues with applications to elliptic curve cryptography. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4859 LNCS, pp. 48–57). https://doi.org/10.1007/978-3-540-77026-8_5
Mendeley helps you to discover research relevant for your work.