A note on asynchronous multi-exponentiation algorithm using binary representation
From MaRDI portal
Publication:456161
DOI10.1016/J.IPL.2012.08.006zbMATH Open1250.94044OpenAlexW2081679850MaRDI QIDQ456161FDOQ456161
Jin-Peng Huai, Da-Zhi Sun, Jian-Xin Li
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
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
- Parallel computation of the multi-exponentiation for cryptosystems
Cites Work
- Security arguments for digital signatures and blind signatures
- A public key cryptosystem and a signature scheme based on discrete logarithms
- Efficient signature generation by smart cards
- A Survey of Fast Exponentiation Methods
- The complexity of certain multi-exponentiation techniques in cryptography
- Fast Multicomputation with Asynchronous Strategy
Cited In (2)
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)