Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: 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 $\mathbb{F}_{p^n}$, $G_1$ and $G_2$.  show that the least significant bits of a random element in $G_1*G_2$, are indistinguishable from a uniform bit-string of the same length. #R##N#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.
['Hortense Boudjou Tchapgnouo', 'Abdoul Aziz Ciss']
I am writing a research paper on a idea Multi-sources Randomness Extraction over Finite Fields and Elliptic Curve
[{"from": "human", "value": "I am writing a research paper on a idea Multi-sources Randomness Extraction over Finite Fields and Elliptic Curve"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: 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 $\\mathbb{F}_{p^n}$, $G_1$ and $G_2$.  show that the least significant bits of a random element in $G_1*G_2$, are indistinguishable from a uniform bit-string of the same length. #R##N#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."}]