ANALYSIS OF COMPLEMENTS IN MULTI-EXPONENTIATION ALGORITHMS USING SIGNED DIGIT REPRESENTATIONS
type: Item
instance of: scholarly article
title: ANALYSIS OF COMPLEMENTS IN MULTI-EXPONENTIATION ALGORITHMS USING SIGNED DIGIT REPRESENTATIONS
zbMATH Open document ID: 1207.68454
DOI: 10.1142/S012905410900667X
author: Clemens Heuberger
author: Helmut Prodinger
published in: International Journal of Foundations of Computer Science
publication date: 2009-06-30T00:00:00Z
full work available at URL: https://arxiv.org/abs/0804.0733
Mathematics Subject Classification ID: 68W40
Mathematics Subject Classification ID: 94A60
Mathematics Subject Classification ID: 11A63
zbMATH DE Number: 5572914
zbMATH Keywords: signed digit representation
zbMATH Keywords: multi-exponentiation
zbMATH Keywords: complement
zbMATH Keywords: non-adjacent-form
zbMATH Keywords: canonical signed digit representation
MaRDI profile type: MaRDI publication profile
cites work: The complexity of certain multi-exponentiation techniques in cryptography
cites work: Distribution results for low-weight binary representations for pairs of integers
cites work: Analysis of linear combination algorithms in cryptography
cites work: Analysis of alternative digit sets for nonadjacent representations
cites work: The Hamming weight of the non-adjacent-form under various input statistics
cites work: Q4349924
OpenAlex ID: W3100126214
Recommended article: Analysis of multi-exponentiation algorithm using binary signed-digit representations
Recommended article: A note on asynchronous multi-exponentiation algorithm using binary representation
Recommended article: Computational efficiency analysis of Wu et al.'s fast modular multi-exponentiation algorithm
Recommended article: Algorithm of asynchronous binary signed-digit recoding on fast multiexponentiation
Recommended article: Signed bits and fast exponentiation
description: scientific article; zbMATH DE number 5572914