Multi-exponentiation (cryptographic protocols)
From MaRDI portal
Recommendations
Cited in
(16)- Speeding up the computations of elliptic curves cryptoschemes
- Parallel algorithms for modular multi-exponentiation
- Fast batch modular exponentiation with common-multiplicand multiplication
- Algorithm of asynchronous binary signed-digit recoding on fast multiexponentiation
- Accelerating oblivious transfer with batch multi-exponentiation
- scientific article; zbMATH DE number 5991592 (Why is no real title available?)
- Parallel computation of the multi-exponentiation for cryptosystems
- scientific article; zbMATH DE number 1024029 (Why is no real title available?)
- scientific article; zbMATH DE number 1950629 (Why is no real title available?)
- scientific article; zbMATH DE number 2085203 (Why is no real title available?)
- Multiple point compression on elliptic curves
- SPEEDING UP MULTI- EXPONENTIATION ALGORITHM ON A MULTICORE SYSTEM
- Code Offset in the Exponent.
- Improving the Performance of Cryptographic Voting Protocols
- Fast modular multi-exponentiation using modified complex arithmetic
- Improved batch exponentiation
This page was built for publication: Multi-exponentiation (cryptographic protocols)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4323590)