An optimal multiplication algorithm for the _T pairing over F₃^6m

MaRDI QIDQ3170752zbMATH OpenFDO

Authors Yanfeng Qi, Dajiang Jia, Chun-Ming Tang, Maozhi Xu

Publication date 29 September 2011

zbMATH Keywords

Vandermonde matrixpairing-based cryptosystemsinterpolation of dual polynomialsmultiplication in finite fields

Mathematics Subject Classification ID

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

Recommendations

• An efficient residue group multiplication for the \(\eta _{T }\) pairing over \({\mathbb F}_{3^m}\)
• Explicit Formulas for Efficient Multiplication in $\mathbb{F}_{3^{6m}}$
• Reduction Optimal Trinomials for Efficient Software Implementation of the η T Pairing
• The Eta Pairing Revisited
• Faster Implementation of η T Pairing over GF(3 m ) Using Minimum Number of Logical Instructions for GF(3)-Addition

Cited in

(7)

• An efficient residue group multiplication for the \(\eta _{T }\) pairing over \({\mathbb F}_{3^m}\)
• Faster Implementation of η T Pairing over GF(3 m ) Using Minimum Number of Logical Instructions for GF(3)-Addition
• Explicit Formulas for Efficient Multiplication in $\mathbb{F}_{3^{6m}}$
• Efficient Multiplication in $\mathbb{F}_{3^{\ell m}}$ , m ≥ 1 and 5 ≤ ℓ ≤ 18
• Reduction Optimal Trinomials for Efficient Software Implementation of the η T Pairing
• Finite Field Multiplication Combining AMNS and DFT Approach for Pairing Cryptography
• An optimal algorithm for multiplication in \(\mathbb{F}_{256}/\mathbb{F}_ 4\)

This page was built for publication: An optimal multiplication algorithm for the \(\eta_T\) pairing over \(F_{3^{6m}}\)

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