Coding Instead of Encryption

Coding instead of encryption
Dr. Yaseen Hikmat Ismaiel
Lecture
Department computer science
Collage of computer and mathematic science
Mosul University
Yasino79@yahoo.com
ABSTRACT
Due to the increased use of the internet in recent decades and the large number of
transactions and data exchanged over the network . There is an urgent need to provide
security for those data, especially those related to military, commercial, or financial
exchanges. Many cryptographic methods have recently been widely investigated and
developed because there is a demand for a stronger encryption and decryption which is
very hard to crack. Most modern encrypting methods include many substitution and
iteration processes that encountered some problems such as lack of robustness and
significant amount of time.
In this research, a proposed method based on the idea of coding was introduced to
achieve security instead of encryption. This search uses ASCII to build a coding table in a
different way to provide security and saves effort, time and cost.
Keywords : coding theory , code book , encryption.
1. Introduction :
It is well known that cryptographic systems use a key and algorithm to convert
plain text into ambiguous (cipher) text, while encoding methods include converting plain
text to another format using a particular method or special coding table. The purpose of
coding systems may not be to achieve security but to convert data to another format and
use it or take advantage of them in a particular area. Examples of coding methods include
ASCII , Unicode , URL encoding , base64 [1] [2] [3] [4].
This paragraph includes a review of the studies and research in this field, where the
researcher in 1978 McEliece [5] using the fact that a fast decoding algorithm exists for
general Goppa code, he constructed a public-key cryptosystem using algebraic coding
theory . In 2005 Grangetto M. and et al [6] introduced a randomized arithmetic coding
paradigm, which achieves encryption by inserting some randomization in the arithmetic
coding procedure , the proposed approach allows very flexible protection procedures at
the code-block level, allowing to perform total and selective encryption, as well as
conditional access. In 2010 Wong K. and et al [7] proposed a simultaneous compression
and encryption scheme in which the chaotic map model for arithmetic coding is
determined by a secret key and keeps changing. In 2010 Lu R. and et al [8] proposed an
efficient INDCCA2-secure public key encryption scheme based on coding theory, and
then measure the efficiency of the method by comparing with the syndrome decoding
problem in the random oracle model. In 2012 Gupta V. and et al [9] proposed an improved
block cipher symmetric encryption algorithm that has the same structure of encryption and
decryption by inserting the symmetric layer; The method gave high efficiency in term of speed.
In 2013 Al-Hazaimeh O. [10] presented a new approach based on parallel programming to
International Journal of Computer Science and Information Security (IJCSIS),
Vol. 16, No. 1, January 2018
1 https://sites.google.com/site/ijcsis/
ISSN 1947-5500

provide complexity in encryption and decryption process ; it offers a high level of security with
good speed .
2. Coding and Encryption System :
Coding systems originated long ago and require a mathematical background for the
purpose of building a good coding theory. Coding system rely on the use of the dictionary (table)
without the need to use a complex key or algorithm, its purpose is to convert data to another
format so that it can be used in many applications. [3] [11]
The objective is different from using coding systems; some applications are designed to
achieve confidentiality, some to data compression, or to convert data into a specific format that
can be used in specific applications. Coding system divided into two types one-part and two-part
codes, in the one part type the code groups and the vocabulary are arranged in parallel, alphabetic
sequences, so that a single book serves for encoding as well as for decoding. In the two-part type
the encoding book lists the elements of the vocabulary in alphabetic order but the code groups are
in random order, so that a decoding book, in which the code groups appear in alphabetic (or
numerical) order accompanied by their meaning, is essential. The degree of secrecy afforded by a
code of the latter type is much greater than that afforded by one of the former type, all other
things being equal. [3] [4][11]
Encryption is the process of encoding a message or information in such a way that only
authorized parties can access it and those who are not authorized cannot. Encryption is one of the
most important methods for providing data privacy(confidentiality) , authenticity (it came from
where it claims) , and data integrity(it has not been modified on the way) in the digital world ,
especially for end-to-end protection of data transmitted across networks. There are many types of
encryption systems and certain measures have been used to divide them, it is divided in terms of
the nature of its work into transposition and substitution encryption systems, or divided in terms
of how to use the key to secret and public encryption systems. [1] [2] [12] [13]
3. Proposed Method :
The proposed method involves using the concept of coding as a good alternative
to encryption methods in terms of achieving high level of security and cost savings. It is
known that the coding methods used to achieve confidentiality depend on the building of
the coding book, which serves as a key to the coding. The mechanism of these methods is
to take a word after a word of the plain text and search it in the coding book and then get
the word encoded thus configuring the encoded text. The proposed method used the
encoding process in a different way depending on ASCII encoding (ASCII printable
characters) where the coding table (Table 1) was constructed by using the following
rules:
 Two codes were assigned to the most frequently used characters (E, A, I, N, O, S,
and T) to make the resulting symbols in close frequency ratios and thus eliminate
the frequency analysis.
 Codes for commonly used pronouns are assigned (I, me, my, you, your, he, him,
she, her, it, its, we, us, our, they, them, their).
 Encoding question tools (who, what, where, when, why, how, and which).
 Encoding numbers (0-9).
 Two codes were assigned to the space also to eliminate the frequency analysis.
 Codes for commonly used suffixes and prefixes are assigned (able, fully, sion,
tion, er, ing, ed, pre, un, re).
ISSN 1947-5500

 Encoding week days (Sunday, Monday, Tuesday, Wednesday, Thursday, Friday,
and Saturday ).
 Encoding commonly used prepositions (in, on, and at).
 Encoding commonly used helping verbs (is, are, has, have, do, does).
3.1. The Proposed Method Algorithm :
The algorithm of the proposed method can be summarized by the following points:
1. Read the text to be encoded.
2. Calculate the number of words in clear text based on the existence of spaces.
3. Search for pronouns, numbers, spaces, weekdays, prepositions, and helping verbs in
the clear text and compensate them with the corresponding symbols using table 1 (note
the use of the symbols allocated to the space in a sequential manner).
4. Encode the suffixes and prefixes wherever they are in the remaining words and then
encode the characters of those remaining words, taking into account when encoding the
most frequent characters (E, A, I, N, O, S, and T) using the two codes assigned to them in
succession.
5. After finishing the encoding process, the number that represents the number of words
in the text is clearly (step 2) encoded and added to the end of the resulting coded text.
This number will be used by the recipient to verify the integrity of the received text.
The mechanism of the proposed algorithm can be illustrated in the flowchart in
figure 1.
In the receiver, the decoding algorithm can be explained to obtain clear text
through the following points:
1. Get the codes at the end of the encoded text and decode them to extract the number
that represents the number of clear text words and keep it.
2. Use table 1 to decode all words, sections and characters to get clear text.
3. Calculate the number of clear text words generated and compare them with the number
obtained in step 1 if the values are equal, indicating that the received text is correct and
the decoding process was done correctly. The flowchart algorithm can be illustrated in
figure 2.
ISSN 1947-5500

Table (1) The coding table used in the suggested method
ascii chacter plain ascii chacter plain ascii chacte
r
plain
32 A 64 @ Z 96 ` 2
33 ! A 65 A I 97 a 1
34 " B 66 B ME 98 b 0
35 # C 67 C MY 99 c SPACE
36 $ D 68 D YOU 100 d SPACE
37 % E 69 E YOUR 101 e ABLE
38 & E 70 F HE 102 f FULLY
39 ' F 71 G HIM 103 g SION
40 ( G 72 H SHE 104 h TION
41 ) H 73 I HER 105 i ER
42 * I 74 J IT 106 j ING
43 + I 75 K ITS 107 k ED
44 , J 76 L WE 108 l PRE
45 - K 77 M US 109 m UN
46 . L 78 N OUR 110 n RE
47 / M 79 O THEY 111 o SUNDAY
48 0 N 80 P THEM 112 p MONDAY
49 1 N 81 Q THEIR 113 q TUESDAY
50 2 O 82 R WHO 114 r WEDNESDAY
51 3 O 83 S WHAT 115 s THURSDAY
52 4 P 84 T WHERE 116 t FRIDAY
53 5 Q 85 U WHEN 117 u SATURDAY
54 6 R 86 V WHY 118 v IN
55 7 S 87 W HOW 119 w ON
56 8 S 88 X WHICH 120 x AT
57 9 T 89 Y 9 121 y IS
58 : T 90 Z 8 122 z ARE
59 ; U 91 [ 7 123 { HAS
60 < V 92 6 124 | HAVE
61 = W 93 ] 5 125 } DO
62 > X 94 ^ 4 126 ~ DOES
63 ? Y 95 _ 3
ISSN 1947-5500

Figure 1 proposed algorithm encoding
Figure 2 proposed algorithm decoding
ISSN 1947-5500

4. Conclusion and further work :
 The use of the coding book in a different way so that some of the words and
sections (commonly used in English language) are encoded and then encoding the
characters of words that are not in the coding book by encoding (suffixes and
prefixes) and then the rest of the word’s characters.
 Calculate the number of words in clear text based on the existence of spaces and
inserting the encoded number to the end of the coded text, It provided an
innovative method for verifying integration at the receiving party.
 Assigned two codes to the most frequently used characters (E, A, I, N, O, S, and
T) and spaces to make the resulting symbols in close frequency ratios and thus
eliminate the frequency analysis.
 The proposed method provided confidentiality and saves effort, time and cost.
 The size of the coding book that was built in the proposed method is relatively
small "and provided a high level of confidentiality for the resulting coded text.
 The length of the resulting encoded text is considered to be significantly lower
than the length of the plain text, especially when the text is relatively long, so the
proposed method provided a good compression ratio in addition to confidentiality.
 In the future, it is possible to use intelligent techniques in constructing a code
book, or to use it for the purpose of converting clear text into another form with
the same sense so that the largest number of words have symbols in a book or
coding table.
5. References :
[1] C. Margare and M. Steven, 2013, “The Mathematics of Encryption An Elementary
Introduction”, the American Mathematical Society. Mathematical World Volume 29 .
[2] PGP Corporation , 2002, “An Introduction to Cryptography”, PGP Corporation
version 8.0. .
[3] C. julius , 2002, “Codes and ciphers” , the press syndicate of the university of
Cambridge.
[4] F. WILLIAM , 1961, “CODES AND CIPHERS”, National Security Agency
REF ID:A101014 .
[5] R. McEliece , 1978, “A Public-key Cryptosystem Based On Algebraic Coding
Theory”, DSN Progress .
[6] G. Marco and et al.,2005, “Multimedia selective encryption by means of randomized
arithmetic coding”, IEEE TRANSACTIONS ON MULTIMEDIA .
[7] W. Kwok and L. Qiuzhen, 2010, “Simultaneous Arithmetic Coding and Encryption
Using Chaotic Maps”, IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS—II:
EXPRESS BRIEFS, VOL. 57, NO. 2 .
[8] L. Rongxing and et al., 2010, “An efficient and provably secure public key encryption
scheme based on coding theory”, John Wiley & Sons, Ltd. .
[9] G. Vishwa and et al., 2012, “A Hyper Modern Cryptography Algorithm to Improved
Data Security: HMCA”, International Journal of Computer Science & Communication
Networks,Vol 1(3), 258-263 .
ISSN 1947-5500

[10] A. Obaida, 2013, “A NEW APPROACH FOR COMPLEX ENCRYPTING AND
DECRYPTING DATA”, International Journal of Computer Networks &
Communications (IJCNC) Vol.5, No.2 .
[11] J.H. Ewing and et al. , 1992, “Introduction to Coding Theory”, Springer-Verlag
Berlin Heidelberg.
[12] E. dorthothy and D. robling , 1982, “cryptography and data security”, Addison-
wesley publishing company, Inc. .
[13] S. William , 2011, “CRYPTOGRAPHY AND NETWORK SECURITY” , Prentice
Hall .
ISSN 1947-5500

Coding Instead of Encryption

More Related Content

What's hot (18)

Similar to Coding Instead of Encryption (20)

Recently uploaded (20)

Coding Instead of Encryption