On the Minimal Embedding Field

DOI10.1007/978-3-540-73489-5_16zbMath1151.94518OpenAlexW1483451858MaRDI QIDQ5429245

Laura Hitt

Publication date: 29 November 2007

Published in: Pairing-Based Cryptography – Pairing 2007 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-73489-5_16

zbMATH Keywords

securityelliptic curve cryptographydiscrete logarithmembedding degreepairing-based cryptosystems

Mathematics Subject Classification ID

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

Related Items (11)

Extended Explicit Relations Between Trace, Definition Field, and Embedding Degree ⋮ Simple and exact formula for minimum loop length in \(\mathrm{Ate}_{i }\) pairing based on Brezing-Weng curves ⋮ A CM construction for curves of genus 2 with \(p\)-rank 1 ⋮ Constructing pairing-friendly hyperelliptic curves using Weil restriction ⋮ Closed formulae for the Weil pairing inversion ⋮ ON BOUNDS FOR BALANCED EMBEDDING DEGREE ⋮ A taxonomy of pairing-friendly elliptic curves ⋮ Generating Genus Two Hyperelliptic Curves over Large Characteristic Finite Fields ⋮ On the Security of Pairing-Friendly Abelian Varieties over Non-prime Fields ⋮ Using abelian varieties to improve pairing-based cryptography ⋮ Still wrong use of pairings in cryptography

This page was built for publication: On the Minimal Embedding Field