On Randomness Extraction in Elliptic Curves
From MaRDI portal
Abstract: This paper presents the Tate pairing computation on generalized Huff curves proposed by Wu and Feng. In fact, we extend the results of the Tate pairing computation on the standard Huff elliptic curves done previously by Joye, Tibouchi and Vergnaud. We show that the addition step of the Miller loop can be performed in and the doubling one in on the generalized Huff curve.
Recommendations
- Randomness extraction in elliptic curves and secret key derivation at the end of Diffie-Hellman protocol
- Pseudorandom Bits From Points on Elliptic Curves
- On the Naor-Reingold pseudo-random function from elliptic curves
- Pseudorandom Points on Elliptic Curves over Finite Fields
- Randomness extraction in finite fields F_{p^n}
- Elliptic curve analogues of a pseudorandom generator
- On pseudorandom properties of certain sequences of points on elliptic curve
- Pseudo-Randomness of Discrete-Log Sequences from Elliptic Curves
- Optimal Randomness Extraction from a Diffie-Hellman Element
- On the distribution of the subset sum pseudorandom number generator on elliptic curves
Cites work
- A normal form for elliptic curves
- A Pseudorandom Generator from any One-way Function
- Advances in Cryptology – CRYPTO 2004
- Extractors for binary elliptic curves
- scientific article; zbMATH DE number 1643940 (Why is no real title available?)
- scientific article; zbMATH DE number 1820017 (Why is no real title available?)
- scientific article; zbMATH DE number 1186931 (Why is no real title available?)
- Hyperelliptic cryptosystems
- New directions in cryptography
- Optimal Randomness Extraction from a Diffie-Hellman Element
- The Quadratic Extension Extractor for (Hyper)Elliptic Curves in Odd Characteristic
Cited in
(14)- Extractors for binary elliptic curves
- Pseudorandom bit sequence generator for stream cipher based on elliptic curves
- Secure simultaneous bit extraction from Koblitz curves
- Randomness extraction in elliptic curves and secret key derivation at the end of Diffie-Hellman protocol
- Protecting ECC against fault attacks: the ring extension method revisited
- An application of crypto cloud computing in social networks by cooperative game theory
- Randomness extraction in finite fields F_{p^n}
- Information and Communications Security
- Digit Set Randomization in Elliptic Curve Cryptography
- Optimal Randomness Extraction from a Diffie-Hellman Element
- The Quadratic Extension Extractor for (Hyper)Elliptic Curves in Odd Characteristic
- Extractors for Jacobian of Hyperelliptic Curves of Genus 2 in Odd Characteristic
- Two-source randomness extractors for elliptic curves for authenticated key exchange
- Two-sources randomness extractors in finite fields and in elliptic curves
This page was built for publication: On Randomness Extraction in Elliptic Curves
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3011919)