Parallel modular exponentiation using load balancing without precomputation
From MaRDI portal
Recommendations
- Parallel algorithms for modular multi-exponentiation
- Fast parallel modular exponentiation
- Efficient parallel modular exponentiation algorithm
- scientific article; zbMATH DE number 1445807
- A fast parallel modular exponentiation algorithm
- Fast Parallel Arithmetic via Modular Representation
- scientific article; zbMATH DE number 2188494
- scientific article; zbMATH DE number 4126588
- scientific article; zbMATH DE number 2169305
Cites work
- A method for obtaining digital signatures and public-key cryptosystems
- Comparison of three modular reduction functions
- Computing Powers in Parallel
- Efficient parallel modular exponentiation algorithm
- High-performance hardware of the sliding-window method for parallel computation of modular exponentiations
- scientific article; zbMATH DE number 503339 (Why is no real title available?)
- scientific article; zbMATH DE number 1052006 (Why is no real title available?)
- scientific article; zbMATH DE number 954401 (Why is no real title available?)
- More flexible exponentiation with precomputation
- New directions in cryptography
- Processor-efficient exponentiation in finite fields
Cited in
(5)
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)