Research ArticleOpen AccessGoogle Scholar indexed
Scheme for Secure Communication via Information Hiding Based on Key Exchange and Decomposition Protocols
- 1
International Journal of Communications, Network and System Sciences·Volume 04 (2011)·Pages 77–81·Published 26 February 2011·DOI10.4236/ijcns.2011.42009
Copy link · social · email
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.
KeywordsComplex ModulusCryptanalytic ProtectionDecompositionGaussian Modular ArithmeticInformation HidingKey ExchangeModular Elliptic CurveSecure Communication
- 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
- S. G. Krantz, “Modulus of a Complex Number,” Handbook of Complex Variables , Birkhauser Publishing Ltd., Boston, 1999, pp. 2-3.
- J. Hoffstein, J. Pipher and J. Silverman, “An Introduction to Mathematical Cryptography,” Springer, New York, 2008.
- 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