Simple and exact formula for minimum loop length in \(\mathrm{Ate}_{i }\) pairing based on Brezing-Weng curves
From MaRDI portal
Publication:1943983
DOI10.1007/s10623-011-9605-yzbMath1271.94022OpenAlexW2000624298WikidataQ57427195 ScholiaQ57427195MaRDI QIDQ1943983
Hyang-Sook Lee, Hoon Hong, Cheol-Min Park, Eun Jeong Lee
Publication date: 3 April 2013
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10623-011-9605-y
Related Items (6)
Implementing optimized pairings with elliptic nets ⋮ Maximum gap in (inverse) cyclotomic polynomial ⋮ Maximum gap in cyclotomic polynomials ⋮ Coefficients and higher order derivatives of cyclotomic polynomials: old and new (with an appendix by Pedro García-Sánchez) ⋮ Cyclotomic coefficients: gaps and jumps ⋮ Explicit formula for optimal ate pairing over cyclotomic family of elliptic curves
Uses Software
Cites Work
- Maximum gap in (inverse) cyclotomic polynomial
- Inverse cyclotomic polynomials
- A one round protocol for tripartite Diffie-Hellman
- Short signatures from the Weil pairing
- The Weil pairing, and its efficient calculation
- A taxonomy of pairing-friendly elliptic curves
- Efficient pairing computation on supersingular abelian varieties
- Ordinary Abelian varieties having small embedding degree
- Elliptic curves suitable for pairing based cryptography
- Computing Hilbert class polynomials with the Chinese remainder theorem
- Elliptic Curves and Primality Proving
- The Eta Pairing Revisited
- Identity-Based Encryption from the Weil Pairing
- Efficient and Generalized Pairing Computation on Abelian Varieties
- Optimal Pairings
- Pairing-Friendly Elliptic Curves of Prime Order
- On the Minimal Embedding Field
- Algorithmic Number Theory
- Advances in Cryptology - ASIACRYPT 2003
This page was built for publication: Simple and exact formula for minimum loop length in \(\mathrm{Ate}_{i }\) pairing based on Brezing-Weng curves
