Computing the optimal ate pairing over elliptic curves with embedding degrees 54 and 48 at the 256-bit security level

DOI10.1504/IJACT.2020.107167zbMATH Open1461.94083OpenAlexW3011736806MaRDI QIDQ2019841FDOQ2019841

Authors: Narcisse Bang Mbiang, Diego De Freitas Aranha, Emmanuel Fouotsa 

Publication date: 22 April 2021

Published in: International Journal of Applied Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1504/ijact.2020.107167

Recommendations

• Improving the computation of the optimal ate pairing for a high security level
• A new family of pairing-friendly elliptic curves
• Cocks-Pinch curves of embedding degrees five to eight and optimal ate pairing computation
• Analysis of optimum pairing products at high security levels
• Optimal pairing computation over families of pairing-friendly elliptic curves

zbMATH Keywords

elliptic curvesfinal exponentiationpairing-friendly curves256 bits security levelembedding degrees 48 and 54Miller loopoptimal pairings

Mathematics Subject Classification ID

Cryptography (94A60) Elliptic curves over global fields (11G05) Curves over finite and local fields (11G20)

Cited In (13)

• Adequate elliptic curves for computing the product of \(n\) pairings
• Efficient optimal ate pairing at 128-bit security level
• Optimal pairing computation over families of pairing-friendly elliptic curves
• Analysis of optimum pairing products at high security levels
• Improving the computation of the optimal ate pairing for a high security level
• LOVE a pairing
• Implementing pairings at the 192-bit security level
• A new family of pairing-friendly elliptic curves
• Faster beta Weil pairing on BLS pairing friendly curves with odd embedding degree
• A short-list of pairing-friendly curves resistant to special TNFS at the 128-bit security level
• Faster optimal ate pairings for cyclotomic sparse families of pairing-friendly elliptic curves with embedding degrees \(k=5,7\)
• Cocks-Pinch curves of embedding degrees five to eight and optimal ate pairing computation
• Tower building technique on elliptic curve with embedding degree 18

This page was built for publication: Computing the optimal ate pairing over elliptic curves with embedding degrees 54 and 48 at the 256-bit security level

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