Research note: Using RSA with low exponent in a public network

Authors:
Wei-Bin Lee;Chin-Chen Chang
Affiliations:
Institute of Computer Science and Information Engineering, National Chung Cheng University, Chiayi, Taiwan 62107, ROC;Institute of Computer Science and Information Engineering, National Chung Cheng University, Chiayi, Taiwan 62107, ROC
Venue:
Computer Communications
Year:
1998

Citing 4
Cited 0

On using RSA with low exponent in a public key network

Lecture notes in computer sciences; 218 on Advances in cryptology---CRYPTO 85
The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms

The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
A method for obtaining digital signatures and public-key cryptosystems

Communications of the ACM
A conference key distribution system

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.24

Visualization

Abstract

In order to make the calculations for encryption perform faster, some suggested that the protocol using of RSA involves the use of small exponent for the public key. However, such specification causes the protocol to fail if the public exponent is e and the same message is sent to, at least, e users. It is a pity that we must choose a large public key if network is the expected environment. To overcome this weakness, we propose a method that makes the small public key enlarge dynamically. Furthermore, the encryption key can be computed by each recipient efficiently.