Pages that link to "Item:Q2491297"

The following pages link to Trading inversions for multiplications in elliptic curve cryptography (Q2491297):

Displaying 12 items.

• 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)
• Double-base chains for scalar multiplications on elliptic curves (Q2055666) (← links)
• Speeding-up verification of digital signatures (Q2220442) (← links)
• Fast elliptic curve point multiplication based on window non-adjacent form method (Q2335516) (← links)
• A \(w\)-NNAF method for the efficient computation of scalar multiplication in elliptic curve cryptography (Q2570690) (← links)
• Analysis on Yu et al.'s dynamic algorithm for canonic DBC (Q2656954) (← links)
• Group Law Computations on Jacobians of Hyperelliptic Curves (Q2889865) (← links)
• Improved Precomputation Scheme for Scalar Multiplication on Elliptic Curves (Q3104704) (← links)
• О вычислении кратных точек на эллиптических кривых над конечными полями с использованием нескольких оснований систем счисления и новых в (Q4959009) (← links)