Parallel modular exponentiation using load balancing without precomputation

DOI10.1016/j.jcss.2011.07.002zbMath1277.94030OpenAlexW2006883188MaRDI QIDQ414922

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

Publication date: 11 May 2012

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jcss.2011.07.002

zbMATH Keywords

cryptographymodular exponentiationload balancing

Mathematics Subject Classification ID

Cryptography (94A60) Parallel algorithms in computer science (68W10)

Related Items (4)

A fast parallel modular exponentiation algorithm ⋮ An optimization of tree topology based parallel cryptography ⋮ Parallel algorithms for modular multi-exponentiation ⋮ SPEEDING UP MULTI- EXPONENTIATION ALGORITHM ON A MULTICORE SYSTEM

Uses Software

• gmp
• MPI

Cites Work

• High-performance hardware of the sliding-window method for parallel computation of modular exponentiations
• Processor-efficient exponentiation in finite fields
• Computing Powers in Parallel
• New directions in cryptography
• A method for obtaining digital signatures and public-key cryptosystems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Parallel modular exponentiation using load balancing without precomputation