We propose a new method to speed up discrete logarithm (DL)-based cryptosystems by considering a new variant of the DL problem, where the exponents are formed as e1 + αe2 for some fixed α and two integers e1,e2 with a low weight representation. We call this class of exponents split exponents, and we show that with certain choice of parameters the DL problem on split exponents is essentially as secure as the standard DL problem, while the exponentiation operation using exponents of this class is significantly faster than best exponentiation algorithms given for standard exponents. For example, the speed of scalar multiplication on the standard Koblitz curve K163 is estimated to be accelerated by up to 51.5% and 23.5% at the cost of memory for one precomputed point, compared to the TNAF and window TNAF methods, respectively. As for security, we show that the provable security of the DL problem using split exponents is only by a small constant, e.g., 1/4, worse than the security of the standard DL problem. Split exponents can be adopted to speed up various DL-based cryptosystems. We exemplify this on the recent CCA-secure public key encryption of Bellare, Kohno, and Shoup.
Bibliographical noteFunding Information:
Manuscript received October 01, 2009; revised March 30, 2010; accepted May 11, 2010. Date of current version February 18, 2011. J. H. Cheon and T. Kwon were supported in part by the National Research Foundation of Korea (NRF) grant funded by the Korean government (KRF-2007-314-D00254). J. H. Cheon was also supported in part by the NRF grant funded by the Korean government (MEST) (No. 2010-0000218). S. Jarecki was supported in part by the NSF CAREER award #0747541. M.-K. Lee was supported in part by the NRF grant funded by the Korean government (MEST) (No. 2010-0016787).
All Science Journal Classification (ASJC) codes
- Information Systems
- Computer Science Applications
- Library and Information Sciences