Enhanced Encryption Methods

Khalaf F. Khatatneh Mohammad Hjouj Btoush

Information Technology School Information Technology School
Al-Balqa’ Applied University Al-Balqa’ Applied University
Salt- Jordan Salt- Jordan

Qutyba A. Al-Tallaq
Information Technology School
Al-Balqa’ Applied University
Salt- Jordan

Abstract
Modern society has a significant interest in keeping in-
ormation secure. Fields such as Commerce, military, and
imple personal communication all have a need to keep
heir data unreadable by unauthorized people. This paper
xplores the concept of data encryption. The history of en-
ryption is presented from then up through the modern age.
inally, an in-depth analysis and description of the mathe-
matics that make encryption work is presented then view the
pplication created to implement the encryption methods.
In ancient times, written text had its own built in encryp-
tion, not everyone could read. Cryptology became more
widespread with the growing education levels of society, but
it still continued to be used mostly by highly secretive orga-
nizations or people.
The World Wars at the beginning half of the twentieth cen-
tury created a need for better encryption, and as a result new
methods had to be developed. Also into the current informa-
tion age, vital data is transmitted so much more frequently,
creating a need to limit access by those with malicious in-
tent.

3. Encryption Methods
. Keywords
3.1. DES
Encryption, Cryptology, CryptoSystem, Compression,
Cipher Text DES stands for”DATA ENCRYPTION STANDARD”,
in des we follow a number of steps include XOR operations
and a number of tables permutations through a number of
. Introduction stages with each stage output as input to the other. [2]
Figure 1 shows the methodology of the DES.
Cryptography is one of the oldest fields of technical
tudy we can find records of, going back at least 4,000
ears. It is quite noteworthy that of all the cryptosystems
eveloped in those 4,000 years of effort; only 3 systems in
 Figure 2 shows the using of DES Encryption/Decryption,
ur application showing a full result view.
entry on the string table, the first 256 entry are filled with
the common characters by default then the other entries are
filled with a new string from the input string when no mach
occurred. [3]
Figure 4 shows the methodology of the LZW Decompres-
sion.

Figure 2. DES

.2. LZW
Figure 4. LZW Decompression

The LZW stands for ”Lempel, Ziv, Welch” is a data

Figure 5 shows the using of LZW Compres-
ompression techniques. This algorithm do no analysis on
sion/Decompression, our application give you the ability to
he plain text, it just add every new string of characters
brows file or enter text directly then view the result.
sees to an indexing table of strings. Compression
ccurred when a single code is output instead of a string of
haracters.
he code in the table of strings length is greater than single
haracter; the first 256 codes are reserved to the standard
haracters. The remaining codes are assigned to strings the
lgorithm proceeds.
n LZW every code is 12 bit this main the strings table
ntries are 1012 = 4096 entry. [3]

Figure 3 shows the methodology of the LZW Compres-

ion.

Figure 5. LZW
 1. Create super increasing set b = [b1, b2 bk], (Part of
private key).
2. Mix private key up with permutation.
3. Choose a modulus n such that n >b1 + b2 + + bk
4. Choose some multiplier r <n relatively prime to n, (No
common divisors, All b × r mod n will be different).
5. Compute t such that ti = bi×r mod n
6. Create permutation of t and use it to create a
7. Public key: a
8. Private key: b, n, r, and the permutation
9. For Encryption: Messagei × ai
10. For Decryption:
(a) Compute:
r1 mod n.
(b) Compute s’ =
r1 × s mod n.
, s is ciphertext.
(c) Invert knapsack process to find values of b that
sum to s’
(d) Apply the permutation to get the plaintext back
Figure 6 shows the using of Knapsack Encryp-
on/Decryption, our application showing a full result view.
3.4. Rabin Public-Key Encryption
The Rabin cryptosystem is an asymmetric cryptographic
technique, whose security, like that of RSA, is related to the
difficulty of factorization. However the Rabin cryptosystem
has the advantage that the problem on which it relies has
been proved to be as hard as integer factorization, which is
not currently known to be true of the RSA problem. It has
the disadvantage that each output of the Rabin function can
be generated by any of four possible inputs; if each output
is a ciphertext; extra complexity is required on decryption
to identify which of the four possible Inputs was the true
plaintext. [6]
The process was published in January 1979 by Michael O.
Rabin. The Rabin cryptosystem was the first asymmetric
cryptosytem where recovering the entire plaintext from
the ciphertext could be proven to be as hard as factoring. [7]
Methodology of the algorithm:
1. Choose two large distinct primes p and q, preferably
the same size.
2. Compute n = p×q
3. For Encryption: the cipher text c is determined by
c=m 2 mod n.
4. For Decryption (Chinese remainder theorem):
(a) Mp= c mod p.
(b) mq= c mod q.
(c) Choosing p q 3 ( mod 4) allows to compute
square roots by:
mp= c ˆ ( p+1\4) (mod p)
mq= c ˆ ( q+1\4) (mod q)
(d) Find following:
r = ( yp .p. mq + yq .q. mp) mod n , -r = n - r
s = ( yp .p .mq - yq .q. mp) mod n , -s = n - s
One of these square roots mod n is the original
plaintext m.
 Figure 7 shows the using of Rabin Encryp- 3.6. Playfair Cipher
on/Decryption, our application showing a full result
iew. Although the Baron Playfair’s name is attached to one
of the better-known classical ciphers, the baron’s friend,
scientist Charles Wheatstone, actually devised the Playfair
cipher. After its creation in 1854, the baron succesfully
lobbied the Brittish government to adopt the cipher for
official use, and thus got his name and not Wheatstone’s,
attached to the cipher.
Nonetheless, it uses some principles common to modern
computer block ciphers. Understanding the Playfair will
give you a beginning insight into modern cryptography-
without all the complex mathematics and number theory.
[8]

Methodology of the algorithm:

1. Group plaintext letters two at a time

2. Separate repeating letters with an x cipher text letter.

Figure 7. Rabin public-keyEncryption

3. If the number of letters is odd, add a X to the end

.5. Vigen re Cipher
The Vigenre cipher is a method of encrypting alphabetic
ext by using a series of different Caesar ciphers based on
he letters of a keyword. It is a simple form of polyalpha-
etic substitution.
Methodology of the algorithm:
1. keyword is selected and it is repeatedly written above
the plaintext
2. Each column forms a keyword/plaintext letter pair
which is used in the Vigenre table to determine the
cipher text letter.
4. Take a pair of letters from plaintext
5. Plaintext letters in the same row are replaced by letters
to the right (cyclic manner)
6. Plaintext letters in the same column are replaced by
letters below (cyclic manner)
7. Plaintext letters in different row and column are re-
placed by the letter in the row corresponding to the
column of the other letter and vice versa
8. For Encryption: plaintext encrypted two letters at a
time
(a) Pair is a repeated letter; insert filler like ’X’.

Figure 8 shows the using of Vigenre Cipher for Encryp- (b) If both letters fall in the same row, replace each
on/Decryption. with letter to right (wrapping back to start from
end).
(c) If both letters fall in the same column, replace
each with the letter below it (again wrapping to
top from bottom).
(d) Otherwise each letter is replaced by the one in its
row in the column of the other letter of the pair.
 Figure 9 shows the using of Playfair Cipher for Encryp-
on/Decryption.
Figure 9. Playfair Cipher
.7. Trifid Cipher
The Trifid cipher combines substitution with transposi-
on and Fractionation, It was invented by Filex Delastelle
1901), Delastelle was a Frenchman who invented several
iphers including the bifid, trifid, and the four-square
iphers.
Keys for the Trifid cipher usually consist of a 27 letter ’key
ube.
Methodology of the algorithm:
1. For Encryption:
(a) The first step is to use the cube to convert the
letters into num.
(b) Write the numbers vertically below the message
in the order of Layer, Column, and Row.
(c) The numbers are now read off horizontally and
grouped into triplets.
(d) The cube is used again to convert the numbers
back into letters which gives us our ciphertext.
2. For Decryption:
Figure 10 shows the using of Trifid Cipher Encryp-
tion/Decryption, our application showing a full result view.
Figure 10. Trifid Cipher
3.8. Cipher Block Chaining (CBC)
CBC mode is as secure as the underlying block cipher
against standard attacks. In addition, any patterns in the
plaintext are concealed by the XORing of the previous
ciphertext block with the plaintext block. Note also that the
plaintext cannot be directly manipulated except by removal
of blocks from the beginning or the end of the ciphertext.
The initialization vector should be different for any two
messages encrypted with the same key and is preferably
randomly chosen.
The basic idea behind chaining is to use the cipher text
of the previous block to encrypt the current block.
The previous stage output is the input for the next stage.
As shown in figure 11.
 Figure 12 shows the using of Cipher Block Chaining En- 2. Decryption: See Figure 14
ryption/Decryption, our application showing a full result
iew.

Figure 14. Blum-Goldwasser Decryption

Figure 12. Cipher Block Chaining

Figure 15 shows the using of Blum - Goldwasser En-
cryption/Decryption, our application showing a full result
view.
.9. Blum - Goldwasser Probabilistic Encryption

The Blum-goldwasser probabilistic public-key encryp-

on scheme is the most efficient probabilistic encryption
nd is comparable to the RSA encryption scheme. [10]

Methodology of the algorithm:

1. Encryption: B encrypts a message m for A, which A

decrypts. See Figure13.

Figure 15. Blum - Goldwasser Probabilistic

Encryption
References

[1] Lenstra K. A. Unbelievable security matching aes

security using public key systems. 7th International
Conference on the Theory and Application of Cryptol-
ogy and Information Security: Advances in Cryptol-
ogy, 2001.

[2] P. van Oorschot A. Menezes and S. Vanstone. Hand-

book of Applied Cryptography. 1996.

[3] Shamir A. Adleman L., Rivest R. and Williamson M.

Public Key Cryptography (PKC) History. 2000.

[4] Carter B. and Magoc T. Classical Ciphers and Crypt-

analysis. September 2007.

[5] Johannes Buchmann. Einfhrung in die Kryptographie.

2nd edition.

[6] James H. Burrows. DATA ENCRYPTION STANDARD

(DES). December 1993.

[7] Savarese C. and Hart B. Cryptography. 1999.

[8] Cheok Yan Cheng. Introduction On Text Compression

Using Lempel, Ziv, Welch (LZW) method.

[9] Fred Cohen. A Short History of Cryptography. 1995.

10] Ben Goren. The Playfair Cipher.

11] Curry I. An Introduction to Cryptography and Digital

Signatures. May 2001.

12] RSA Laboratories.

13] van Oorschot Paul C. Vanstone Menezes, Alfred and

Scott A. Handbook of Applied Cryptography. October
1996.

14] R.C. Merkle and M.E. Hellman. Hiding information

and signatures in trapdoor knapsacks. IEEE Transac-
tions on Information Theory, 24(5):525–530, 1978.

15] Yasuyuki MURAKAMI and Takeshi NASAKO.

Knapsack Public-Key Cryptosystem Using Chinese
Remainder Theorem.

16] Mark Nelson. LZW Data Compression. 2005.