CryptoDB
An Approach Towards Rebalanced RSA-CRT with Short Public Exponent
| Authors: | |
|---|---|
| Download: | |
| Abstract: | Based on the Chinese Remainder Theorem (CRT), Quisquater and Couvreur proposed an RSA variant, RSA-CRT, to speedup RSA decryption. According to RSA-CRT, Wiener suggested another RSA variant, Rebalanced RSA-CRT, to further speedup RSA-CRT decryption by shifting decryption cost to encryption cost. However, such an approach will make RSA encryption very time-consuming because the public exponent e in Rebalanced RSA-CRT will be of the same order of magnitude as ?p(N). In this paper we study the following problem: does there exist any secure variant of Rebalanced RSA-CRT, whose public exponent e is much shorter than ?p(N)? We solve this problem by designing a variant of Rebalanced RSA-CRT with d_{p} and d_{q} of 198 bits. This variant has the public exponent e=2^511+1 such that its encryption is about 3 times faster than that of the original Rebalanced RSA-CRT. |
BibTeX
@misc{eprint-2005-12390,
title={An Approach Towards Rebalanced RSA-CRT with Short Public Exponent},
booktitle={IACR Eprint archive},
keywords={public-key cryptography /},
url={http://eprint.iacr.org/2005/053},
note={ hmsun@cs.nthu.edu.tw 12836 received 22 Feb 2005},
author={Hung-Min Sun and Mu-En Wu},
year=2005
}