Pages that link to "Item:Q1775021"
From MaRDI portal
The following pages link to Efficient algorithms for Koblitz curves over fields of characteristic three (Q1775021):
Displaying 11 items.
- Analysis of the width-\(w\) non-adjacent form in conjunction with hyperelliptic curve cryptography and with lattices (Q387802) (← links)
- Optimality of the width-\(w\) non-adjacent form: general characterisation and the case of imaginary quadratic bases (Q394267) (← links)
- A note on window \(\tau\)-NAF algorithm (Q1041820) (← links)
- Point multiplication on ordinary elliptic curves over fields of characteristic three (Q1396701) (← links)
- Analysis of width-\(w\) non-adjacent forms to imaginary quadratic bases (Q1937312) (← links)
- Efficient arithmetic on Koblitz curves (Q1976040) (← links)
- Pre-computation scheme of window \(\tau\)NAF for Koblitz curves revisited (Q2056729) (← links)
- Symmetric digit sets for elliptic curve scalar multiplication without precomputation (Q2253194) (← links)
- Existence and optimality of \(w\)-non-adjacent forms with an algebraic integer base (Q2434175) (← links)
- Efficient Arithmetic on Elliptic Curves over Fields of Characteristic Three (Q3455493) (← links)
- GF(3m)上Hessian曲线的三进制Montgomery算法 (Q5196807) (← links)
