The following pages link to (Q4418548):
Displayed 13 items.
- Multibase scalar multiplications in cryptographic pairings (Q300879) (← links)
- Extended elliptic curve Montgomery ladder algorithm over binary fields with resistance to simple power analysis (Q497571) (← links)
- Efficient Tate pairing computation using double-base chains (Q954437) (← links)
- Fast elliptic curve point multiplication based on binary and binary non-adjacent scalar form methods (Q1670419) (← links)
- Speeding-up verification of digital signatures (Q2220442) (← links)
- Fast elliptic curve point multiplication based on window non-adjacent form method (Q2335516) (← links)
- Further refinement of pairing computation based on Miller's algorithm (Q2381335) (← links)
- Group Law Computations on Jacobians of Hyperelliptic Curves (Q2889865) (← links)
- Twisted Edwards Curves Revisited (Q3600383) (← links)
- Jacobi Quartic Curves Revisited (Q3634512) (← links)
- The double-base number system and its application to elliptic curve cryptography (Q5444319) (← links)
- New Composite Operations and Precomputation Scheme for Elliptic Curve Cryptosystems over Prime Fields (Q5445456) (← links)
- Efficient Explicit Formulae for Genus 2 Hyperelliptic Curves over Prime Fields and Their Implementations (Q5452254) (← links)