Memory-saving computation of the pairing final exponentiation on BN curves
From MaRDI portal
Publication:285907
DOI10.1515/GCC-2016-0006zbMath1401.14138OpenAlexW2293905195MaRDI QIDQ285907
Loubna Ghammam, Sylvain Duquesne
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
Cryptography (94A60) Applications to coding theory and cryptography of arithmetic geometry (14G50) Elliptic curves over local fields (11G07)
Related Items (4)
New versions of Miller-loop secured against side-channel attacks ⋮ Parallelizing pairings on Hessian elliptic curves ⋮ Choosing and generating parameters for pairing implementation on BN curves ⋮ Improving the computation of the optimal ate pairing for a high security level
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Faster Hashing to ${\mathbb G}_2$
- The Realm of the Pairings
- Faster Explicit Formulas for Computing Pairings over Ordinary Curves
- High-Speed Software Implementation of the Optimal Ate Pairing over Barreto–Naehrig Curves
- 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
- Speeding the Pollard and Elliptic Curve Methods of Factorization
- On vectorial addition chains
- The History of the LLL-Algorithm
- Efficient Pairings and ECC for Embedded Systems
- Advances in Cryptology – CRYPTO 2004
- Handbook of Elliptic and Hyperelliptic Curve Cryptography
- Pairing-Friendly Elliptic Curves of Prime Order
- Implementing Cryptographic Pairings over Barreto-Naehrig Curves
- Algorithmic Number Theory
This page was built for publication: Memory-saving computation of the pairing final exponentiation on BN curves
