A pseudo-random bit generator based on elliptic logarithms
Proceedings on Advances in cryptology---CRYPTO '86
Pseudorandomness and Cryptographic Applications
Pseudorandomness and Cryptographic Applications
Elliptic Curve Pseudorandom Sequence Generators
SAC '99 Proceedings of the 6th Annual International Workshop on Selected Areas in Cryptography
Extracting randomness from samplable distributions
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
Designs, Codes and Cryptography
The Twist-AUgmented technique for key exchange
PKC'06 Proceedings of the 9th international conference on Theory and Practice of Public-Key Cryptography
How to turn loaded dice into fair coins
IEEE Transactions on Information Theory
Handbook of Elliptic and Hyperelliptic Curve Cryptography, Second Edition
Handbook of Elliptic and Hyperelliptic Curve Cryptography, Second Edition
Extractors for Jacobians of Binary Genus-2 Hyperelliptic Curves
ACISP '08 Proceedings of the 13th Australasian conference on Information Security and Privacy
On randomness extraction in elliptic curves
AFRICACRYPT'11 Proceedings of the 4th international conference on Progress in cryptology in Africa
International Journal of Applied Cryptography
| Hi-index | 0.00 |
We propose a simple and efficient deterministic extractor for the (hyper)elliptic curve $\mathcal{C}$, defined over $\mathbb{F}_{q^2}$, where qis some power of an odd prime. Our extractor, for a given point Pon $\mathcal{C}$, outputs the first $\mathbb{F}_{q}$-coefficient of the abscissa of the point P. We show that if a point Pis chosen uniformly at random in $\mathcal{C}$, the element extracted from the point Pis indistinguishable from a uniformly random variable in $\mathbb{F}_q$.