Name
Abstract | ||
|---|---|---|
Cryptographic voting protocols often rely on methods that require a large number of modular exponentiations. Corresponding performance bottlenecks may appear both on the server and the client side. Applying existing optimization techniques is often mentioned and recommended in the literature, but their potential has never been analyzed in depth. In this paper, we investigate existing algorithms for computing fixed-base exponentiations and product exponentiations. Both of them appear frequently in voting protocols. We also explore the potential of applying small-exponent techniques. It turns out that using these techniques in combination, the overall computation time can be reduced by two or more orders of magnitude. |
Year | DOI | Venue |
|---|---|---|
2019 | 10.1007/978-3-030-43725-1_19 | Financial Cryptography Workshops |
DocType | Citations | PageRank |
Conference | 0 | 0.34 |
References | Authors | |
4 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Rolf Haenni | 1 | 371 | 33.39 |
| Philipp Locher | 2 | 16 | 4.12 |
| Nicolas Gailly | 3 | 142 | 8.64 |