Scheme for Secure Communication via Information Hiding Based on Key Exchange and Decomposition Protocols

.
DOI: 10.4236/ijcns.2011.42009   PDF   HTML     3,864 Downloads   6,979 Views   Citations

Abstract

This paper considers a decomposition framework as a mechanism for information hiding for secure communication via open network channels. Two varieties of this framework are provided: one is based on Gaussian arithmetic with complex modulus and another on an elliptic curve modular equation. The proposed algorithm is illustrated in a numerical example.

Share and Cite:

B. Verkhovsky, "Scheme for Secure Communication via Information Hiding Based on Key Exchange and Decomposition Protocols," International Journal of Communications, Network and System Sciences, Vol. 4 No. 2, 2011, pp. 77-81. doi: 10.4236/ijcns.2011.42009.

Conflicts of Interest

The authors declare no conflicts of interest.

References

[1] W. Diffie and M. Hellman, “New Directions in Cryptography,” IEEE Transactions on Information Theory, Vol. IT-22, No. 6, 1976, pp. 644-654. doi:10.1109/TIT.1976.1055638
[2] S. G. Krantz, “Modulus of a Complex Number,” Handbook of Complex Variables, Birkhauser Publishing Ltd., Boston, 1999, pp. 2-3.
[3] J. Hoffstein, J. Pipher and J. Silverman, “An Introduction to Mathematical Cryptography,” Springer, New York, 2008.
[4] B. Verkhovsky, “Enhanced Euclid Algorithm for Modular Multiplicative Inverse and Its Application in Cryptographic Protocols,” International Journal of Communications, Network and System Sciences, Vol. 3, No.12, 2010, pp. 901-906. doi:10.4236/ijcns.2010.312123

  
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.