Extended explicit relations between trace, definition field, and embedding degree
From MaRDI portal
Publication:2947157
Recommendations
Cites work
- scientific article; zbMATH DE number 1643939 (Why is no real title available?)
- scientific article; zbMATH DE number 1689862 (Why is no real title available?)
- scientific article; zbMATH DE number 1113850 (Why is no real title available?)
- scientific article; zbMATH DE number 2081084 (Why is no real title available?)
- scientific article; zbMATH DE number 233957 (Why is no real title available?)
- A Remark Concerning m-Divisibility and the Discrete Logarithm in the Divisor Class Group of Curves
- Algorithmic Number Theory
- Efficient selective identity-based encryption without random oracles
- Elliptic curves suitable for pairing based cryptography
- On the Minimal Embedding Field
- Pairing-Friendly Elliptic Curves of Prime Order
- Reducing elliptic curve logarithms to logarithms in a finite field
- Selected Areas in Cryptography
- The improbability that an elliptic curve has subexponential discrete log problem under the Menezes-Okamoto-Vanstone algorithm
This page was built for publication: Extended explicit relations between trace, definition field, and embedding degree
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2947157)