Memory-saving computation of the pairing final exponentiation on BN curves

DOI10.1515/GCC-2016-0006zbMATHOpenAlexMaRDI QIDQ285907FDO

Authors Sylvain Duquesne, Loubna Ghammam

Publication date 19 May 2016

Published in Groups - Complexity - Cryptology (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1515/gcc-2016-0006

zbMATH Keywords

addition chainBN curvesfinal exponentiationmemory resourcesTate pairing

Mathematics Subject Classification ID

Cryptography (94A60) Elliptic curves over local fields (11G07) Applications to coding theory and cryptography of arithmetic geometry (14G50)

Recommendations

• Implementing Cryptographic Pairings over Barreto-Naehrig Curves
• Improving the computation of the optimal ate pairing for a high security level
• On the Final Exponentiation for Calculating Pairings on Ordinary Elliptic Curves
• Faster explicit formulas for computing pairings over ordinary curves
• Efficient pairing computation on curves

Cites work

• scientific article; zbMATH DE number 1979291 (Why is no real title available?)
• scientific article; zbMATH DE number 1979293 (Why is no real title available?)
• Advances in Cryptology – CRYPTO 2004
• Algorithmic Number Theory
• Authentication of sequences with the SL2 hash function: application to video sequences
• Efficient pairings and ECC for embedded systems
• Faster explicit formulas for computing pairings over ordinary curves
• Faster hashing to \({\mathbb G}_2\)
• Faster squaring in the cyclotomic subgroup of sixth degree extensions
• Handbook of Elliptic and Hyperelliptic Curve Cryptography
• High-Speed Software Implementation of the Optimal Ate Pairing over Barreto–Naehrig Curves
• Implementing Cryptographic Pairings over Barreto-Naehrig Curves
• Integer Variable χ–Based Ate Pairing
• On the Final Exponentiation for Calculating Pairings on Ordinary Elliptic Curves
• On vectorial addition chains
• Pairing-Friendly Elliptic Curves of Prime Order
• Speeding the Pollard and Elliptic Curve Methods of Factorization
• The history of the LLL-algorithm
• The realm of the pairings

Cited in

(5)

• Parallelizing pairings on Hessian elliptic curves
• On the Final Exponentiation for Calculating Pairings on Ordinary Elliptic Curves
• Improving the computation of the optimal ate pairing for a high security level
• Choosing and generating parameters for pairing implementation on BN curves
• New versions of Miller-loop secured against side-channel attacks

Describes a project that uses

Uses Software

• SageMath
• Barreto-Naehrig

This page was built for publication: Memory-saving computation of the pairing final exponentiation on BN curves

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q285907)