Pages that link to "Item:Q850780"
From MaRDI portal
The following pages link to Efficient software-implementation of finite fields with applications to cryptography (Q850780):
Displaying 16 items.
- 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 hardware implementation of finite fields with applications to cryptography (Q850794) (← links)
- Software-implementable pseudoprobabilistic fast block ciphers (Q1280916) (← 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)
- Efficient arithmetic in (pseudo-)Mersenne prime order fields (Q2085714) (← links)
- Binary fields on limited systems (Q2936854) (← links)
- Efficient Finite Fields in the Maxima Computer Algebra System (Q3519552) (← links)
- (Q4788568) (← links)
- (Q4797794) (← links)
- Efficient implementations of Gaussian elimination in finite fields on ASICs for MQ cryptographic systems (Q5031901) (← links)
- (Q5393813) (← links)
- Information Security and Privacy (Q5473531) (← links)
- Selected Areas in Cryptography (Q5713967) (← links)
- Efficient arithmetic in finite field extensions with application in elliptic curve cryptography. (Q5944106) (← links)
