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

Boris S. Verkhovsky

.

DOI: 10.4236/ijcns.2011.42009                

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.

Keywords

Complex Modulus, Cryptanalytic Protection, Decomposition, Gaussian Modular Arithmetic, Information Hiding, Key Exchange, Modular Elliptic Curve, Secure Communication

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