Double-Exponentiation in Factor-4 Groups and Its Applications

In previous work we showed how to compress certain prime-order subgroups of the cyclotomic subgroups of orders 22m + 1 of the multiplicative groups of F∗ 24m by a factor of 4. We also showed that single-exponentiation can be efficiently performed using compressed representations. In this paper we show that double-exponentiation can be efficiently performed using factor-4 compressed representation of elements. In addition to giving a considerable speed up to the previously known fastest single-exponentiation algorithm for general bases, double-exponentiation can be used to adapt our compression technique to ElGamal type signature schemes.

• Type: Conference
• Year: 2009
• Where: IMA
• Authors: Koray Karabina
• Keywords: Certain Prime-order Subgroups, Cryptography, Cyclotomic Subgroups, Factor-4 Compressed Representation, IMA 2009