Constructing Pairing-Friendly Elliptic Curves Using Gröbner Basis Reduction
From MaRDI portal
Publication:5448547
DOI10.1007/978-3-540-77272-9_20zbMath1154.11344OpenAlexW1525805668MaRDI QIDQ5448547
Steven D. Galbraith, Waldyr Dias jun. Benits
Publication date: 7 March 2008
Published in: Cryptography and Coding (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-77272-9_20
Symbolic computation and algebraic computation (68W30) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Elliptic curves (14H52)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The improbability that an elliptic curve has subexponential discrete log problem under the Menezes-Okamoto-Vanstone algorithm
- The Magma algebra system. I: The user language
- A taxonomy of pairing-friendly elliptic curves
- Ordinary Abelian varieties having small embedding degree
- Elliptic curves suitable for pairing based cryptography
- Handbook of Elliptic and Hyperelliptic Curve Cryptography
- Pairing-Friendly Elliptic Curves of Prime Order
- Advances in Elliptic Curve Cryptography
- Algorithmic Number Theory