Parallel modular exponentiation using load balancing without precomputation
From MaRDI portal
Publication:414922
DOI10.1016/J.JCSS.2011.07.002zbMATH Open1277.94030OpenAlexW2006883188MaRDI QIDQ414922FDOQ414922
Pedro C. Lara, Nadia Nedjah, Fábio Borges, R. Portugal
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
Recommendations
- Parallel algorithms for modular multi-exponentiation
- Fast parallel modular exponentiation
- scientific article; zbMATH DE number 1946644
- scientific article; zbMATH DE number 1445807
- A fast parallel modular exponentiation algorithm
- Fast Parallel Arithmetic via Modular Representation
- scientific article; zbMATH DE number 2188494
- Publication:4206296
- scientific article; zbMATH DE number 2169305
Cites Work
- Title not available (Why is that?)
- A method for obtaining digital signatures and public-key cryptosystems
- Title not available (Why is that?)
- New directions in cryptography
- Title not available (Why is that?)
- Title not available (Why is that?)
- High-performance hardware of the sliding-window method for parallel computation of modular exponentiations
- Processor-efficient exponentiation in finite fields
- Computing Powers in Parallel
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (5)
Uses Software
This page was built for publication: Parallel modular exponentiation using load balancing without precomputation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q414922)
