Complexity and fast algorithms for multiexponentiations

DOI10.1109/12.833110zbMath1391.94745OpenAlexW2096369004MaRDI QIDQ4571350

W. C. Miller, G. A. Jullien, 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

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

Related Items (6)

Computational efficiency analysis of Wu et al.'s fast modular multi-exponentiation algorithm ⋮ Fast modular multi-exponentiation using modified complex arithmetic ⋮ Half-aggregation of Schnorr signatures with tight reductions ⋮ An efficient common-multiplicand-multiplication method to the Montgomery algorithm for speeding up exponentiation ⋮ SPEEDING UP MULTI- EXPONENTIATION ALGORITHM ON A MULTICORE SYSTEM ⋮ Algorithm of asynchronous binary signed-digit recoding on fast multiexponentiation

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