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 , and . We show that the least significant bits of a random element in , 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.
Connections
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 review
No reviews yet.
Discussion 0
Add a comment
No comments yet.