Computing Optimal 2-3 Chains for Pairings

DOI10.1007/978-3-319-22174-8_13zbMath1370.94493OpenAlexW2175555984MaRDI QIDQ2946452

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

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

Related Items (3)

Multibase scalar multiplications in cryptographic pairings ⋮ Analysis on Yu et al.'s dynamic algorithm for canonic DBC ⋮ Double-base chains for scalar multiplications on elliptic curves

This page was built for publication: Computing Optimal 2-3 Chains for Pairings