Randomness extraction in elliptic curves and secret key derivation at the end of Diffie-Hellman protocol (Q1758886): Difference between revisions

Summary: A deterministic extractor for an elliptic curve, that converts a uniformly random point on the curve to a random bit-string with a uniform distribution, is an important tool in cryptography. Such extractors can be used for example in key derivation functions, in key exchange protocols and to design cryptographically secure pseudorandom number generator. In this paper, we present a simple and efficient deterministic extractor for an elliptic curve \(E\) defined over a non prime finite field. Our extractor, for a given random point \(P\) on the curve, outputs the \(k\)-first coefficients of the abscissa of the point \(P\). This extractor confirms the two conjectures stated by \textit{R. R. Farashahi} and \textit{R. Pellikaan} [Lect. Notes Comput. Sci. 4547, 219--236 (2007; Zbl 1235.11112)] and \textit{R. R. Farashahi} et al. [Des. Codes Cryptography 49, No. 1--3, 171--186 (2008; Zbl 1182.14033)], related to the extraction of bits from coordinates of a point of an elliptic curve. As applications of our extractor, we show under the decisional Diffie-Hellman problem on an elliptic curve defined over a finite field of characteristic two, that the \(k\)-first or the \(k\)-last bits of the abscissa of a random point on the curve are indistinguishable from a random bit-string of the same length.