Computing optimal 2-3 chains for pairings

DOI10.1007/978-3-319-22174-8_13MaRDI QIDQ2946452zbMATH OpenOpenAlexFDO

Authors Alex Capuñay, Nicolas Thériault

Publication date 17 September 2015

Published in Progress in Cryptology -- LATINCRYPT 2015 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-22174-8_13

zbMATH Keywords

double-base chainsinteger representationsTate pairings

Mathematics Subject Classification ID

Applications to coding theory and cryptography of arithmetic geometry (14G50) Cryptography (94A60)

Recommendations

• Optimal 2-3 chains for scalar multiplication
• Multibase scalar multiplications in cryptographic pairings
• A Tree-Based Approach for Computing Double-Base Chains
• Double-base chains for scalar multiplications on elliptic curves
• Efficient Tate pairing computation using double-base chains

Cited in

(7)

• Double-base chains for scalar multiplications on elliptic curves
• Optimal 2-3 chains for scalar multiplication
• Analysis on Yu et al.'s dynamic algorithm for canonic DBC
• Multibase scalar multiplications in cryptographic pairings
• On the Chain Pair Simplification Problem
• A Tree-Based Approach for Computing Double-Base Chains
• Computing the all-pairs longest chains in the plane

This page was built for publication: Computing optimal 2-3 chains for pairings

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