Memory-saving computation of the pairing final exponentiation on BN curves
From MaRDI portal
Publication:285907
DOI10.1515/GCC-2016-0006zbMATH Open1401.14138OpenAlexW2293905195MaRDI QIDQ285907FDOQ285907
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
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
Cryptography (94A60) Elliptic curves over local fields (11G07) Applications to coding theory and cryptography of arithmetic geometry (14G50)
Cites Work
- High-Speed Software Implementation of the Optimal Ate Pairing over Barreto–Naehrig Curves
- Faster explicit formulas for computing pairings over ordinary curves
- Title not available (Why is that?)
- Advances in Cryptology – CRYPTO 2004
- Pairing-Friendly Elliptic Curves of Prime Order
- Speeding the Pollard and Elliptic Curve Methods of Factorization
- Faster hashing to \({\mathbb G}_2\)
- The realm of the pairings
- On the Final Exponentiation for Calculating Pairings on Ordinary Elliptic Curves
- Authentication of sequences with the SL2 hash function: application to video sequences
- Faster squaring in the cyclotomic subgroup of sixth degree extensions
- Integer Variable χ–Based Ate Pairing
- On vectorial addition chains
- Title not available (Why is that?)
- The history of the LLL-algorithm
- Efficient pairings and ECC for embedded systems
- Handbook of Elliptic and Hyperelliptic Curve Cryptography
- Implementing Cryptographic Pairings over Barreto-Naehrig Curves
- Algorithmic Number Theory
Cited In (5)
- Choosing and generating parameters for pairing implementation on BN curves
- New versions of Miller-loop secured against side-channel attacks
- Improving the computation of the optimal ate pairing for a high security level
- Parallelizing pairings on Hessian elliptic curves
- On the Final Exponentiation for Calculating Pairings on Ordinary Elliptic Curves
Uses Software
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)
