A note on asynchronous multi-exponentiation algorithm using binary representation

DOI10.1016/J.IPL.2012.08.006MaRDI QIDQ456161zbMATH OpenOpenAlexFDO

Authors Da-Zhi Sun, Jian-Xin Li, Jin-Peng Huai

Publication date 23 October 2012

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ipl.2012.08.006

zbMATH Keywords

Markov chaincryptographyalgorithm analysismulti-exponentiation

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Cryptography (94A60)

Recommendations

• Algorithm of asynchronous binary signed-digit recoding on fast multiexponentiation
• Analysis of multi-exponentiation algorithm using binary signed-digit representations
• ANALYSIS OF COMPLEMENTS IN MULTI-EXPONENTIATION ALGORITHMS USING SIGNED DIGIT REPRESENTATIONS
• scientific article; zbMATH DE number 5991592
• Parallel computation of the multi-exponentiation for cryptosystems

Cites work

• A Survey of Fast Exponentiation Methods
• A public key cryptosystem and a signature scheme based on discrete logarithms
• Efficient signature generation by smart cards
• Fast Multicomputation with Asynchronous Strategy
• Security arguments for digital signatures and blind signatures
• The complexity of certain multi-exponentiation techniques in cryptography

Cited in

(3)

• Analysis of multi-exponentiation algorithm using binary signed-digit representations
• Algorithm of asynchronous binary signed-digit recoding on fast multiexponentiation
• ANALYSIS OF COMPLEMENTS IN MULTI-EXPONENTIATION ALGORITHMS USING SIGNED DIGIT REPRESENTATIONS

This page was built for publication: A note on asynchronous multi-exponentiation algorithm using binary representation

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