Pages that link to "Item:Q5451064"
From MaRDI portal
The following pages link to Efficient and Secure Elliptic Curve Point Multiplication Using Double-Base Chains (Q5451064):
Displaying 24 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)
- Fast elliptic scalar multiplication using new double-base chain and point halving (Q865543) (← 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)
- Bounds and trade-offs for double-base number systems (Q1944930) (← links)
- Double-base chains for scalar multiplications on elliptic curves (Q2055666) (← links)
- Faster cofactorization with ECM using mixed representations (Q2055704) (← links)
- Fast elliptic curve point multiplication based on window non-adjacent form method (Q2335516) (← links)
- Dynamical directions in numeration (Q2372766) (← links)
- A Duality in Space Usage between Left-to-Right and Right-to-Left Exponentiation (Q2889996) (← links)
- Lower bounds on the lengths of double-base representations (Q3093429) (← links)
- Efficient scalar multiplication for elliptic curves over binary fields (Q3403217) (← links)
- A Tree-Based Approach for Computing Double-Base Chains (Q3511180) (← links)
- Double-Base Number System for Multi-scalar Multiplications (Q3627454) (← links)
- Speeding Up the Double-Base Recoding Algorithm of Scalar Multiplication∗ (Q3644988) (← links)
- О вычислении кратных точек на эллиптических кривых над конечными полями с использованием нескольких оснований систем счисления и новых в (Q4959009) (← links)
- Hardware realization of fast elliptic curve point multiplication using balanced ternary representation and pre-computation over<i>GF(p)</i> (Q5069765) (← 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)
- A Graph Theoretic Analysis of Double Base Number Systems (Q5458207) (← links)
- Optimizing Double-Base Elliptic-Curve Single-Scalar Multiplication (Q5458208) (← links)
- Efficient Window-Based Scalar Multiplication on Elliptic Curves Using Double-Base Number System (Q5458223) (← links)
- A fast and SPA secure scalar multiplication for elliptic curve cryptography (Q6550487) (← links)
