Low-cost addition-subtraction sequences for the final exponentiation in pairings
From MaRDI portal
Publication:740296
DOI10.1016/J.FFA.2014.02.009zbMath1298.11117OpenAlexW2090585199MaRDI QIDQ740296
Juan E. Guzmán-Trampe, Daniel Ortiz-Arroyo, Luis J. Dominguez Perez, Nareli Cruz-Cortés, Francisco Rodríguez-Henríquez
Publication date: 2 September 2014
Published in: Finite Fields and their Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ffa.2014.02.009
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60) Number-theoretic algorithms; complexity (11Y16)
Cites Work
- Unnamed Item
- Unnamed Item
- Calculating optimal addition chains
- Factoring polynomials with rational coefficients
- Advances in cryptology - CRYPTO '89. Proceedings of a conference held at the University of California, Santa Barbara, CA (USA), August 20-24, 1989
- The Weil pairing, and its efficient calculation
- A taxonomy of pairing-friendly elliptic curves
- Point Decomposition Problem in Binary Elliptic Curves
- Faster Hashing to ${\mathbb G}_2$
- Faster Explicit Formulas for Computing Pairings over Ordinary Curves
- On the Final Exponentiation for Calculating Pairings on Ordinary Elliptic Curves
- Constructing Brezing-Weng Pairing-Friendly Elliptic Curves Using Elements in the Cyclotomic Field
- Computing Sequences with Addition Chains
- On vectorial addition chains
- On the Evaluation of Powers
- Faster Pairing Coprocessor Architecture
- Implementing Pairings at the 192-Bit Security Level
- Handbook of Elliptic and Hyperelliptic Curve Cryptography
- Implementing Cryptographic Pairings over Barreto-Naehrig Curves
This page was built for publication: Low-cost addition-subtraction sequences for the final exponentiation in pairings
