Complexity and fast algorithms for multiexponentiations

DOI10.1109/12.833110MaRDI QIDQ4571350zbMATH OpenOpenAlexFDO

Authors Graham A. Jullien, W. C. Miller, Vassil S. Dimitrov

Publication date 9 July 2018

Published in IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/d2634c74c19d2df2a6484152a3b4996658035df5

Mathematics Subject Classification ID

Numerical algorithms for computer arithmetic, etc. (65Y04) Data encryption (aspects in computer science) (68P25) Cryptography (94A60)

Cited in

(8)

• An efficient common-multiplicand-multiplication method to the Montgomery algorithm for speeding up exponentiation
• Computational efficiency analysis of Wu et al.'s fast modular multi-exponentiation algorithm
• Algorithm of asynchronous binary signed-digit recoding on fast multiexponentiation
• On the Complexity of Hybrid n -Term Karatsuba Multiplier for Trinomials
• SPEEDING UP MULTI- EXPONENTIATION ALGORITHM ON A MULTICORE SYSTEM
• Half-aggregation of Schnorr signatures with tight reductions
• Multilist layering: Complexity and applications
• Fast modular multi-exponentiation using modified complex arithmetic

This page was built for publication: Complexity and fast algorithms for multiexponentiations

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