2019 International Conference on Computer Communication and Informatics (ICCCI -2019), Jan.

23 – 25, 2019, Coimbatore, INDIA

A Complex Polyalphabetic Cipher Technique

Myanmar Polyalphabetic Cipher
Dr. Tun Myat Aung Ni Ni Hla
Faculty of Computer Systems and Technologies Faculty of Computing and Mathematics
University of Computer Studies, Yangon (UCSY) University of Computer Studies, Yangon (UCSY)
Myanmar Myanmar
tunmyataung@ucsy.edu.mm ni2hla@ucsy.edu.mm

Abstract—The rapid development of electronic exchange of (transposes) the elements. There are two methods for
digital information increases the importance of information permutation of elements. In the first method, the element is
security in storage and transmission of data on public written into a table column by column and then transmitted row
communication network. Cryptography has emerged as a by row. In the second method, the element is written into a
solution that plays an key role in the security of information table row by row and then transmitted column by column. Rail-
against malicious attacks. There are various cipher techniques in fence cipher, Route cipher, Columnar cipher, Transposition
cryptography, such as monoalphabetic cipher, polyalphabetic using Matrix and Double transposition are popular
cipher, etc. to support data confidentiality as security transposition ciphers.
mechanisms. They are methods of enveloping plain text message
into cipher text protecting it from adversaries. The process of
encryption of alphabets is the converting original message into
non readable form. The Vigenère cipher is one of the most
common basic cipher techniques. It is a polyalphabetic cipher
technique which uses the Vigenère table for the process of
enveloping English alphabets. But Vigenère cipher is longer
vulnerable to Kasiski and Friedman attacks based on letter
frequency analysis. Thus, in this paper we propose a
polyalphabetic cipher that is a new encryption and decryption Figure 1. Secret Writing
technique with diffusion and confusion properties based on the
concept of the complex cipher used by combining of Vigenère A cipher Replacement replaces one element with another. If
cipher with Affine cipher for the increase of data security in data the elements in the plain text are alphabet characters, one
storage and transmission on public communication networks. character is replaced by another. Chips can be grouped into
Then, our proposed technique is extended by designing based on monoalphabetic chips and polyalphabetic chips. In
Myanmar alphabet characters for the increase of data security monoalphabetic replacement, an element (or a symbol ) in the
for Myanmar language. This cipher technique transforms the plain text is always altered to the same element ( or a symbol )
plain text message in Myanmar alphabet characters into the in the cipher text without taking into account its position in the
cipher text in Myanmar alphabet characters using the key in text. In monoalphabetic replacement, the mapping between an
Myanmar alphabet characters.
element in the plain text to an element in the cipher text is
Keywords- Affine cipher; monoalphabetic cipher;
always one by one. In polyalphabetic replacement, each
polyalphabetic cipher; Vigenère cipher; Myanmar alphabets occurrence of an element may have a different substitute. The
mapping between an element in the plain text to an element in
the cipher text is one-to-many. Additive cipher, Shift cipher,
I. INTRODUCTION Caesar cipher, Multiplicative cipher and Affine cipher are
Cryptography is the study how to make a secret code. A popular monoalphabetic ciphers and Vigenère cipher, Autokey
cipher is a method of concealing that plain text is transformed cipher, Playfair cipher, Beaufort cipher, Running key cipher,
into cipher text. The procedure of encoding plain text into Porta cipher, Hill cipher, One-Time pad and Rotor cipher are
cipher text is defined as encipherment or encryption; the popular polyalphabetic ciphers.
procedure of decoding cipher text into plain text is defined as
Modern ciphers have two key characteristics: diffusion and
decipherment or decryption. Both encipherment and
confusion. The diffusion concept must hide the correlation
decipherment are controlled by cryptographic keys as shown in
between the text of the chip and the plain text. This will
Fig. 1.
frustrate the adversary who uses the cipher text statistics to find
There are two kinds of basic ciphers: transpositions and the plain text. The confusion concept is to hide the correlation
substitutions. A transposition cipher changes the location of the between the cipher text and the key. This will frustrate the
elements. An element in the first place of the plain text may opponent who attempts to find the key using the cipher text.
come out in the tenth place of the cipher text. An element in the Diffusion and confusion can be achieved through Shannon’s
eight place of the plain text may come out in the first place of concept of a complex cipher known as a product cipher [3].
the cipher text. In other words, a transposition cipher reorders The capability of the cryptographic cipher technique depends

978-1-5386-8260-9/19/$31.00 ©2019 IEEE

 2019 International Conference on Computer Communication and Informatics (ICCCI -2019), Jan. 23 – 25, 2019, Coimbatore, INDIA

upon the fact that how complex it is to be broken down by a polyalphabetic cipher techniques make the message more
cryptanalyst. secure as compared to various other techniques.
The cipher Vigenère is the most popular of the cipher Generally, to create a polyalphabetic cipher, each ciphertext
techniques. It is a polyalphabet chip technique which uses the element is made on the basis of the corresponding plaintext
Vigenère table to encrypt and decrypt alphabets. As the element and the position of the plaintext element in the
Vigenère cipher does not have the properties of diffusion and message. This implies that the key ought to be a stream of
confusion, it is longer vulnerable to Kasiski and Friedman subkeys, in which each subkey element relies somehow on the
attacks based on letter frequency analysis. Thus, in this paper position of the character that uses that subkey for
we propose a polyalphabetic cipher that is a new encryption encipherment. In other words, a polyalphabetic cipher needs to
and decryption technique with diffusion and confusion have a key stream ( k = k1 , k 2 , k3 ,... ) in which k i is used to
properties based on the concept of the complex cipher used by
combining of Vigenère cipher with Affine cipher for the encipher the i th element in the plain text to create the i th
increase of data security in data storage and transmission on element in the cipher text [3].
public communication networks.
III. VIGENÈRE CIPHER
The purpose of this paper is to overcome the weaknesses of
the Vigenere cipher and to extend our proposed technique by An interesting type of polyalphabetic cipher was designed
using Myanmar alphabet characters. The structure of this paper by Blaise de Vigenère, a French mathematician from the 16th
is as follows. The section 2 includes general knowledge of century. It was referred to as Vigenère cipher. It was the most
ployalphabetic cipher technique and its advantages. In section common cipher in the ancient times because of its simplicity
3, we discuss Vigenère cipher technique and its weakness. The and resistance to the frequency analysis test of letters that could
section 4 includes monoalphabetc ciphers such as additive crack simple ciphers such as Caesar [4].
cipher, multiplicative cipher and Affine cipher used to combine
with our proposed technique. In section 5, we discuss our A. Encryption and Decryption
proposed technique. The section 6 extends our proposed In Vigenère cipher a table of English alphabets is used for
technique by using Myanmar alphabet characters. Finally, in both encryption and decryption, termed as tabula recta,
the section 7 we conclude our paper. Vigenère square, or Vigenère table. In the table 26 English
alphabets are alphabetically written out in different rows; each
II. POLYALPHABETIC CIPHER TECHNIQUES alphabet is shifted cyclically to the left row by row.
Around 1467, the Florentine architect Alberti innovated Each cipher element is denoted by a key element, which is
polyalphabetic ciphers [4]. He designed a cipher disk with a the cipher text element that substitutes for the plain text
larger outer and smaller inner wheel, indexed by plaintext and element. Each of the 26 cipher elements is laid out
ciphertext elements accordingly. Character arrangements made horizontally, with the key element for each cipher element to
an easy replacement by rotating the disk. The German monk itself. The Vigenère table is as shown in Fig. 2.
Trithemius published the first printed book on cryptography in
1518 [4], which contains a 24-elements square table listing all The cipher uses a different element from one of the rows of
shift substitutions for a fixed arrangement of English alphabets. the Vigenère table at various points in the encryption or
In 1553, Belaso suggested that the key should be easily varried decryption processes. The element used depends on a repeating
to design the fixed alphabetic substitutions in a polyalphabetic key stream at every point. In order to encrypt a message or
substitution [4]. Polyalphabetic ciphers can hide the occurrence plain text, the user should chose a key stream if the key stream
of the letter in the basic language. However, traditional length is equal to the plain text length. The cipher text element
polyalphabetic ciphers are not much harder to cryptanalyze; the is at the intersection of the row labeled ‘P’ and the column
traditional approaches are similar to the simple substitution labeled ‘Q’ for a given key element ‘P’ and the plain text
cipher. Actually, when the block length can be determined, the element ‘Q’; in which case the cipher text element is ‘F’.
cipher text elements can be divided into classes (where the Decryption is just as simple. The key element identifies the
class consists of those cipher text elements derived using row again. The cipher text element’s position in that row
permutation), and a frequency analysis can be done on each determines the column and plaintext element is at the top of the
class [4]. column [3].

A simple replacement cipher has a single mapping of the The plain text, for example, is: “ATTACKOFFICE”. The
plaintext element onto cipher text elements. A more complex message sender selects a key stream and repeats it until its
alternative is to use different substitution mappings (called length matches with the length of the plaintext, e.g. the key
multiple elements) on various portions of the plaint ext. This “KING”, then the key stream is: “KINGKINGKING”.
leads to so-called polyalphabet replacement. In the simplest The first element of the plaintext for encryption is ‘A’,
case, the different elements are sequentially used and repeated which can be encrypted using the element in row ‘K’, which is
so that the position of each plain text element in the source the first element of the selected key stream. The cipher element
string determines which mapping is applied. Under different is the intersection of the row ‘K’ and column ‘A’ of the
elements, the same plain text element is thus encrypted to Vigenère square, where the ‘K’ is, and the rest of the plain text
different cipher text elements, preventing simple frequency elements will continue in this way. The cipher text for the
analysis as per monoalphabetic substitution. Therefore, chosen plaintext will be “KBGGMSBLPQPK”.
 2019 International Conference on Computer Communication and Informatics (ICCCI -2019), Jan. 23 – 25, 2019, Coimbatore, INDIA

Select the row based on the key element for decryption and
find the position of the cipher text element in that row, and use
the corresponding column label as plaintext. The corresponding
cipher letter ‘K’ appears in column ‘A’ in the row ‘K’
identified by the first element of the key stream and the column
label ‘A’ is the first element of the plaintext. Next we go to the
‘I’ row from the key stream, locate the cipher text ‘B’ which is
in the ‘T’ column, so ‘T’ is the second plaintext. In this way,
the rest of the cipher text continues. The plain text for the
cipher text “KBGGMSBLPQPK” will be “ATTACKOFFICE”.

Figure 3. Algebraic Computing of Vigenère cipher

C. Cryptanalysis
Like all polyalphabetic ciphers, the design of Vigenère
cipher is to conceal plain text letter occurrences which are
contained in the basic application of frequency analysis. At
different points in the message, the Vigenère cipher can
encrypt each plain text element as different cipher text
elements, defeating simple frequency analysis.
The key flaw of the Vigenère chip is the reproduction of the
key. If a cryptanalyst correctly estimates the key length, the
chip text can be broken easily. The Kasiski and Friedman tests
can help determine the length of the key.
Kasiski Test began with Riedrich Kasiski in 1863 [4]. The
cryptanalyst looks for frequent text pieces of at least three
characters in the cipher text in Kasiski test. The distances
between successive occurrences of the text chunks are likely to
be multiples of the length of the keyword. Finding more
frequent text chunks narrows down the possible lengths of the
keyword, since we can compute the greatest common divisor of
all the distances. The key length is the multiple of the greatest
Figure 2. Vigenère table common divisor.
Friedman Test began with William Friedmanis in 1925 [4].
B. Algebraic Description It is a statistical test that can be used to determine whether the
Cipher Vigenère can be viewed algebraically. If the letters chip text comes from a monoalphabetic or polyalphabetic chip.
‘A’ to ‘Z’ are taken to be the numbers ‘0’ to ‘25’, and addition This technique uses the index of coincidence, to measure the
is performed modulo 26, then Vigenère encryption E can be inequality of the cipher letter occurrences. By knowing
written using the key K , K p (probability that any two randomly chosen source-language
letters are the same, in case of English
Ci = EK ( Pi ) = ( Pi + ki ) mod 26 (1)
¦
25
K p= pi 2 ≈ 0.067 , pi is the probability that both the
i =0

and decryption D using the key K , alphabets are i.) and K r (probability of a coincidence for a
uniform random selection from the alphabet, in case of English
K r = 1 / 26 ), the estimated key length ( l ) can be solved by
Pi = D K (C i ) = (C i − k i ) mod 26 (2)
equation (3).

Where as P = P1 , P2 ,..., Pn is the plain text, C = C1, C2 ,..., Cn is

the cipher text and K = [(k1 , k 2 ,..., k m ), (k1 , k 2 ,..., k m ),..., k n ] K p − Kr
l= (3)
is the used key. Vigenère cipher can also be seen as Ko − Kr
combination of n additive ciphers.
Where Ko (observed coincidence rate) is
Thus using the previous example, encryption and decryption
¦
processes of Vigenère cipher are algebraically demonstrated c
n (n − 1)
using equation (1) and equation (2) in Fig. 3. i =1 i i
Ko = , where c is the size of the alphabet (26
N ( N − 1)
 2019 International Conference on Computer Communication and Informatics (ICCCI -2019), Jan. 23 – 25, 2019, Coimbatore, INDIA

for English), N is the length of the text, and n1 to nc are the Mandal and Deepti (2016) proposed a multi-level
encryption scheme for Vigenère cipher to improve
observed cipher text letter frequencies.
cryptanalysis security [12]. This method selected the same
IV. MODIFIED APPROACHES fixed length of plain text and key and used it in Vigenère table
to obtain a new text. The new text was used as a new key.
Researchers suggested various modified approaches to Using the new key the cipher text was transformed more and
improve the security of the Vigenère cipher as it was not secure sends the final cipher text to the receiver. At last the receiver
over the years. does the decryption in reverse way.
Kester (2012) proposed a Vigenère-based cryptosystem Subandi et al., (2017) developed the three-pass protocol
with a varying key [10]. This method was used to generate using Vigenère cipher with modification of keystream
consecutive keys based on the initial key value used during the generator [2]. This method changed the key on Vigenère
encryption process. The key was changed in the encryption Cipher. Consequently, if the key length was smaller than the
process. The first step key was different from the second step input plaintext length, the key would be generated by a process,
key due to the first step function. The function was used to so the next key nature would be different from the previous key
generate the key for the next encryption stage in subsequent nature. This method used three-pass protocol, in which
stages. The decryption process was expected to take place message sender does not need to send the key, since each uses
abnormally due to the arbitrary generation of encryption keys its own key for the message encryption and decryption
for encryption, which might not result in the expected result. processes, so protecting a message would be more complicated
Khalid (2012) proposed an alpha-qwerty cipher extending to solved.
to the cipher Vigenère [6]. This method redesigned the
Vigenère table to consist of 92 characters instead of 26 English V. MONOALPHABETIC CIPHER TECHNIQUES
alphabets. It then became a ninety-two by ninety-two matrix to
Current ciphers usually use a mixture of substitution with
improve the Vigenère table. It provided a larger set of character
transposition and some other complex transformations to create
that allowed more message variants to be encrypted.
a cipher text from a plain text. In our paper we stressed the
Kester (2013) proposed a Vigenère cipher-based hybrid need to propose a new combination method, Vigenère cipher
cryptosystem with columnary transposition cipher [11]. This with Affine cipher, because the cipher based on simple
method used columnary transposition cipher to scramble a Vigenère method is not safe. An Affine chip is a mixture of the
plaintext, which was then used as the key to the Vigenère additive chip with the multiplicative chip. Additive chips,
cipher encryption process. multiplicative chips and Affine chips are monoalphabetic
cipher techniques.
Omolara et al., (2014) proposed a hybrid cryptosystem
based on Caesar cipher and Vigenère cipher for secure data
A. Additive Cipher
communication [9]. A character key and a digit key were used
for the encryption process. A Caesar cipher was performed on Additive cipher is one method of deriving a permutation of
the character key using the shift of the digit key. Vigenère the letters of the alphabet. In it, every letter in the alphabet is
cipher is then performed on the plaintext using the new key. cyclically shifted by the same amount and the relative order of
The binary equivalent of the text generated is then operated the letters is kept the same [3]. The number of position
exclusively or with the digit key binary to generate the final the letter has been shifted is called the key. For example if we
ciphertext. use a key value of 5, ‘a’ is shifted 5 positions right in the
alphabet to ‘F’, ‘b’ to ‘G’ and so on. The letter ‘u’ is shifted to
Nishith and Kishore (2014) proposed a method to improve ‘Z’ and then we wrap around to the beginning of the alphabet.
the Vigenère cipher security by double columnar transposition The letter ‘v’ is mapped to ‘A’ and so on. (Here note:
[8]. This method used the Vigenère chip on a plaintext before lowercase is used for plain text and uppercase is used for cipher
using columnar transposition twice to transform the text text.) In other words, additive cipher can also be done by using
further. When competing with the Vigenère chip, the the position numbers of the letters of the alphabet. In this way,
computational complexity was increased. the English letters ‘A’ to ‘Z’ are firstly mapped to be the
Ali and Sarhan (2014) suggested an advanced encryption position numbers ‘0’ to ‘25’. For example, since plain text
algorithm to improve the Vigenère cipher security [5]. This letter (P) is ‘a’ and the key (K) is 5, the cipher text letter is
method combined Vigenère cipher with a current chip like computed by modular arithmetic addition operation such as
stream cipher. Stream cipher is reasonably considered to be a C = P + K (mod 26) . Then, C = 0 + 5(mod 26) = 5 . The position
resistant method and uses binary form instead of characters in number ‘5’ is mapped to the letter ‘F’. Thus the cipher text
which the plaintext, ciphertext and the key are bit streams. letter is ‘F’. The complete cipher table is shown in Fig. 4.
Ashish Shah (2016) proposed an encryption scheme to
improve the Vigenère cipher security [1]. This method
transformed Vigenère cipher into a product cipher by
combining two encryption schemes methodically: RC4 and
Figure 4. Additive Cipher Table
Vigenère are re-designed.
 2019 International Conference on Computer Communication and Informatics (ICCCI -2019), Jan. 23 – 25, 2019, Coimbatore, INDIA

B. Multiplicative Cipher the keys of the cipher. The value k 1 must be chosen such
Multiplicative cipher is another method for generating a that k 1 and n are coprime [7]. The decryption function is
permutation of the letters of the alphabet. In it, taking a key
value and each letter's position number is multiplied by 5 and defined as equation (5).
then the product is reduced by modulo 26 [3]. For example,
since plain text letter (P) is ‘h’ and the key (K) is 5, the cipher
text letter is computed by modular arithmetic multiplication
operation such as C = P × K (mod 26) . Then,
C = 7 × 5 = 9(mod 26) . The position number ‘9’ is mapped to
the letter ‘J’. Thus the cipher text letter is ‘J’. The complete
cipher table is shown in Fig. 5.

Figure 5. Multiplicative Cipher Table

C. Affine Cipher
The Affine cipher is a monoalphabetic substitution cipher
variant, in which each element in an alphabet is mapped to its Figure 6. Affine Cipher
numerical value; each element is converted into a code using a
simple mathematical transformation, and a code is converted
back to an element in an alphabet. The applied formula means P = ((C − k 2 ) × k1−1 ) mod n (5)
that each letter turns to one other, and back again. It means the
cipher is essentially a typical replacement chip that follows a
rule principal which letter goes to which. An Affine chip is Where k1−1 is the modular multiplicative inverse
created by combining the additive chip with multiplicative of k1 modulo n i.e., it satisfies the equation (6).
chip. It is a combination of both chips with a couple of keys.
The first key is used with the cipher multiplier, the second key
is used with the cipher additive [3]. The two keys are shared 1 ≡ k1.k1−1 mod n (6)
secret keys for both the sender and the message receiver. Fig. 6
shows that the Affine chip is in fact two chips, applied one by
The multiplicative inverse of k1 only exists if k1 and n are
one, including only one complex operation for the encryption
or decryption such as C = (( P × k1 ) + k 2 ) mod n and coprime [7].
P = ((C − k 2 ) × k1−1 ) mod n . ‘T’ is used as a temporary result
and indicates two separate operations: multiplication and
addition for encryption; subtraction and division for
decryption. As a result of a combination of ciphers, Affine
chip has reverse transformations in each process, encryption or
decryption. If addition is the last operation in encryption, then
subtraction should be the first in decryption. If multiplication is
the first operation in encryption, then division should be the
last in decryption. According to modular arithmetic concept,
division operation can be transformed to multiplication using Figure 7. Encryption of Affine Cipher
its corresponding modular multiplicative inverse operation.
1) Algebraic Description For example the plain text is: “A NICE PERSON’S POT”.
In the Affine cipher the letters of an alphabet of size n are If space and apostrophe characters are not considered, the plain
text is arranged as “ANICEPERSONSPOT”. The English
first mapped to the whole numbers in the range: 0,..., n − 1 . It
letters ‘A’ to ‘Z’ are taken to be the numbers ‘0’ to ‘25’. When
then uses modular arithmetic to transform the whole number
the plain text is enciphered with k1 = 11 and k 2 = 17 as shown
that each plaintext letter corresponds to into another whole
number that corresponds to a cipher text letter. The encryption in Fig. 7, the plain text is “REBNJAJWHPEAPS”. When the
function for a single letter is defined as equation (4). cipher text is deciphered with k 2 = 17 and k1 = 11 as shown
in Fig. 8, the plain text is “ANICEPERSONSPOT”. The
receiver of the message can define the plain text as ambiguous
C = (( P × k1 ) + k 2 ) mod n (4) meanings such as “A NICE PERSON SPOT”, “AN ICE
PERSON SPOT”, “AN ICE PERSONS POT” or “A NICE
Where modulus n is the size of the alphabet and k 1 and k 2 are PERSONS POT”.
 2019 International Conference on Computer Communication and Informatics (ICCCI -2019), Jan. 23 – 25, 2019, Coimbatore, INDIA

“TREETREETREETREETRE”. These two keys are shared

secret keys for both the sender and the receiver of the message.

Figure 8. Decryption of Affine Cipher

VI. PROPOSED TECHNIQUE

Our proposed technique is that the original Vigenère cipher
is developed by combining Vigenère cipher with Affine cipher.
Our proposed technique is also considered as a complex
transformation technique from Affine cipher known as a
monoalphabetic cipher technique to polyalphabetic cipher
technique that is called Vigenère-Affine cipher which based on
the combination of Vigenère cipher with Affine cipher.

A. Encryption and Decryption Figure 9. Addition Table

Our proposed technique uses two kinds of tables: addition
table and multiplication table. The modified tables are designed
by using English alphabet 26 characters and appending another
six essential characters such as space, comma, question mark,
apostrophe, and full stop to avoid ambiguous meanings and to
solve meaningful sentence. We must first design the modified
tables, addition table and multiplication table, using 31
characters of English alphabet. Thus, the size of these tables is
31×31. These tables are created by using character position
numbers of English alphabet and our implementation system of
finite field arithmetic operations [7]. Addition table shown in
Fig. 9 is used for encryption and decryption processes of
additive cipher. Multiplication table shown in Fig. 10 is used
for encryption and decryption processes of multiplicative
cipher. The encryption and decryption processes of Vigenère-
Affine cipher are two steps-transformation processes shown in
Fig. 11. A pair of key streams, the first key stream and the
second key stream, is used in each process, encryption or
decryption. In encryption process, the first key stream is used
with multiplicative ciphers at the first step transformation and
the second key stream is used with additive ciphers at the
second step. In decryption process, the second key stream is Figure 10. Multiplication Table
used with additive ciphers at the first step transformation and
the first key stream is used with multiplicative ciphers at the For the first step transformation of encryption process, the
second step. For each transformation process the user should first letter of the plain text is ‘A’ and it can be enciphered using
chose a key stream by satisfying the condition that the length of the alphabet in row ‘K’, which is the first letter of the first key
the key stream should be equal to the length of the plain text or stream. At the first step using multiplicative cipher, the cipher
the cipher text. letter is the intersection of the row ‘K’ and column ‘A’ of the
For example the plain text is: “A NICE PERSON’S POT”. multiplication table; here it is ‘A’. For the second step
The plain text consists of 19 characters including space and transformation using additive cipher, the letter ‘A’ that got
apostrophe characters. The sender of the message chooses two from multiplicative cipher can be again enciphered using the
keys and repeats it until its length matches with the length of alphabet in row ‘T’, which is the first letter of the second key
the plain text, for example, the first key is “KING”, then the stream. In additive cipher, the cipher letter is the intersection of
first key stream will be: “KINGKINGKINGKINGKIN”. If the the row ‘T’ and column ‘A’ of the addition table; here it is ‘T’.
second key is “TREE”, then the second key stream will be: The rest of the plain text will continue in these procedures. The
 2019 International Conference on Computer Communication and Informatics (ICCCI -2019), Jan. 23 – 25, 2019, Coimbatore, INDIA

cipher text for the chosen plaintext will be “TISVISBB?’V

ZVBFOFD”.
For the first step transformation of decryption process,
using addition table, in the row ‘T’ identified by the first letter
of the second key stream, the corresponding cipher letter ‘T’
appears in column ‘A’, which is the first letter got from the
additive cipher. For the second step transformation using
multiplication table, in the row ‘K’ identified by the first letter
of the first key stream, the corresponding letter ‘A’ got from
the additive cipher appears in the column ‘A’, which is the first
plaintext letter got from the multiplicative cipher. The rest of
the cipher text will continue in these procedures. The plain text
for the given cipher text will be “A NICE PERSON’S POT”. If
we did not consider space and apostrophe characters, the plain
text may be ambiguous meaning like “AN ICE PERSON
SPOT”.

B. Algebraic Description
Figure 11. Vigenère-Affine Cipher
In the Vigenère-Affine cipher the letters of an alphabet of
size n are first mapped to the integers in the range: 0,..., n − 1 .
The English letters ‘A’ to ‘Z’ are taken to be the numbers ‘0’ to
‘25’ and then map space character to ‘26’, comma to ‘27’,
question mark to ‘28’, apostrophe to ‘29’ and full stop to ‘30’.
It includes a total of 31 characters. It then uses modular
arithmetic to transform the integer that each plaintext letter
corresponds to into another integer that corresponds to a cipher
text letter. The encryption function for a single letter is defined
as equation (7). The algebraic computing for encryption
process of the Vigenère-Affine cipher is demonstrated in Fig.
12.

Ci = (( Pi × fk i ) + sk i ) mod n (7)

Where P = P1 , P2 ,..., Pn is denoted as the plain text, Figure 12. Algebraic Computing of Encryption Process
C = C1 , C 2 ,..., C n is denoted as the cipher text,
FK = [( fk1 , fk 2 ,..., fk m ), ( fk1 , fk 2 ,..., fk m ),..., fk n ] is denoted as
the first key stream,
SK = [( sk1 , sk 2 ,..., sk m ), ( sk1 , sk 2 ,..., sk m ),..., sk n ] is denoted as
the second key stream and the modulus n is the size of the
alphabets. The decryption function is defined as equation (8).
The algebraic computing for decryption process of the
Vigenère-Affine cipher is demonstrated in Fig. 13.

Pi = ((Ci − sk i ) × fk i −1 ) mod n (8)

Where fk i −1 is the modular multiplicative

inverse of fk i modulo n .i.e., it satisfies the equation (9). Figure 13. Algebraic Computing of Decryption Process

1 = fk i × fk i −1 mod n (9) VII. MYANMAR POLYALPHABETIC CIPHER

Our proposed technique can also be extended by any
The modulus n should be prime such that every letter of an language. In this section, our proposed technique is extended
alphabet of size n possesses the corresponding modular by Myanmar language for the increase of data security for
multiplicative inverse i.e. the size of the alphabets should be Myanmar language. This cipher technique transforms the plain
prime. text message in Myanmar alphabet characters into the cipher
 2019 International Conference on Computer Communication and Informatics (ICCCI -2019), Jan. 23 – 25, 2019, Coimbatore, INDIA

text in Myanmar alphabet characters using the key in Myanmar

alphabet characters.

A. Encryption and Decryption

Myanmar Unicode Character Map includes 160 characters
[13]. To extend our proposed technique by Myanmar language
we must first really design the modified tables, addition table
and multiplication table, using 160 characters of Myanmar
alphabet. Thus, the size of these tables is 160×160. But, these
tables’ designs are too large to fit the size of the paper. Thus,
the modified tables are designed, for example, by the limitation Figure 14. Encipherment and Decipherment Using Myanmar Tables
of the characters of Myanmar alphabet, based on characters
that include in the message and the keys. The following
example includes a total of 17 different characters of Myanmar
alphabet as shown in Fig. 14. Thus, the size of these tables is
17×17. The additive table with Myanmar alphabet characters is
Figure 15. Character Map
shown in Fig. 15 and the multiplication table with them is
shown in Fig. 16. These tables are created by using character
position numbers of Myanmar alphabet and our
implementation system of finite field arithmetic operations [7]
and used for encryption and decryption processes like
Vigenère-Affine cipher.
For example,

The plain text consists of 25 characters. The sender of the

message chooses two keys and repeats it until its length
matches with the length of the plain text. These two keys are Figure 16. Myanmar Addition Table
shared secret keys for both the sender and the receiver of the
message. The Fig. 17 shows the encipherment and the
decipherment of the Myanmar polyalphabetic cipher using the
Myanmar addition table and Myanmar multiplication table. In
the figure the symbol ‘P’ is denoted as plain text, ‘C’ as cipher
text, ‘K’ as keys and ‘T’ as temporary storage.
For the first step transformation of encryption process, the
first letter of the plain text can be enciphered using the alphabet
in the row which is the first letter of the first key stream. At the
first step using multiplicative cipher, the cipher letter is the
intersection of the row and the column of the Myanmar
multiplication table. For the second step transformation using Figure 17. Myanmar Multiplication Table
additive cipher, the letter that got from multiplicative cipher
can be again enciphered using the alphabet in the row which is The followings show the algebraic computing of Myanmar
the first letter of the second key stream. In additive cipher, the polyalphabetic cipher. It uses the equation (7) for the
cipher letter is the intersection of the row and the column of the encryption process shown in Fig. 18 and the equations (8) and
Myanmar addition table. The rest of the plain text will continue (9) for the decryption process shown in Fig. 19, using the
in these procedures. algebraic computing that is described in the section (6.2).
For the first step transformation of decryption process,
using Myanmar addition table, in the row identified by the first
letter of the second key stream, the corresponding cipher letter
appears in the column which is the first letter got from the
additive cipher. For the second step transformation using
Myanmar multiplication table, in the row identified by the first
letter of the first key stream, the corresponding letter got from
the additive cipher appears in the column which is the first
plaintext letter got from the multiplicative cipher. The rest of Figure 18. Algebraic Computing for Myanmar Encryption Process
the cipher text will continue in these procedures.
 2019 International Conference on Computer Communication and Informatics (ICCCI -2019), Jan. 23 – 25, 2019, Coimbatore, INDIA

REFERENCES
[1] A. Shah, “Enhancing Security of Vigenere Cipher using modified
RC4”, International Journal of Computer Applications, vol. 136, no 5,
pp 38-41, Feb. 2016.
[2] A. Subandi, R. Mieyanti, C. L. M. Sandy, R. W. Sembiring, “Three-Pass
Protocol Implementation in Vigenere Cipher Classic Cryptography
Algorithm with Keystream Generator Modification”, Advances in
Science, Technology and Engineering Systems Journal vol. 2, no. 5,
pp1-5, 2017.
[3] B. A. Forouzan, “Traditional Symmetric-Key Ciphers”, in
“Cryptography and Network Security”, International Edition, Singapore,
McGraw-Hill press, 2008, pp 55-90.
[4] Dorothy E. Denning, “Encryption Algorithms“, in Cryptography and
Data Security”, Addison Wesley Publishing Company Inc., U.S.A.,
1982, pp 59-125.
[5] F. M. S. Ali, F. H. Sarhan, “Enhancing Security of Vigenere Cipher by
Stream Cipher“, International Journal of Computer Applications, vol.
100, no. 1, pp 1-4, Aug. 2014.
Figure 19. Algebraic Computing for Myanmar Decryption Process
[6] M. Khalid, N. Wadhwa, V. Malhotra, “Alpha-Qwerty Cipher”,
International Journal of Advanced Compting, vol. 3, no 3, pp 107-118,
May 2012.
VIII. CONCLUSION
[7] N. N. Hla, T. M. Aung. “Implementation of Finite Field Arithmetic
The Vigenere cipher sees it as the simplest and weakest Operations for Large Prime and Binary Fields using java BigInteger
technique, making it easy for intruders or attackers to detect it. class”, International Journal of Engineering Research and Technology
(IJERT), Volume 6, Issue 08, pp 450-453, August – 2017, DOI:
To overcome the weaknesses of the Vigenere cipher, we 10.17577/IJERTV6IS080209.
propose the Vigenère-Affine cipher that is a new
[8] N. Sinha, K. Bhamidipati, “Improving Security of Vigenère cipher by
polyalphabetic cipher with diffusion and confusion properties Double Columnar Transposition “,International Journal of Computer
based on the complex cipher concept used to combine Applications, vol. 100, no. 14, pp 6-10, Aug. 2014.
Vigenère cipher with Affine cipher. Since our proposed [9] O. E. Omolara, A. I. Oludare, S. E. Abdulahi, “Developing a Modified
encryption technique is a complex process of transformation Hybrid Caesar Cipher and Vigenere Cipher for Secure Data
using two modified tables with a pair of key streams, it has Communication”, International Journal of Computer Engineering and
high level diffusion and confusion properties. It hides the Intelligent Systems, vol 5, no 5, pp 34-46, 2014.
correlation between the cipher text and the plain text, and [10] Q. A. Kester, “A cryptosystem based on Vigenère cipher with varying
key”, International Journal of Advanced Research in Computer
makes the cryptanalysis more difficult. On the other hand, the Engineering & Technology, vol. 1, no 10, pp 108-113, Dec. 2012.
modified tables of the proposed technique are designed for the [11] Q. A. Kester, “A Hybrid Cryptosystem based on Vigenère cipher and
message recipient not to be ambiguous in a sentence. In Columnar Transposition Cipher”, International Journal of Advanced
addition, the idea of introducing the more characters in Technology and Engineering Research, vol. 3, no. 1, pp 141-147, Jan.
modified tables can be added so that the cryptanalysis process 2013.
is more complex. Our proposed technique can also be extended [12] S. K. Mandal, A. R. Deepti, “A Cryptosystem Based On Vigenere
by any language and it has now been done by using characters Cipher By Using Mulitlevel Encryption Scheme”, International Journal
of Computer Science and Information Technologies, vol. 7, no. 4, pp
of Myanmar alphabet. Myanmar polyalphabetic cipher can also 2096-2099, 2016.
be extended for military purpose and e-government system of [13] https:/unicode.org/charts/PDF/U1000.pdf
Myanmar.