signature=4ec1b15ec2386dee3bd1a9eafafc0b3a,Faster Multi-exponentiation through Caching: Accelerating...

摘要：

More generally, what we consider is the task of computing power products $\prod_{1 \leq i \leq k} g_i^{e_i}$ ("multi-exponentiation") where base elements g2, ..., gkare fixed while g1is variable between multi-exponentiations but may repeat, and where the exponents are bounded (e.g., in a finite group). We present a new technique that entails two different ways of computing such a product. The first way applies to the first occurrence of any g1where, besides obtaining the actual result, we create a cache entry based on g1, investing very little memory or time overhead.The second way applies to any multi-exponentiation once such a cache entry exists for the g1in question and provides for a significant speed-up.

展开