Parallel algorithms for modular multi-exponentiation

DOI10.1016/j.amc.2016.07.036zbMath1410.65517OpenAlexW2508096153MaRDI QIDQ1732855

Renato Portugal, Fábio Borges, Pedro C. S. Lara

Publication date: 25 March 2019

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2016.07.036

zbMATH Keywords

algorithmscryptographymodular exponentiationparallelizationmodular multi-exponentiation

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10) Parallel numerical computation (65Y05) Numerical algorithms for computer arithmetic, etc. (65Y04)

Related Items (1)

SPEEDING UP MULTI- EXPONENTIATION ALGORITHM ON A MULTICORE SYSTEM

Cites Work

• Unnamed Item
• Unnamed Item
• Parallel modular exponentiation using load balancing without precomputation
• Solving some parametric quadratic Diophantine equation over \(\mathbb Z\) and \(\mathbb F_p\)
• An efficient Montgomery exponentiation algorithm by using signed-digit-recoding and folding techniques
• Parallel computation of the multi-exponentiation for cryptosystems
• Faster Multi-exponentiation through Caching: Accelerating (EC)DSA Signature Verification
• A public key cryptosystem and a signature scheme based on discrete logarithms
• New directions in cryptography
• On the Evaluation of Powers and Monomials
• A method for obtaining digital signatures and public-key cryptosystems
• Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
• Multi-exponentiation (cryptographic protocols)

This page was built for publication: Parallel algorithms for modular multi-exponentiation