Paper 2009/475
Double-Exponentiation in Factor-4 Groups and its Applications
Koray Karabina
Abstract
In previous work we showed how to compress certain prime-order subgroups of certain cyclotomic subgroups 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.
Metadata
- Available format(s)
-
PDF
PS
- Category
- Public-key cryptography
- Publication info
- Published elsewhere. Unknown where it was published
- Keywords
- Finite field compressioncyclotomic subgroupsdouble-exponentiation
- Contact author(s)
- kkarabin @ uwaterloo ca
- History
- 2009-09-26: received
- Short URL
- https://ia.cr/2009/475
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2009/475,
author = {Koray Karabina},
title = {Double-Exponentiation in Factor-4 Groups and its Applications},
howpublished = {Cryptology {ePrint} Archive, Paper 2009/475},
year = {2009},
url = {https://eprint.iacr.org/2009/475}
}
