Extended Explicit Relations Between Trace, Definition Field, and Embedding Degree

DOI10.1007/978-3-319-23021-4_15zbMath1465.94082OpenAlexW2296418252MaRDI QIDQ2947157

Satoru Tanaka, Atsuko Miyaji, Xiaonan Shi

Publication date: 22 September 2015

Published in: Algebraic Informatics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-23021-4_15

zbMATH Keywords

traceelliptic curveembedding degree

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Efficient selective identity-based encryption without random oracles
• The improbability that an elliptic curve has subexponential discrete log problem under the Menezes-Okamoto-Vanstone algorithm
• Elliptic curves suitable for pairing based cryptography
• A Remark Concerning m-Divisibility and the Discrete Logarithm in the Divisor Class Group of Curves
• Reducing elliptic curve logarithms to logarithms in a finite field
• Pairing-Friendly Elliptic Curves of Prime Order
• On the Minimal Embedding Field
• Selected Areas in Cryptography
• Algorithmic Number Theory

This page was built for publication: Extended Explicit Relations Between Trace, Definition Field, and Embedding Degree