Parallel computation of the multi-exponentiation for cryptosystems

DOI10.1080/00207169708804548zbMath0865.68042OpenAlexW2102808106MaRDI QIDQ3123350

Der-Chyuan Lou, Chin-Chen Chang

Publication date: 30 June 1997

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207169708804548

zbMATH Keywords

cryptosystemsmodular multi-exponentiationfast modular exponentiation

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Distributed algorithms (68W15)

Related Items

A fast parallel modular exponentiation algorithm ⋮ Fast modular multi-exponentiation using modified complex arithmetic ⋮ Parallel algorithms for modular multi-exponentiation ⋮ A method for computing Lucas sequences ⋮ Fast modular multiplication based on complement representation and canonical recoding ⋮ SPEEDING UP MULTI- EXPONENTIATION ALGORITHM ON A MULTICORE SYSTEM ⋮ Fast exponentiation by folding the signed-digit exponent in half ⋮ Binary Addition Chain on EREW PRAM

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• \(O(\log n)\) numerical algorithms on a mesh with wormhole routing
• A public key cryptosystem and a signature scheme based on discrete logarithms
• New directions in cryptography
• Computing Sequences with Addition Chains
• On the Evaluation of Powers
• A method for obtaining digital signatures and public-key cryptosystems
• Parallel implementation of the rsa public-key cryptosystem
• Multi-exponentiation (cryptographic protocols)
• PARALLEL COMPUTATION OF THE MODULAR CASCADE EXPONENTIATION
• Some properties of vectorial addition chains^†