Multi-sources Randomness Extraction over Finite Fields and Elliptic Curve
Cryptography and Security
2015-02-03 v1
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.
Cite
@article{arxiv.1502.00433,
title = {Multi-sources Randomness Extraction over Finite Fields and Elliptic Curve},
author = {Hortense Boudjou Tchapgnouo and Abdoul Aziz Ciss},
journal= {arXiv preprint arXiv:1502.00433},
year = {2015}
}