ANALYSIS OF COMPLEMENTS IN MULTI-EXPONENTIATION ALGORITHMS USING SIGNED DIGIT REPRESENTATIONS

DOI10.1142/S012905410900667XzbMath1207.68454arXiv0804.0733OpenAlexW3100126214MaRDI QIDQ3636156

Prodinger, Helmut, Clemens Heuberger

Publication date: 30 June 2009

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0804.0733

zbMATH Keywords

complementmulti-exponentiationcanonical signed digit representationnon-adjacent-formsigned digit representation

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Cryptography (94A60) Radix representation; digital problems (11A63)

Cites Work

• Unnamed Item
• Distribution results for low-weight binary representations for pairs of integers
• The Hamming weight of the non-adjacent-form under various input statistics
• Analysis of alternative digit sets for nonadjacent representations
• The complexity of certain multi-exponentiation techniques in cryptography
• Analysis of linear combination algorithms in cryptography

This page was built for publication: ANALYSIS OF COMPLEMENTS IN MULTI-EXPONENTIATION ALGORITHMS USING SIGNED DIGIT REPRESENTATIONS