Extractors for binary elliptic curves

R. Rezaeian Farashahi, G.R. Pellikaan, A. Sidorenko

Research output: Contribution to journalArticleAcademicpeer-review

8 Citations (Scopus)

Abstract

We propose a simple and efficient deterministic extractor for an ordinary elliptic curve E, defined over , where n = 2l and l is a positive integer. Our extractor, for a given point P on E, outputs the first -coefficient of the abscissa of the point P. We also propose a deterministic extractor for the main subgroup G of E, where E has minimal 2-torsion. We show that if a point P is chosen uniformly at random in G, the bits extracted from the point P are indistinguishable from a uniformly random bit-string of length l.
Original languageEnglish
Pages (from-to)171-186
JournalDesigns, Codes and Cryptography
Volume49
Issue number1-3
DOIs
Publication statusPublished - 2008

Fingerprint Dive into the research topics of 'Extractors for binary elliptic curves'. Together they form a unique fingerprint.

Cite this