Pages that link to "Item:Q5944106"
From MaRDI portal
The following pages link to Efficient arithmetic in finite field extensions with application in elliptic curve cryptography. (Q5944106):
Displaying 21 items.
- Complexity of computation in finite fields (Q378003) (← links)
- Optimal software-implemented Itoh-Tsujii inversion for \(\mathbb{F}_{2^{m}}\) (Q510481) (← links)
- An alternative class of irreducible polynomials for optimal extension fields (Q543428) (← links)
- Efficient software-implementation of finite fields with applications to cryptography (Q850780) (← links)
- Efficient hardware implementation of finite fields with applications to cryptography (Q850794) (← links)
- Practical fast algorithm for finite field arithmetics using group rings (Q1766193) (← links)
- Theoretical and experimental comparison of efficiency of finite field extensions (Q1914169) (← links)
- A taxonomy of pairing-friendly elliptic curves (Q2267367) (← links)
- On hardware and software implementation of arithmetic in finite fields of characteristic 7 for calculation of pairings (Q2453385) (← links)
- An Improvement of Optimal Ate Pairing on KSS Curve with Pseudo 12-Sparse Multiplication (Q2988347) (← links)
- An Analysis of Affine Coordinates for Pairing Computation (Q3059636) (← links)
- Efficient Arithmetic on Elliptic Curves over Fields of Characteristic Three (Q3455493) (← links)
- Optimal Extension Field Inversion in the Frequency Domain (Q3519551) (← links)
- On Software Parallel Implementation of Cryptographic Pairings (Q3644191) (← links)
- (Q4502489) (← links)
- (Q4782698) (← links)
- (Q4788568) (← links)
- (Q5393813) (← links)
- Toward Acceleration of RSA Using 3D Graphics Hardware (Q5448549) (← links)
- Selected Areas in Cryptography (Q5713967) (← links)
- A comparison of different finite fields for elliptic curve cryptosystems (Q5948821) (← links)
