A practical parallel algorithm for computing a^b mod c
From MaRDI portal
Publication:4229557
Recommendations
- A fast parallel modular exponentiation algorithm
- Efficient parallel modular exponentiation algorithm
- Parallel algorithms for modular multi-exponentiation
- scientific article; zbMATH DE number 1445807
- Fast parallel modular exponentiation
- scientific article; zbMATH DE number 4126588
- scientific article; zbMATH DE number 2118995
- Highly parallel computations modulo a number having only small prime factors
- Fast Parallel Arithmetic via Modular Representation
Cites work
Cited in
(6)- Highly parallel computations modulo a number having only small prime factors
- Modular exponentiation via the explicit Chinese remainder theorem
- Computing Powers in Parallel
- scientific article; zbMATH DE number 4128395 (Why is no real title available?)
- A Parallel and Uniform k-Partition Method for Montgomery Multiplication
- Computational Science and Its Applications – ICCSA 2004
This page was built for publication: A practical parallel algorithm for computing \(a^b \text{mod} c\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4229557)