Simple and exact formula for minimum loop length in \(\mathrm{Ate}_{i }\) pairing based on Brezing-Weng curves
type: Item
instance of: scholarly article
title: Simple and exact formula for minimum loop length in \(\mathrm{Ate}_{i }\) pairing based on Brezing-Weng curves
zbMATH Open document ID: 1271.94022
author: Hoon Hong
author: Hyang-Sook Lee
author: Cheol-Min Park
author: Eunjeong Lee
published in: Designs, Codes and Cryptography
publication date: 2013-04-03T00:00:00Z
review text: The authors derive a formula for the minimum loop of the \(\mathrm{Ate}_i\) pairing based on some class of Brezing-Weng curves, namely Theorem~1 in the paper. Note that the \(\mathrm{Ate}_i\) pairing is one of the several pairings that have appeared in elliptic curve cryptography. The class of curves analyzed under the conditions of Theorem~1 in the paper covers almost all the interesting Brezing-Weng curves in cryptographic terms
reviewed by: E. Martínez-Moro
Mathematics Subject Classification ID: 94A60
Mathematics Subject Classification ID: 11T71
zbMATH DE Number: 6150035
zbMATH Keywords: pairing-based cryptosystem
zbMATH Keywords: elliptic curves
zbMATH Keywords: Miller algorithm
describes a project that uses: ECPP
MaRDI profile type: Publication
full work available at URL: s10623-011-9605-y
OpenAlex ID: W2000624298
Wikidata QID: Q57427195
cites work: Elliptic Curves and Primality Proving
cites work: Efficient pairing computation on supersingular abelian varieties
cites work: Identity-Based Encryption from the Weil Pairing
cites work: Short signatures from the Weil pairing
cites work: Pairing-Friendly Elliptic Curves of Prime Order
cites work: Elliptic curves suitable for pairing based cryptography
cites work: Advances in Cryptology - ASIACRYPT 2003
cites work: Algorithmic Number Theory
cites work: A taxonomy of pairing-friendly elliptic curves
cites work: Ordinary Abelian varieties having small embedding degree
cites work: On the Minimal Embedding Field
cites work: Maximum gap in (inverse) cyclotomic polynomial
cites work: The Eta Pairing Revisited
cites work: A one round protocol for tripartite Diffie-Hellman
cites work: Efficient and Generalized Pairing Computation on Abelian Varieties
cites work: The Weil pairing, and its efficient calculation
cites work: Inverse cyclotomic polynomials
cites work: Computing Hilbert class polynomials with the Chinese remainder theorem
cites work: Optimal Pairings
DOI: 10.1007/S10623-011-9605-Y
DBLP publication ID: journals/dcc/HongLLP13
description: scientific article; zbMATH DE number 6150035