On Randomness Extraction in Elliptic Curves
From MaRDI portal
Publication:3011919
DOI10.1007/978-3-642-21969-6_18zbMath1280.94045arXiv1211.1666OpenAlexW1563140222MaRDI QIDQ3011919
Publication date: 29 June 2011
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1211.1666
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60) Elliptic curves (14H52) Applications to coding theory and cryptography of arithmetic geometry (14G50)
Related Items (5)
Pseudorandom bit sequence generator for stream cipher based on elliptic curves ⋮ An application of crypto cloud computing in social networks by cooperative game theory ⋮ Secure simultaneous bit extraction from Koblitz curves ⋮ Two-Source Randomness Extractors for Elliptic Curves for Authenticated Key Exchange ⋮ Protecting ECC against fault attacks: the ring extension method revisited
Cites Work
- Extractors for binary elliptic curves
- Hyperelliptic cryptosystems
- Optimal Randomness Extraction from a Diffie-Hellman Element
- New directions in cryptography
- A Pseudorandom Generator from any One-way Function
- Advances in Cryptology – CRYPTO 2004
- A normal form for elliptic curves
- The Quadratic Extension Extractor for (Hyper)Elliptic Curves in Odd Characteristic
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: On Randomness Extraction in Elliptic Curves