Paper 2005/053 Original: eprint.iacr.org/2005/053 ↗
An Approach Towards Rebalanced RSA-CRT with Short Public Exponent
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.
Metadata
- Available format(s)
PDF- Category
- Public-key cryptography
- Publication info
- Preprint.
- History
- 2005-02-25: last updated
- 2005-02-25: published
- Short URL
- https://ia.cr/2005/053
- License
- https://creativecommons.org/licenses/by/4.0/
BibTeX
@misc{cryptoeprint:2005/053,
author = {Hung-Min Sun and Mu-En Wu},
title = {An Approach Towards Rebalanced RSA-CRT with Short Public Exponent},
howpublished = {Cryptology {ePrint} Archive, Paper 2005/053},
year = {2005},
url = {https://eprint.iacr.org/2005/053}
}