Memory-saving computation of the pairing final exponentiation on BN curves
type: Item
instance of: scholarly article
title: Memory-saving computation of the pairing final exponentiation on BN curves
zbMATH Open document ID: 1401.14138
author: Sylvain Duquesne
author: Loubna Ghammam
publication date: 2016-05-19T00:00:00Z
Mathematics Subject Classification ID: 14G50
Mathematics Subject Classification ID: 11G07
Mathematics Subject Classification ID: 94A60
zbMATH DE Number: 6582784
zbMATH Keywords: BN curves
zbMATH Keywords: Tate pairing
zbMATH Keywords: final exponentiation
zbMATH Keywords: memory resources
zbMATH Keywords: addition chain
describes a project that uses: SageMath
describes a project that uses: Barreto-Naehrig
MaRDI profile type: MaRDI publication profile
full work available at URL: gcc-2016-0006
OpenAlex ID: W2293905195
cites work: The realm of the pairings
cites work: Faster explicit formulas for computing pairings over ordinary curves
cites work: Pairing-Friendly Elliptic Curves of Prime Order
cites work: High-Speed Software Implementation of the Optimal Ate Pairing over Barreto–Naehrig Curves
cites work: Handbook of Elliptic and Hyperelliptic Curve Cryptography
cites work: Implementing Cryptographic Pairings over Barreto-Naehrig Curves
cites work: Faster hashing to \({\mathbb G}_2\)
cites work: Algorithmic Number Theory
cites work: Faster squaring in the cyclotomic subgroup of sixth degree extensions
cites work: Authentication of sequences with the SL2 hash function: application to video sequences
cites work: Q4425714
cites work: Speeding the Pollard and Elliptic Curve Methods of Factorization
cites work: Integer Variable χ–Based Ate Pairing
cites work: On vectorial addition chains
cites work: Advances in Cryptology – CRYPTO 2004
cites work: On the Final Exponentiation for Calculating Pairings on Ordinary Elliptic Curves
cites work: The history of the LLL-algorithm
cites work: Q4425716
cites work: Efficient pairings and ECC for embedded systems
DOI: 10.1515/GCC-2016-0006
published in: Groups - Complexity - Cryptology
Recommended article: Implementing Cryptographic Pairings over Barreto-Naehrig Curves
Recommended article: Improving the computation of the optimal ate pairing for a high security level
Recommended article: On the Final Exponentiation for Calculating Pairings on Ordinary Elliptic Curves
Recommended article: Faster explicit formulas for computing pairings over ordinary curves
Recommended article: Efficient pairing computation on curves
description: scientific article; zbMATH DE number 6582784