Public-Key Cryptosystems with Secret Encryptor and Digital Signature

DOI: 10.4236/ijcns.2013.61001   PDF   HTML     3,757 Downloads   5,338 Views   Citations

Abstract

This paper describes and compares a variety of algorithms for secure transmission of information via open communication channels based on the discrete logarithm problem that do not require search for a generator (primitive element). Modifications that simplify the cryptosystem are proposed, and, as a result, accelerate its performance. It is shown that hiding information via exponentiation is more efficient than other seemingly simpler protocols. Some of these protocols also provide digital signature/sender identification. Numeric illustrations are provided.

Share and Cite:

B. Verkhovsky, "Public-Key Cryptosystems with Secret Encryptor and Digital Signature," International Journal of Communications, Network and System Sciences, Vol. 6 No. 1, 2013, pp. 1-6. doi: 10.4236/ijcns.2013.61001.

Conflicts of Interest

The authors declare no conflicts of interest.

References

[1] W. Diffie and M. E. Hellman, “New Directions in Cryptography”, IEEE Transactions on Information Theory, Vol. 22, No. 6, 1976, pp. 644-654. doi:10.1109/TIT.1976.1055638
[2] A. J. Menezes, P. C. van Oorschot and S. A. Vanstone, “Handbook of Applied Cryptography”, CRC Press, Boca Raton, 1997.
[3] T. ElGamal, “A Public Key Crypto-System and a Signature Scheme Based on Discrete Logarithms”, IEEE Transactions on Information Theory, Vol. 31, No. 4, 1985, pp. 469-472. doi:10.1109/TIT.1985.1057074
[4] R. L. Rivest, A. Shamir and L. M. Adleman, “A Method of Obtaining Digital Signature and Public-Key Cryptosystems”, Communication of ACM, Vol. 21, No. 2, 1978, pp. 120-126. doi:10.1145/359340.359342
[5] C. F. Gauss, “Disquisitiones Arithme Ticae”, 2nd Edition, Springer, New York, 1986.
[6] P. Garrett, “Making, Braking Codes: An Introduction to Cryptology”, Prentice Hall, Upper Saddle River, 2001.
[7] B. Verkhovsky, “Deterministic Algorithm Computing All Generators: Application in Cryptographic Systems Design”, International Journal of Communications, Network and System Sciences, Vol. 5, No. 11, 2012, pp. 715-719. doi:10.4236/ijcns.2012.511074
[8] J. Katz and Y. Lindell, “Introduction to Modern Cryptography”, Chapman and Hall/CRC Press, New York, 2008.
[9] B. A. Forouzan, “Cryptography and Network Security”, McGraw Hill, Boston, 2008.
[10] B. Verkhovsky, “Multiplicative Inverse Algorithm and Its Space Complexity”, Annals of European Academy of Sciences, EAS, Liege, 2004, pp. 110-124.
[11] B. Verkhovsky, “Space Complexity of Algorithm for Modular Multiplicative Inverse”, International Journal of Communications, Network and System Sciences, Vol. 4, No. 6, 2011, pp. 357-363. doi:10.4236/ijcns.2011.46041

  
comments powered by Disqus

Copyright © 2020 by authors and Scientific Research Publishing Inc.

Creative Commons License

This work and the related PDF file are licensed under a Creative Commons Attribution 4.0 International License.