Vernam Encypted Text in End of File Hiding Steganography Technique
0 likes133 views
1) The document discusses a technique for hiding encrypted text in an image using end of file steganography and Vernam encryption. It describes converting a plaintext message to ASCII codes, encrypting it with Vernam cipher using a repeated key, and inserting the encrypted bytes in the end of pixel values in the red, green, or blue channels of an image. 2) It provides details on the end of file technique, Vernam cipher encryption, and demonstrates the process on a sample 8x8 pixel image. Encrypted ciphertext is generated from the plaintext and key and inserted into the pixel tables. 3) The study concludes that applying cryptography like Vernam cipher in steganography improves data security, as even if the
![DOI: 10.23883/IJRTER.2017.3351.6ON8H 214
Vernam Encypted Text in End of File Hiding Steganography
Technique
Wirda Fitriani1
, Robbi Rahim2
, Boni Oktaviana3
, Andysah Putera Utama Siahaan4
1,4
Faculty of Computer Science, Universitas Pembanguan Panca Budi, Medan, Indonesia
2
Department of Health Information,, Akademi Perekam Medik dan Infokes Imelda, Medan, Indonesia
3
Department of Informatics, Sekolah Tinggi Teknik Harapan, Medan, Indonesia
2,4
Student of Universiti Malysia Perlis, Kangar, Malaysia
Abstract - The concealment of information in the image can be done with some specific techniques.
One of the techniques used is End of File. In the insertion of this information, a series of characters
will be converted to ASCII code and each byte will be inserted at the end of the RGB image in
descending order. The insertion can be done in Red, Green, Blue or on all of them. The downside of
this insertion is that if the bits are extracted in sequence, this will produce the original information
that has been previously inserted. In large data usage with a limited number of pixels, the stego
image will display an oddity. To make the information more secure, an encryption technique needs
to be applied. The encryption used is Vernam. This method has very high speed. The data embedded
in the image will be more secure.
Keywords - Cryptography, Steaganograpy, End of File
I. INTRODUCTION
End of File is a steganography technique that is often used in color images. This technique has two
types of ways, by adding information or byte codes at the end of file or changing the pixel value
from the end to the beginning. However, this technique is vulnerable to attack. As long as there are
no suspicious signs on the image, the information will remain secure in place. If suspicions arise, the
extraction of information sequentially generates byte codes which can then produce the important
information.Basically, steganography only aims to hide information from the naked eye [4].
Steganography has absolutely no technique to conceal or encode the information to be
incomprehensible. The integration of cryptography and steganography is very important to maintain
the balance of information residing in the image. Steganography aims to trick someone's view of
certain information. But if the view is already fixed on that information, cryptography will take over
to maintain data security [2]. Although the information is successfully extracted, it is hoped that the
information remains unintelligible.
II. THEORIES
2.1 End of File
Steganography has many ways to hide information. Steganography takes advantage of the human
eye's weakness to process color images [6][7]. Usually, the human eye is not very sensitive to see the
color differences in a color image. So the message is invisible or audible [3]. The End of File
technique is one of the techniques always used in steganography to store information on color
images. Usually, this technique is applied by adding information on end of file or pixel end. The
amount of information inserted depends on the size of the image file. The information that can be
inserted actually has an unlimited size. However, the image will be easily recognized by someone
that there is information in it.](https://image.slidesharecdn.com/vernam-encypted-text-in-end-of-file-hiding-steganography-technique-170721124024/85/Vernam-Encypted-Text-in-End-of-File-Hiding-Steganography-Technique-1-320.jpg)
![International Journal of Recent Trends in Engineering & Research (IJRTER)
Volume 03, Issue 07; July - 2017 [ISSN: 2455-1457]
@IJRTER-2017, All Rights Reserved 215
In the End of File technique, there are several methods that can be applied to this model:
- Substitution. Initial data will be replaced with confidential information. This technique does not
change the original file size because it only redeems two pieces of data. The downside is the
image quality will decrease. The bigger the information, the more visible the image quality
difference.
- Transform Domains. In this method, the information will be inserted in the transform space and
will be very good if the use of this model is done on the color image
- Spread Spectrum. This is a transmitting technique Information by using pseudo-noise code.
2.2 Vernam Cipher
Cryptography is a method that must be used to secure data. By doing this, important information will
be kept confidential [5]. Information can not be avoided from the crime of data theft but information
can be secured by messing up its contents so it is difficult to find the contents of the original message
[1][8].Vernam cipher is an encryption method that is done by transforming each bit separately with
the other bits. This algorithm uses XOR operation. Every bit in the plaintext will be XOR process
with another bit on key. Results from encryption. In the stream cipher, the decryption process is done
by re-doing the XOR process between the ciphertext and the key. The key length is the number of
bytes on the plaintext row. So the keys are often repeated to produce an equal number of lengths with
the number of characters in the plaintext.
Figure 1.XOR process
Figure 1 illustrates the XOR process of the Vernam cipher. Each bit in the plaintext will be
transformed to a secret key. To restore, the same process will be done so that it returns plaintext.
III. RESULT AND DISCUSSION
At this stage, it will be tested using a 8 x 8 pixel image. The image will be inserted information that
will be first encrypted. Table 1 to 3 show the initial RGB byte.
Table 1. Red byte order
116 48 41 186 180 217 148 212
28 19 215 194 149 170 187 174
51 138 253 68 61 234 165 128
129 228 65 118 102 244 126 216
187 167 185 152 159 216 233 209
160 233 78 163 43 21 9 240
105 104 220 122 157 229 102 161
246 65 181 244 250 253 79 136](https://image.slidesharecdn.com/vernam-encypted-text-in-end-of-file-hiding-steganography-technique-170721124024/85/Vernam-Encypted-Text-in-End-of-File-Hiding-Steganography-Technique-2-320.jpg)
![International Journal of Recent Trends in Engineering & Research (IJRTER)
Volume 03, Issue 07; July - 2017 [ISSN: 2455-1457]
@IJRTER-2017, All Rights Reserved 216
Table 2. Green byte order
55 37 203 83 95 0 183 227
159 29 149 170 239 81 85 80
230 4 80 153 19 18 64 209
185 49 208 13 126 120 54 25
100 25 61 213 231 131 159 163
187 118 170 210 194 197 197 120
102 190 243 213 148 11 35 255
238 60 120 174 76 169 190 229
Table 3. Blue byte order
96 158 85 214 122 181 179 165
242 75 241 92 55 110 154 242
143 28 75 167 245 115 216 40
45 176 252 40 235 248 59 38
94 112 242 18 158 240 7 148
48 19 85 212 61 153 9 217
218 207 34 133 172 14 220 2
86 214 225 108 155 141 174 151
Plaintext to be inserted is "UNIVERSE". This text will first be converted to byte code and then
encryption process to produce ciphertext. For more, the calculations below will explain everything.
Table 4. Plaintext
U N I V E R S E
85 78 73 86 69 82 83 69
Table 5. Bit Code of Plaintext
U 85 01010101
N 78 01001110
I 73 01001001
V 86 01010110
E 69 01000101
R 82 01010010
S 83 01010011
E 69 01000101
Table 4 is the byte value of the plaintext while table 5 is the bit value that has been extracted from
the plaintext. Every bit will be processed against the secret key. For example, the key is "KEYS".
This key only has 4 characters while the number of characters in the plaintext is 8 characters. This
resulted in the key being repeated to meet the number of plaintext characters. The key will be
"KEYSKEYS" as shown in table 6 and 7.](https://image.slidesharecdn.com/vernam-encypted-text-in-end-of-file-hiding-steganography-technique-170721124024/85/Vernam-Encypted-Text-in-End-of-File-Hiding-Steganography-Technique-3-320.jpg)
![International Journal of Recent Trends in Engineering & Research (IJRTER)
Volume 03, Issue 07; July - 2017 [ISSN: 2455-1457]
@IJRTER-2017, All Rights Reserved 217
Table 6. Key
K E Y S K E Y S
75 69 89 83 75 69 89 83
Table 7. Bit Code of Key
K 75 01001011
E 69 01000101
Y 89 01011001
S 83 01010011
K 75 01001011
E 69 01000101
Y 89 01011001
S 83 01010011
C1 = P1 K1
= 85 75
= 01010101 01001011
= 00011110
= 30
C2 = P2 K2
= 78 69
= 01001110 01000101
= 00001011
= 11
C3 = P3 K3
= 73 89
= 01001001 01011001
= 00010000
= 16
C4 = P4 K4
= 86 83
= 01010110 01010011
= 00000101
= 5
C5 = P5 K5
= 69 75
= 01000101 01001011
= 00001110
= 14
C6 = P6 K6
= 82 69
= 01010010 01000101
= 00010111](https://image.slidesharecdn.com/vernam-encypted-text-in-end-of-file-hiding-steganography-technique-170721124024/85/Vernam-Encypted-Text-in-End-of-File-Hiding-Steganography-Technique-4-320.jpg)
![International Journal of Recent Trends in Engineering & Research (IJRTER)
Volume 03, Issue 07; July - 2017 [ISSN: 2455-1457]
@IJRTER-2017, All Rights Reserved 218
= 23
C7 = P7 K7
= 83 89
= 01010011 01011001
= 00001010
= 10
C8 = P8 K8
= 69 83
= 01000101 01010011
= 00010110
= 22
The following table is the result of the XOR process performed on both characters. The next process
is substituting those values into the pixel table.
Table 8. Encryption result
Byte Biner
30 00011110
11 00001011
16 00010000
5 00000101
14 00001110
23 00010111
10 00001010
22 00010110
Insertion can be done on Red, Green or Blue. The table below describes the insertion made after the
Vernam encryption process is complete.
Table 9. Embedding in Red
116 48 41 186 180 217 148 212
28 19 215 194 149 170 187 174
51 138 253 68 61 234 165 128
129 228 65 118 102 244 126 216
187 167 185 152 159 216 233 209
160 233 78 163 43 21 9 240
105 104 220 122 157 229 102 161
22 10 23 14 5 16 11 30
Table 10. Embedding in Green
55 37 203 83 95 0 183 227
159 29 149 170 239 81 85 80
230 4 80 153 19 18 64 209](https://image.slidesharecdn.com/vernam-encypted-text-in-end-of-file-hiding-steganography-technique-170721124024/85/Vernam-Encypted-Text-in-End-of-File-Hiding-Steganography-Technique-5-320.jpg)
![International Journal of Recent Trends in Engineering & Research (IJRTER)
Volume 03, Issue 07; July - 2017 [ISSN: 2455-1457]
@IJRTER-2017, All Rights Reserved 219
185 49 208 13 126 120 54 25
100 25 61 213 231 131 159 163
187 118 170 210 194 197 197 120
102 190 243 213 148 11 35 255
22 10 23 14 5 16 11 30
Table 11. Embedding in Blue
96 158 85 214 122 181 179 165
242 75 241 92 55 110 154 242
143 28 75 167 245 115 216 40
45 176 252 40 235 248 59 38
94 112 242 18 158 240 7 148
48 19 85 212 61 153 9 217
218 207 34 133 172 14 220 2
22 10 23 14 5 16 11 30
Tables 9 to 11 are the result of the End of File steganography process in image pixels. The selection
can be done on Red, Green or Blue.
IV. CONCLUSION
The use of cryptography in steganography is very useful to improve data security. The data hidden in
the image does not necessarily have protection so that when data can be extracted from the image,
very important information will be readable. By applying the Vernam technique, it will create
encrypted and incomprehensible messages when successfully retrieved from the image.
REFERENCES
[1] R. Kumar dan R. C., “Analysis of Diffie Hellman Key Exchange Algorithm with Proposed Key Exchange
Algorithm,” International Journal of Emerging Trends & Technology in Computer Science, vol. 4, no. 1, pp. 40-43,
2015.
[2] S. I. Chowdhury, S. A. M. Shohag dan H. Sahid, “A Secured Message Transaction Approach by Dynamic Hill Cipher
Generation and Digest Concatenation,” International Journal of Computer Applications, vol. 23, no. 9, pp. 25-31,
2011.
[3] C. Cachin, Digital Steganography, Switzerland: IBM Research, 2005.
[4] P. K. Y. P. S. M. S. &. B. M. Lahane, “Data Security Using Visual Cryptography and Bit Plane Complexity
Segmentation,” International Journal of Emerging Engineering Research and Technology, vol. 2, no. 8, pp. 40-44, 20
November 2014.
[5] D. Nofriansyah dan R. Rahim, “Combination of Pixel Value Differencing Algorithm with Caesar Algorithm for
Steganography,” International Journal of Research In Science & Engineering, vol. 2, no. 6, pp. 153-159, 2016.
[6] E. Hariyanto dan R. Rahim, “Arnold’s Cat Map Algorithm in Digital Image Encryption,” International Journal of
Science and Research, vol. 5, no. 10, pp. 1363-1365, 2016.
[7] A. P. U. Siahaan, “RC4 Technique in Visual Cryptography RGB Image Encryption,” SSRG International Journal of
Computer Science and Engineering, vol. 3, no. 7, pp. 1-6, 2016.
[8] B. Oktaviana dan A. P. U. Siahaan, “Three-Pass Protocol Implementation in Caesar Cipher Classic Cryptography,”
IOSR Journal of Computer Engineering, vol. 18, no. 4, pp. 26-29, 2016.](https://image.slidesharecdn.com/vernam-encypted-text-in-end-of-file-hiding-steganography-technique-170721124024/85/Vernam-Encypted-Text-in-End-of-File-Hiding-Steganography-Technique-6-320.jpg)
Vernam Encypted Text in End of File Hiding Steganography Technique
- 1. DOI: 10.23883/IJRTER.2017.3351.6ON8H 214 Vernam Encypted Text in End of File Hiding Steganography Technique Wirda Fitriani1 , Robbi Rahim2 , Boni Oktaviana3 , Andysah Putera Utama Siahaan4 1,4 Faculty of Computer Science, Universitas Pembanguan Panca Budi, Medan, Indonesia 2 Department of Health Information,, Akademi Perekam Medik dan Infokes Imelda, Medan, Indonesia 3 Department of Informatics, Sekolah Tinggi Teknik Harapan, Medan, Indonesia 2,4 Student of Universiti Malysia Perlis, Kangar, Malaysia Abstract - The concealment of information in the image can be done with some specific techniques. One of the techniques used is End of File. In the insertion of this information, a series of characters will be converted to ASCII code and each byte will be inserted at the end of the RGB image in descending order. The insertion can be done in Red, Green, Blue or on all of them. The downside of this insertion is that if the bits are extracted in sequence, this will produce the original information that has been previously inserted. In large data usage with a limited number of pixels, the stego image will display an oddity. To make the information more secure, an encryption technique needs to be applied. The encryption used is Vernam. This method has very high speed. The data embedded in the image will be more secure. Keywords - Cryptography, Steaganograpy, End of File I. INTRODUCTION End of File is a steganography technique that is often used in color images. This technique has two types of ways, by adding information or byte codes at the end of file or changing the pixel value from the end to the beginning. However, this technique is vulnerable to attack. As long as there are no suspicious signs on the image, the information will remain secure in place. If suspicions arise, the extraction of information sequentially generates byte codes which can then produce the important information.Basically, steganography only aims to hide information from the naked eye [4]. Steganography has absolutely no technique to conceal or encode the information to be incomprehensible. The integration of cryptography and steganography is very important to maintain the balance of information residing in the image. Steganography aims to trick someone's view of certain information. But if the view is already fixed on that information, cryptography will take over to maintain data security [2]. Although the information is successfully extracted, it is hoped that the information remains unintelligible. II. THEORIES 2.1 End of File Steganography has many ways to hide information. Steganography takes advantage of the human eye's weakness to process color images [6][7]. Usually, the human eye is not very sensitive to see the color differences in a color image. So the message is invisible or audible [3]. The End of File technique is one of the techniques always used in steganography to store information on color images. Usually, this technique is applied by adding information on end of file or pixel end. The amount of information inserted depends on the size of the image file. The information that can be inserted actually has an unlimited size. However, the image will be easily recognized by someone that there is information in it.
- 2. International Journal of Recent Trends in Engineering & Research (IJRTER) Volume 03, Issue 07; July - 2017 [ISSN: 2455-1457] @IJRTER-2017, All Rights Reserved 215 In the End of File technique, there are several methods that can be applied to this model: - Substitution. Initial data will be replaced with confidential information. This technique does not change the original file size because it only redeems two pieces of data. The downside is the image quality will decrease. The bigger the information, the more visible the image quality difference. - Transform Domains. In this method, the information will be inserted in the transform space and will be very good if the use of this model is done on the color image - Spread Spectrum. This is a transmitting technique Information by using pseudo-noise code. 2.2 Vernam Cipher Cryptography is a method that must be used to secure data. By doing this, important information will be kept confidential [5]. Information can not be avoided from the crime of data theft but information can be secured by messing up its contents so it is difficult to find the contents of the original message [1][8].Vernam cipher is an encryption method that is done by transforming each bit separately with the other bits. This algorithm uses XOR operation. Every bit in the plaintext will be XOR process with another bit on key. Results from encryption. In the stream cipher, the decryption process is done by re-doing the XOR process between the ciphertext and the key. The key length is the number of bytes on the plaintext row. So the keys are often repeated to produce an equal number of lengths with the number of characters in the plaintext. Figure 1.XOR process Figure 1 illustrates the XOR process of the Vernam cipher. Each bit in the plaintext will be transformed to a secret key. To restore, the same process will be done so that it returns plaintext. III. RESULT AND DISCUSSION At this stage, it will be tested using a 8 x 8 pixel image. The image will be inserted information that will be first encrypted. Table 1 to 3 show the initial RGB byte. Table 1. Red byte order 116 48 41 186 180 217 148 212 28 19 215 194 149 170 187 174 51 138 253 68 61 234 165 128 129 228 65 118 102 244 126 216 187 167 185 152 159 216 233 209 160 233 78 163 43 21 9 240 105 104 220 122 157 229 102 161 246 65 181 244 250 253 79 136
- 3. International Journal of Recent Trends in Engineering & Research (IJRTER) Volume 03, Issue 07; July - 2017 [ISSN: 2455-1457] @IJRTER-2017, All Rights Reserved 216 Table 2. Green byte order 55 37 203 83 95 0 183 227 159 29 149 170 239 81 85 80 230 4 80 153 19 18 64 209 185 49 208 13 126 120 54 25 100 25 61 213 231 131 159 163 187 118 170 210 194 197 197 120 102 190 243 213 148 11 35 255 238 60 120 174 76 169 190 229 Table 3. Blue byte order 96 158 85 214 122 181 179 165 242 75 241 92 55 110 154 242 143 28 75 167 245 115 216 40 45 176 252 40 235 248 59 38 94 112 242 18 158 240 7 148 48 19 85 212 61 153 9 217 218 207 34 133 172 14 220 2 86 214 225 108 155 141 174 151 Plaintext to be inserted is "UNIVERSE". This text will first be converted to byte code and then encryption process to produce ciphertext. For more, the calculations below will explain everything. Table 4. Plaintext U N I V E R S E 85 78 73 86 69 82 83 69 Table 5. Bit Code of Plaintext U 85 01010101 N 78 01001110 I 73 01001001 V 86 01010110 E 69 01000101 R 82 01010010 S 83 01010011 E 69 01000101 Table 4 is the byte value of the plaintext while table 5 is the bit value that has been extracted from the plaintext. Every bit will be processed against the secret key. For example, the key is "KEYS". This key only has 4 characters while the number of characters in the plaintext is 8 characters. This resulted in the key being repeated to meet the number of plaintext characters. The key will be "KEYSKEYS" as shown in table 6 and 7.
- 4. International Journal of Recent Trends in Engineering & Research (IJRTER) Volume 03, Issue 07; July - 2017 [ISSN: 2455-1457] @IJRTER-2017, All Rights Reserved 217 Table 6. Key K E Y S K E Y S 75 69 89 83 75 69 89 83 Table 7. Bit Code of Key K 75 01001011 E 69 01000101 Y 89 01011001 S 83 01010011 K 75 01001011 E 69 01000101 Y 89 01011001 S 83 01010011 C1 = P1 K1 = 85 75 = 01010101 01001011 = 00011110 = 30 C2 = P2 K2 = 78 69 = 01001110 01000101 = 00001011 = 11 C3 = P3 K3 = 73 89 = 01001001 01011001 = 00010000 = 16 C4 = P4 K4 = 86 83 = 01010110 01010011 = 00000101 = 5 C5 = P5 K5 = 69 75 = 01000101 01001011 = 00001110 = 14 C6 = P6 K6 = 82 69 = 01010010 01000101 = 00010111
- 5. International Journal of Recent Trends in Engineering & Research (IJRTER) Volume 03, Issue 07; July - 2017 [ISSN: 2455-1457] @IJRTER-2017, All Rights Reserved 218 = 23 C7 = P7 K7 = 83 89 = 01010011 01011001 = 00001010 = 10 C8 = P8 K8 = 69 83 = 01000101 01010011 = 00010110 = 22 The following table is the result of the XOR process performed on both characters. The next process is substituting those values into the pixel table. Table 8. Encryption result Byte Biner 30 00011110 11 00001011 16 00010000 5 00000101 14 00001110 23 00010111 10 00001010 22 00010110 Insertion can be done on Red, Green or Blue. The table below describes the insertion made after the Vernam encryption process is complete. Table 9. Embedding in Red 116 48 41 186 180 217 148 212 28 19 215 194 149 170 187 174 51 138 253 68 61 234 165 128 129 228 65 118 102 244 126 216 187 167 185 152 159 216 233 209 160 233 78 163 43 21 9 240 105 104 220 122 157 229 102 161 22 10 23 14 5 16 11 30 Table 10. Embedding in Green 55 37 203 83 95 0 183 227 159 29 149 170 239 81 85 80 230 4 80 153 19 18 64 209
- 6. International Journal of Recent Trends in Engineering & Research (IJRTER) Volume 03, Issue 07; July - 2017 [ISSN: 2455-1457] @IJRTER-2017, All Rights Reserved 219 185 49 208 13 126 120 54 25 100 25 61 213 231 131 159 163 187 118 170 210 194 197 197 120 102 190 243 213 148 11 35 255 22 10 23 14 5 16 11 30 Table 11. Embedding in Blue 96 158 85 214 122 181 179 165 242 75 241 92 55 110 154 242 143 28 75 167 245 115 216 40 45 176 252 40 235 248 59 38 94 112 242 18 158 240 7 148 48 19 85 212 61 153 9 217 218 207 34 133 172 14 220 2 22 10 23 14 5 16 11 30 Tables 9 to 11 are the result of the End of File steganography process in image pixels. The selection can be done on Red, Green or Blue. IV. CONCLUSION The use of cryptography in steganography is very useful to improve data security. The data hidden in the image does not necessarily have protection so that when data can be extracted from the image, very important information will be readable. By applying the Vernam technique, it will create encrypted and incomprehensible messages when successfully retrieved from the image. REFERENCES [1] R. Kumar dan R. C., “Analysis of Diffie Hellman Key Exchange Algorithm with Proposed Key Exchange Algorithm,” International Journal of Emerging Trends & Technology in Computer Science, vol. 4, no. 1, pp. 40-43, 2015. [2] S. I. Chowdhury, S. A. M. Shohag dan H. Sahid, “A Secured Message Transaction Approach by Dynamic Hill Cipher Generation and Digest Concatenation,” International Journal of Computer Applications, vol. 23, no. 9, pp. 25-31, 2011. [3] C. Cachin, Digital Steganography, Switzerland: IBM Research, 2005. [4] P. K. Y. P. S. M. S. &. B. M. Lahane, “Data Security Using Visual Cryptography and Bit Plane Complexity Segmentation,” International Journal of Emerging Engineering Research and Technology, vol. 2, no. 8, pp. 40-44, 20 November 2014. [5] D. Nofriansyah dan R. Rahim, “Combination of Pixel Value Differencing Algorithm with Caesar Algorithm for Steganography,” International Journal of Research In Science & Engineering, vol. 2, no. 6, pp. 153-159, 2016. [6] E. Hariyanto dan R. Rahim, “Arnold’s Cat Map Algorithm in Digital Image Encryption,” International Journal of Science and Research, vol. 5, no. 10, pp. 1363-1365, 2016. [7] A. P. U. Siahaan, “RC4 Technique in Visual Cryptography RGB Image Encryption,” SSRG International Journal of Computer Science and Engineering, vol. 3, no. 7, pp. 1-6, 2016. [8] B. Oktaviana dan A. P. U. Siahaan, “Three-Pass Protocol Implementation in Caesar Cipher Classic Cryptography,” IOSR Journal of Computer Engineering, vol. 18, no. 4, pp. 26-29, 2016.