Multibase scalar multiplications in cryptographic pairings

DOI10.1007/s00200-015-0279-yzbMath1348.14073OpenAlexW2284673139WikidataQ114231191 ScholiaQ114231191MaRDI QIDQ300879

Alex Capuñay Gonzales

Publication date: 29 June 2016

Published in: Applicable Algebra in Engineering, Communication and Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00200-015-0279-y

zbMATH Keywords

elliptic curvescryptographybilinear pairingsMiller's algorithm

Mathematics Subject Classification ID

Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Elliptic curves (14H52) Applications to coding theory and cryptography of arithmetic geometry (14G50)

Cites Work

• Unnamed Item
• Unnamed Item
• The Weil pairing, and its efficient calculation
• An algorithm for modular exponentiation.
• Computing Optimal 2-3 Chains for Pairings
• Five, six, and seven-term Karatsuba-like formulae
• Cryptographic Hardware and Embedded Systems - CHES 2004
• Handbook of Elliptic and Hyperelliptic Curve Cryptography
• Pairing-Friendly Elliptic Curves of Prime Order
• Efficient and Secure Elliptic Curve Point Multiplication Using Double-Base Chains
• Advances in Elliptic Curve Cryptography
• Refinements of Miller's algorithm for computing the Weil/Tate pairing
• Advances in Cryptology - ASIACRYPT 2003

This page was built for publication: Multibase scalar multiplications in cryptographic pairings