Abstract
We propose a modified ElCamal cryptosystem which can broadcast communicate by encrypting every different plaintext (same plaintext is also acceptable) for plural users, and is also applicable to the systems which have hierarchical structures. And, we show that the security of this cryptosystem is based on difficulties of solving discrete logarithm problems , it maintains equivalent security with the original ElGamal cryptosystem. The transmission efficiency of this cryptosystem is improved.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
T.E.ElGamal, “A public key cryptosystem and a signature scheme based on discrete logarithm,” Proc. Crypto 84, 1985.
N.Ikeno and K.Koyama, “Modern cryptography,” The Institute of Electronics, Information and Communication Engineers, 1986.
E.Okamoto, “Introduction to cryptography,” Kyoritsu Syuppan, 1993.
Y.Zheng and T.Matsumoto, “Breaking real-world implementations of cryptosystems by manipulating their random number generation,” SCIS'97-6B, 1997.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Nakamura, D., Kobayashi, K. (1998). Modified ElGamal cryptosystem. In: Okamoto, E., Davida, G., Mambo, M. (eds) Information Security. ISW 1997. Lecture Notes in Computer Science, vol 1396. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0030412
Download citation
DOI: https://doi.org/10.1007/BFb0030412
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-64382-1
Online ISBN: 978-3-540-69767-1
eBook Packages: Springer Book Archive