Sciweavers

69
Voted
SACRYPT
2001
Springer
130views Cryptology» more  SACRYPT 2001»
15 years 1 months ago
Algorithms for Multi-exponentiation
This paper compares different approaches for computing power products 1≤i≤k gei i in finite groups. We look at the conventional simultaneous exponentiation approach and prese...
Bodo Möller