Multi-sources Randomness Extraction over Finite Fields and Elliptic Curve

preprint2015arXivOpen access

Abstract

This work is based on the proposal of a deterministic randomness extractor of a random Diffie-Hellman element defined over two prime order multiplicative subgroups of a finite fields Fpn\mathbb{F}_{p^n}, G1G_1 and G2G_2. We show that the least significant bits of a random element in G1∗G2G_1*G_2, are indistinguishable from a uniform bit-string of the same length. One of the main application of this extractor is to replace the use of hash functions in pairing by the use of a good deterministic randomness extractor.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.