scientific article; zbMATH DE number 5951445

MaRDI QIDQ3170750zbMATH OpenFDO

Authors Yanfeng Qi, Chun-Ming Tang, Maozhi Xu

Publication date 29 September 2011

zbMATH Keywords

pairing-based cryptographyAte pairingTate pairingBrezing-Weng elliptic curvespairing friendly elliptic curves

Mathematics Subject Classification ID

Cryptography (94A60) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Elliptic curves (14H52)

Recommendations

• Optimal pairing computation over families of pairing-friendly elliptic curves
• Efficient Pairing Computation on Ordinary Elliptic Curves of Embedding Degree 1 and 2
• On efficient pairings on elliptic curves over extension fields
• Constructing Brezing-Weng Pairing-Friendly Elliptic Curves Using Elements in the Cyclotomic Field
• Heuristics on pairing-friendly elliptic curves
• A new method of choosing primitive elements for Brezing-Weng families of pairing-friendly elliptic curves
• Efficient self-pairing on ordinary elliptic curves
• Implementing optimized pairings with elliptic nets
• Efficient pairing computation on elliptic curves in Hessian form
• Pairing computation on elliptic curves with efficiently computable endomorphism and small embedding degree

Cited in

(3)

• Tower building technique on elliptic curve with embedding degree 18
• Simple and exact formula for minimum loop length in \(\mathrm{Ate}_{i }\) pairing based on Brezing-Weng curves
• An improved twisted Ate pairing over KSS curves with \(k = 18\)

This page was built for publication:

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