Beruflich Dokumente
Kultur Dokumente
I.
INTRODUCTION
134
5. Create a new table having only words and their codes in the
sorted order form of words. Store this table as the Dictionary in
a file.
6. Stop.
B. Encoding Algorithm
Start encode with argument input file if
1. Read the dictionary and stores all words and their codes in a
table
2. While ipf is not empty
It is clear seen that the encoded data has exactly the same
number of characters, but is dominated by stars [13]. It seems
more compressible and does not offer any serious challenge to
the hacker.
II.
PROPOSED WORK
iv). Read the next character from input file and neglect it if it is
a space. Go back to B, after inserting a marker character
(ASCII 255) to indicate the presence of a space
End (While)
3. Stop.
C. Decoding Algorithm
Start decode with argument input file ipf
ii) Read the length of code and search for the code in
dictionary, for that particular length of code.
ii). Now for the remaining words give each one permutation of
two of the ASCII characters (in the range 33 to 250), taken in
order. If there are any remaining words give them each one
permutation of three of the ASCII characters (in the range 33 to
250) and finally if required permutation of four characters,
again from same range.
End (While)
2. Stop
135
4
BPC
BWT
3
*Encoding
Propos ed
That thou her Maid art far more faire then she
ge
o
ne
w
s
pa
pe
r1
pa
pe
r2
pa
pe
r3
pa
pe
r4
pa
pe
r5
pa
pe
r6
pr
og
c
pr
og
1
tra
ns
bi
b
bo
ok
1
bo
ok
2
File Name
! # $ % & (
Fig. 1.
) * + , - . * + /
0 1 2 . 3 + 4 5
20
18
6 * 7 8 - 9 : ;
16
Conversion Time
< = > ? @ A B C D E
You can clearly see that the encoded data is completely
represented in ASCII character form. It is also clear from the
above algorithm that the encoded text provides a better
compression and a stiff challenge to the hacker! It may look as
if the encoded text can be attacked using a conventional
frequency analysis of the words in the encoded text, but a
detailed inspection of the dictionary making algorithm reveal
that it is not so. An attacker can decode the encoded text only if
he knows the dictionary. The dictionary on the other hand is a
dynamically created one. It depends on the nature of the text
being encoded. The nature of the text differs for different
sessions of communication between a server and client. In
addition to this fact we suggest a stronger encryption strategy
for the dictionary transfer. A proper dictionary management
and transfer protocol can be adopted for a more secure data
transfer.
III.
14
12
BWT
10
*Encoding
Proposed
8
6
4
2
ge
o
ne
w
s
pa
pe
r
pa 1
pe
r2
pa
pe
r
pa 3
pe
r
pa 4
pe
r
pa 5
pe
r6
pr
og
c
pr
og
1
tra
ns
bo
ok
1
bo
ok
2
bi
b
File Name
Fig. 2.
TABLE I.
File
Name
PERFORMANCE ANALYSIS
Bib
Book1
Book2
Geo
News
Paper1
Paper2
Paper3
Paper4
Paper5
Paper6
Progc
Prog1
Trans
File
Size
(Kb)
108.7
750.8
596.5
100.0
368.3
51.9
80.3
45.4
13.0
11.7
37.2
38.7
70.0
BPC
Time
Time
BPC
2.11
2.85
2.43
4.84
2.83
2.65
2.61
2.91
3.32
3.41
2.73
2.67
1.88
1
11
9
2
6
1
2
2
2
1
1
2
1
1.93
2.74
2.33
4.84
2.65
1.59
2.45
2.60
2.79
3.00
2.54
2.54
1.78
6
18
14
6
10
5
5
6
5
4
5
5
5
1.69
2.36
2.02
5.18
2.37
2.26
2.14
2.27
2.52
2.8
2.38
2.44
1.70
4
11
10
5
7
3
4
3
3
2
3
3
3
91.5
1.63
1.53
1.46
BWT
IV.
*Encoding
BPC
Proposed
method
Time
CONCLUSION
136
[6]
[7]
[8]
[9]
FUTURE ASPECTS
[10]
[11]
[12]
REFERENCES
[1]
[2]
[3]
[4]
[5]
[13]
[14]
137