Share This Article:

Faster Method for Secure Transmission of Information with Sender Identification

Abstract Full-Text HTML Download Download as PDF (Size:113KB) PP. 77-81
DOI: 10.4236/ijcns.2013.62009    3,418 Downloads   4,997 Views  

ABSTRACT

This paper describes an algorithm for secure transmission of information via open communication channels based on the discrete logarithm problem. The proposed algorithm also provides sender identification (digital signature). It is twice as fast as the RSA algorithm and requires fifty per cent fewer exponentiations than the ElGamal cryptosystems. In addition, the algorithm requires twice less bandwidth than the ElGamal algorithm. Numerical examples illustrate all steps of the proposed algorithm: system design (selection of private and public keys), encryption, transmission of information, decryption and information recovery.

Conflicts of Interest

The authors declare no conflicts of interest.

Cite this paper

B. Verkhovsky, "Faster Method for Secure Transmission of Information with Sender Identification," International Journal of Communications, Network and System Sciences, Vol. 6 No. 2, 2013, pp. 77-81. doi: 10.4236/ijcns.2013.62009.

References

[1] R. L. Rivest, A. Shamir and L. M. Adleman, “Cryptographic Communications System and Method”, US Patent #4405829, 1983.
[2] C. F. Gauss, “Disquisitiones Arithmeticae”, 2nd Edition, Springer, New York, 1986.
[3] P. Garrett, “Making, Braking Codes: An Introduction to Cryptology”, Prentice Hall, Upper Saddle River, 2001.
[4] 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
[5] 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
[6] B. Verkhovsky, “Multiplicative Inverse Algorithm and Its Space Complexity”, Annals of European Academy of Sciences, 2004, pp. 110-124.
[7] 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
[8] B. Verkhovsky, “Public-Key Cryptosystems with Secret Encryptor and Digital Identification”, International Journal of Communications, Network and System Sciences, Vol. 6, No. 1, 2013, pp. 1-6.
[9] T. ElGamal, “A Public Key Cryptosystem and a Signature Scheme Based on Discrete Logarithms”, Proceedings of CRYPTO 84 on Advances in Cryptology, Springer-Verlag New York, Inc., New York, 1985, pp. 10-18.
[10] A. J. Menezes, P. C. van Oorschot and S. A. Vanstone, “Handbook of Applied Cryptography”, CRC Press, Boca Raton, 1997.
[11] G. I. Davida, “Chosen Signature Cryptanalysis of the RSA (MIT) Public Key Cryptosystem”, Technical Report TR-CS-82-2, University of Wisconsin, Milwaukee, 1982.

  
comments powered by Disqus

Copyright © 2019 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.