Low-cost addition-subtraction sequences for the final exponentiation in pairings
type: Item
instance of: scholarly article
title: Low-cost addition-subtraction sequences for the final exponentiation in pairings
zbMATH Open document ID: 1298.11117
author: Juan E. Guzmán-Trampe
author: Nareli Cruz-Cortés
author: Luis J. Dominguez Perez
author: Daniel Ortiz-Arroyo
author: Francisco Rodríguez-Henríquez
published in: Finite Fields and their Applications
publication date: 2014-09-02T00:00:00Z
Mathematics Subject Classification ID: 11Y16
Mathematics Subject Classification ID: 11T71
Mathematics Subject Classification ID: 94A60
zbMATH DE Number: 6338836
zbMATH Keywords: pairings
zbMATH Keywords: addition-subtraction sequences
zbMATH Keywords: final exponentiation
MaRDI profile type: Publication
full work available at URL: j.ffa.2014.02.009
OpenAlex ID: W2090585199
cites work: A taxonomy of pairing-friendly elliptic curves
cites work: Constructing Brezing-Weng Pairing-Friendly Elliptic Curves Using Elements in the Cyclotomic Field
cites work: Implementing Pairings at the 192-Bit Security Level
cites work: Faster Pairing Coprocessor Architecture
cites work: Faster Explicit Formulas for Computing Pairings over Ordinary Curves
cites work: On the Final Exponentiation for Calculating Pairings on Ordinary Elliptic Curves
cites work: Faster Hashing to ${\mathbb G}_2$
cites work: Q4349924
cites work: Calculating optimal addition chains
cites work: Advances in cryptology - CRYPTO '89. Proceedings of a conference held at the University of California, Santa Barbara, CA (USA), August 20-24, 1989
cites work: Handbook of Elliptic and Hyperelliptic Curve Cryptography
cites work: On the Evaluation of Powers
cites work: Computing Sequences with Addition Chains
cites work: Q5386130
cites work: The Weil pairing, and its efficient calculation
cites work: Point Decomposition Problem in Binary Elliptic Curves
cites work: On vectorial addition chains
cites work: Factoring polynomials with rational coefficients
cites work: Implementing Cryptographic Pairings over Barreto-Naehrig Curves
DOI: 10.1016/J.FFA.2014.02.009
Recommended article: Efficient and optimal exponentiation in finite fields
Recommended article: A Generalization of Addition Chains and Fast Inversions in Binary Fields
Recommended article: Fast exponentiation in subgroups of finite fields
Recommended article: Processor-efficient exponentiation in finite fields
Recommended article: Low complexity bit-parallel multipliers for a class of finite fields
Recommended article: Q4536234
Recommended article: On the Final Exponentiation for Calculating Pairings on Ordinary Elliptic Curves
Recommended article: Algorithms for exponentiation in finite fields
Recommended article: Redundant integer representations and fast exponentiation
description: scientific article; zbMATH DE number 6338836