Pages that link to "Item:Q4975064"
From MaRDI portal
The following pages link to Algorithms and Arithmetic Operators for Computing the ηT Pairing in Characteristic Three (Q4975064):
Displaying 5 items.
- Solving discrete logarithms on a 170-bit MNT curve by pairing reduction (Q1698673) (← links)
- Formulas for cube roots in \(\mathbb F_{3^m}\) using shifted polynomial basis (Q2446580) (← links)
- Cryptanalysis of Pairing-Based Cryptosystems Over Small Characteristic Fields (Q3455007) (← links)
- Faster Implementation of η T Pairing over GF(3 m ) Using Minimum Number of Logical Instructions for GF(3)-Addition (Q3600511) (← links)
- A Comparison between Hardware Accelerators for the Modified Tate Pairing over $\mathbb{F}_{2^m}$ and $\mathbb{F}_{3^m}$ (Q3600512) (← links)
