A New Scheme of Representing a Secret Message Using Second Quotient Remainder Theorem in Text Steganography

  • Abstract
  • Keywords
  • References
  • PDF
  • Abstract

    Steganography is a method of concealing a secret message in a cover medium in such a way that the intruder is not able to detect the existence of the secret message. Due to extensive use of Internet and other communications media, the confidentiality and data integrity need a special means to protect it against unauthorized access. Several schemes were introduced by researchers to represent the value of a hidden message. The first scheme converts a secret message to ASCII code and is represented into x,y form which raises a redundancy representation for a repeating character of the secret message. The second scheme is using the octal value of secret message and converts it into a similar form. Another scheme modifies the previous scheme by adding a “+” and “-“symbols. These techniques are resulted in the limited range of the x,y values, repeating representation and a difficulty on generating a stegotext. To overcome the problems, the proposed scheme represents a secret message with a various representation and converts it into x, y, z form. A Second Quotient Remainder Theorem is used to converts the value to x, y, z forms. As a result, the range of the new representation is increased.



  • Keywords

    Text Steganography, Secret Message, Second Quotient Remainder Theorem.

  • References

      [1] S. Mahato, D. A. Khan, and D. K. Yadav, “A Modified Approach to Data Hiding in Microsoft Word Documents by Change-Tracking Technique,” Journal of King Saud University Computing and Information Science, 2017.

      [2] R. Gupta, S. Gupta, and A. Singhal, “Importance and Techniques of Information Hiding: A Review”, International Journal Computer Trends Technology, vol. 9, no. 5, pp. 260–265, 2014.

      [3] K. I. Rahmani, A. Kumar, and G. Manisha, “Study of Cryptography and Steganography System”, International Journal Engineering Computing Science, vol. 4, no. 8, pp. 13685–13687, 2015.

      [4] M. Htet and S. W. Phyo, “A Novel Text Steganographic Technique Using Specific Alphabets”, Journal of Computer Science, vol. 2, no. 1, pp. 1–11, 2016.

      [5] R. B. Krishnan, P. K. Thandra, and M. S. Baba, “An Overview of Text Steganography”, in 4th International Conference on Signal Processing, Communications and Networking (ICSCN), 2017, pp. 1–5.

      [6] W. Bhaya, A. M. Rahma, and D. Al-nasrawi, “Text Steganography Based on Font Type in MS-Word Documents”, Journal of Computer Science, vol. 9, no. 7, pp. 898–904, 2013.

      [7] Shivani, V. K. Yadav, and S. Batham, “A Novel Approach of Bulk Data Hiding using Text Steganography”, Procedia Computer Science, vol. 57, pp. 1401–1410, 2015.

      [8] M. Khairullah, “A Novel Text Steganography System in Financial Statements”, International Journal of Database Theory Applications, vol. 7, no. 5, pp. 123–132, 2014.

      [9] I. Stojanov, A. Mileva, and I. Stojanovi, “A New Property Coding in Text Steganography of Microsoft Word Documents A New Property Coding in Text Steganography of Microsoft Word Documents”, in SECURWARE 2014 : The Eighth International Conference on Emerging Security Information, Systems and Technologies, 2014, no. November.

      [10] S. Chaudhary, M. Dave, and A. Sanghi, “Review of Linguistic Text Steganographic Methods”, International Journal of Recent Innovation Trends Computer Communication., vol. 4, no. 7, pp. 377–381, 2016.

      [11] B. K. Ramakrishnan, P. K. Thandra, and A. V. S. M. Srinivasula, “Text steganography : A Novel Character-Level Embedding Algorithm Using Font Attribute,” in Security And Communcation Networks, 2017.

      [12] S. Bhattacharyya, P. Indu, S. Dutta, A. Biswas, and G. Sanyal, “Text Steganography using CALP with High Embedding Capacity,” J. Glob. Res. Comput. Sci., vol. 2, no. 4, pp. 29–36, 2011.

      [13] K. K. Mandal, A. Jana, and V. Agarwal, “A New Approach of Text Steganography Based on Mathematical Model of Number System,” in International Conference on Circuit, Power and Computing Technologies, 2014, pp. 1737–1741.

      [14] K. K. Mandal, S. Koley, and S. Dhar, “A Mathematical Model for Secret Message Passing Using Steganography,” in 2016 IEEE International Conference on Computational Intelligence and Computing Research, 2016, vol., no., pp. 1–6.

      [15] S. Koley and K. K. Mandal, “A Novel Approach of Secret Message Passing Through Text Steganography,” in International Conference on “Signal Processing, Communication, Power and Embedded System (SCOPES-2016), 2016.

      [16] S. Koley and K. K. Mandal, “Number System Oriented Text Steganography in Various Language for Short Messages,” in Computational Intelligence, Communications, and Business Analytics: International Conference, 2017, 1st ed., vol. 1, pp. 552–566.

      [17] M. A. Tariq, A. T. Abbasi, A. Khan, and B. Ahmad, “Boosting the Capacity of Web based Steganography by Utilizing Html Space Codes : A blind Steganography Approach Boosting the Capacity of Web based Steganography by Utilizing Html Space Codes : A blind Steganography Approach,” IT Ind., vol. 5, no. December, pp. 29–36, 2017.

      [18] R. Ray, J. Sanyal, D. Das, and A. Nath, “A New Challenge of Hiding any Encrypted Secret Message Inside any Text / ASCII File or in MS Word File : RJDA Algorithm,” in International Conference on Communication System and Network Technologies, 2012, pp. 889–893.

      [19] M. Y. Elmahi, T. M. Wahbi, and M. H. Sayed, “Text Steganography Using Compression and Random Number Generators,” Int. J. Comput. Appl. Technol. Res., vol. 6, no. 6, pp. 259–263, 2017.

      [20] M. J. Stephen, P. Reddy, D. Naidu, S. Sonali, and Heymaraju, “More Secured Text Transmission with Dual Phase Message Morphing Algorithm,” in Proceedings of the International Conference on Information Systems Design and Intelligent Applications, 2012, pp. 845–852.




Article ID: 22024
DOI: 10.14419/ijet.v7i4.19.22024

Copyright © 2012-2015 Science Publishing Corporation Inc. All rights reserved.