A fast parallel modular exponentiation algorithm

DOI10.1007/s13369-017-2797-3OpenAlexW2750463165MaRDI QIDQ1640600

Khaled A. Fathy, Hazem M. Bahig, A. A. Ragab

Publication date: 14 June 2018

Published in: Arabian Journal for Science and Engineering (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s13369-017-2797-3

zbMATH Keywords

scalabilitymodular exponentiationparallel algorithmmultiplication algorithmbinary method

Mathematics Subject Classification ID

Cryptography (94A60) Parallel numerical computation (65Y05) Numerical algorithms for computer arithmetic, etc. (65Y04)

Related Items (2)

SPEEDING UP MULTI- EXPONENTIATION ALGORITHM ON A MULTICORE SYSTEM ⋮ EFFICIENT GENERATION OF SHORTEST ADDITION-MULTIPLICATION CHAINS

Cites Work

• Parallel modular exponentiation using load balancing without precomputation
• An efficient common-multiplicand-multiplication method to the Montgomery algorithm for speeding up exponentiation
• Parallel computation of the multi-exponentiation for cryptosystems
• Software Implementation of Modular Exponentiation, Using Advanced Vector Instructions Architectures
• Optimal left-to-right binary signed-digit recoding
• Exponent Recoding and Regular Exponentiation Algorithms
• A method for obtaining digital signatures and public-key cryptosystems
• A Survey of Fast Exponentiation Methods
• Fast exponentiation based on common-multiplicand-multiplication and minimal-signed-digit techniques
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A fast parallel modular exponentiation algorithm