Optimal 2-3 chains for scalar multiplication

DOI10.1007/978-3-030-25283-0_5MaRDI QIDQ2303097zbMATH OpenOpenAlexFDO

Authors Cristobal Leiva, Nicolas Thériault

Publication date 2 March 2020

Full work available at URL https://doi.org/10.1007/978-3-030-25283-0_5

zbMATH Keywords

double-base chainsinteger representationsscalar multiplication

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Cryptography (94A60)

Recommendations

• Computing optimal 2-3 chains for pairings
• Double-base chains for scalar multiplications on elliptic curves
• On the enumeration of double-base chains with applications to elliptic curve cryptography
• Bounds and trade-offs for double-base number systems
• Triple-base number system for scalar multiplication

Cited in

(4)

• Bounds and trade-offs for double-base number systems
• Computing optimal 2-3 chains for pairings
• A Tree-Based Approach for Computing Double-Base Chains
• Triple-base number system for scalar multiplication

This page was built for publication: Optimal 2-3 chains for scalar multiplication

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2303097)