Al-Jabar: Jurnal Pendidikan Matematika

Volume 14, Number 02, 2023, Pages 281 – 297

http://ejournal.radenintan.ac.id/index.php/al-jabar/index

Text security by using a combination of the vigenere

cipher and the rubik's cube method of size 4×4×4

Raudhatun Safitri1, Puguh Wahyu Prasetyo2*, Dian Eka Wijayanti1,

Samsul Arifin3, Fariz Setyawan2, Joe Repka4
1
Department of Mathematics, Universitas Ahmad Dahlan, Yogyakarta, Indonesia
2
Department of Mathematics Education, Universitas Ahmad Dahlan, Yogyakarta, Indonesia
3
Department of Statistic, School of Computer Science, Bina Nusantara University, Jakarta 11480, Indonesia
4
Department of Mathematics, University of Toronto, Canada
[email protected]*

Abstract
Background: With the rise in technology, information security is
Article Information becoming increasingly crucial. Cryptography is identified as a key tool to
Submitted June 07, 2023 protect data and information from growing technological threats.
Revised Aug 09, 2023 Aim: The primary goal of this study is to improve text security by
Accepted Aug 12, 2023 integrating the Vigenere cipher with the Rubik's cube algorithm. This
innovative approach is aimed at strengthening the protection of textual
Keywords data against unauthorized access and eavesdropping. The feasibility of this
Technology; method is demonstrated through a simulation in the Python programming
Document files; environment, specifically in Google Colab.
Cryptography; Method: The study adopts a qualitative research methodology, enhanced
Encryption and decryption; by an empirical simulation. It involves the application of the Vigenere
Vigenere cipher; Cipher and the Rubik's Cube algorithm in a 4×4×4 format for encrypting
Rubik’s cube. and decrypting text, with simulations performed on the Google Colab
platform.
Results: The research indicates that the combination of the Vigenere
Cipher and the Rubik's Cube algorithm in a 4×4×4 configuration
effectively generates ciphertext. This result is substantiated by simulations
in Google Colab, showcasing the method's efficiency and practicality.
Conclusion: The study presents a significant advancement in text security
in the modern technological era. By merging the Vigenere Cipher with the
4×4×4 Rubik's Cube algorithm, it demonstrates a considerable
improvement in the confidentiality of sensitive textual information. The
practical application and effectiveness of this encryption method are
validated through empirical simulations in Google Colab, highlighting its
potential as a significant tool in information security.

INTRODUCTION
In the current technological era, information security is increasingly important (Al-Meer et al,
2023; Buser et al, 2023; Teranishi & Kogiso, 2023; Moosa et al, 2023; Dey & Dutta, 2023).
Human activities are mostly related to data, information, and communication, and our activities
are directly or indirectly related to computer technology devices (Syahib et al., 2017). Security
is a basic human need; one vital aspect is the security of text. However, this has received less
attention from designers and managers of information systems. The massive development of
technology has led to higher levels of threat to the security of data and information
dissemination (Luengo et al, 2023; Pirandola et al, 2023; Ye et al, 2023; Aissaoi et al, 2023;
Schwiderowksi et al, 2023; Pocher et al, 2023; Chiu et al, 2023; Rehman et al, 2023; Huang et
al, 2023; Rupa et al, 2023; Jaithunbi et al, 2022; Ahamed & Krishnamoorthy, 2020). Recent
criminal wiretapping activities by other countries, and have caused serious problems, including
How to cite Safitri, R., Prasetyo, P. W., Wijayanti, D. E., Arifin, S., Setyawan, F., & Repka, J. (2023). Text security by using a
combination of the vigenere cipher and the rubik's cube method of size 4×4×4. Al-Jabar: Jurnal Pendidikan
Matematika, 14(2), 281-297. 281
e-ISSN 2540-7562.
Published by Mathematics Education Department, UIN Raden Intan Lampung.
in Indonesia. If not addressed immediately, such activities will have a major impact. The sectors
that have experienced the most hacks based on data from the National Cyber and Crypto
Agency (BSSN) are shown in Figure 1

Cases Percentage (%)

37
40
26
30 18
20 9 10
10
0
Academic Private Local Government Others
Sector Sector Government

Figure 1. Column Chart of hacked sectors

The risk of data theft causes users to feel insecure if they have not taken action to secure
stored documents (Tampubolon, 2021). The main target of theft is digital documents that have
a high value (Aulia et al., 2019). Thus, a strong level of security for a file containing confidential
data is highly expected for all users who store important data in it. Cryptography can be the
right solution to protect against these crimes. Cryptography is a science that studies how to keep
data or messages secure from interference by third parties; this is achieved by using a
mathematical algorithm that converts data or information into a series of texts that are difficult
to understand so that only the intended users can read and process it (Padhye et.al, 2018).
Advances in computer science in the last 60 years have made cryptography a basic part of all
aspects of contemporary life. Cryptography studies the transmission of data that is encoded in
such a way that only the intended recipient can decode it (Baldoni et.al, 2008). Cryptography
is proven to be secure against certain types of attacks.
The main purpose of cryptography is to keep plaintext secret from eavesdroppers. Third
parties may try to modify messages that are in the data and are deemed to have full access to
the communication channel. Therefore, cryptography is expected to guarantee the truth of the
message (Delfs & Knebl, 2007). Cryptography converts data or messages into data that is
encoded by the sender. This process is known as encryption. Encryption is the process of
converting data or messages to be sent into a form that cannot be recognized by third parties.
After the data or message reaches the recipient, the recipient performs decryption which is the
opposite of encryption. Decryption can be interpreted as the process of changing the data or
message back to its initial form so that the data or message can be conveyed to the recipient.
The original data or message is called plaintext while messages that cannot be recognized by
third parties are called ciphertext (Sumandri, 2017). Many cryptographic algorithms are
designed to hide a message. Cryptographic algorithms are currently grouped into classical
algorithms and modern algorithms (Fatonah et al., 2016). One of the cryptosystems of
cryptography is the Vigenere Cipher. This cryptographic algorithm was published by a diplomat
and cryptologist from France, namely Blaise de Vigenere, but in fact, this algorithm was

282
previously described in the book La Cifra del Sig. by Giovan Batista Belaso (1553) (Minarni
& Redha, 2020). The security of Vigenere Cipher depends on the number of keys used. One of
the advantages of the Vigenere Cipher is the algorithm for character encryption is relatively
simple but safe enough to guarantee confidentiality.
On the other hand, the cryptography of the 4 × 4 × 4 Rubik's Cube algorithm is famous
for its complexity. This is because of the various configurations generated by randomization,
which will increase the difficulty of guessing all keys. The basic idea of this research on
symmetric cryptography design based on the 4 × 4 × 4 Rubik's Cube is complexity and an
enormous number of possible guesses (Liwandouw & Wowor, 2016). Rubik's Cube was
invented in 1974 by the Hungarian sculptor and professor of architecture, Erno Rubik. In 2016,
Abitha and Pradeep proposed communication security based on the Rubik's Cube algorithm, in
which one of the steps is the use of the Rubik's Cube principle for encrypting an image (Nana
& Prasetyo, 2021).
Based on several previous studies, the authors propose an algorithm that combines the
Vigenere Cipher and Rubik's Cube 4 × 4 × 4 methods. In the method, a message or text is first
scrambled using the Vigenere Cipher method, and the ciphertext is obtained. The ciphertext
obtained in the first process is scrambled again using a 4 × 4 × 4 Rubik's Cube. The 4 × 4 × 4
Rubik's Cube is chosen so it can accommodate 64 characters. Combining the Vigenere Cipher
and the 4 × 4 × 4 Rubik's Cube to perform the encryption and decryption can improve data
security because the complexity of the ciphertext is more complicated than that obtained using
only one algorithm or using 3 × 3 × 3 Rubik's Cube.

METHODS
The method of this research is qualitative research with empirical simulation by using a google
colab. The cryptography method is one of the methods used to improve text security because it
can perform the process of encryption and decryption (Budiman & Paradise, 2019; Younus &
Hussain, 2022). Someone without a decryption key will be unable to retrieve the encrypted
document. The ciphertext will be decrypted using an agreed-upon key, and the original data
will be returned. In the not-too-distant future, the chances of someone without a decryption key
recovering the original text are extremely slim (Arifin et al., 2021).
The way the Vigenere cipher works is almost the same as the Caesar cipher. The Vigenere
cipher is one of the classical cryptographic algorithms that use the compound alphabetic
substitution method (Uniyal et al, 2021; Boussif et.al, 2020; Park et al, 2020; Gro𝑠̌ ek et al,
2019). Compound-alphabet substitution encrypts each letter using a different key, unlike the
Caesar cipher which uses the single-alphabet substitution method, encrypting all letters using
the same key (Hoerudin & Pratama, 2020; Bingö l, 2022). The Encryption and Decryption
process in the Vigenere Cipher works by reading a word for a character, where if the message
sent exceeds the length of the key used, the key will be repeated until the message sent gets its
respective key (Amrulloh & Ujianto, 2019). Classical cryptography is a character-based
cryptographic algorithm, namely encryption and decryption are used for each character of the
message. The classical algorithm belongs to the symmetric cryptographic system (Permanasari,
2017), namely encryption and decryption techniques with the same technique or method or key
(Irawan, 2017).

283
 The testing process in this study was carried out with two encryption processes. The first
encryption uses Vigenere Cipher then the second encryption uses the 4 × 4 × 4 Rubik's Cube
algorithm. The Rubik’s Cube has 6 surfaces and has 6 different colors with dimensions of
4 × 4 × 4 (Yudanto & Suartana, 2022). Notation - movement notation on the 4 × 4 × 4
Rubik's Cube as follows:

Figure 2. Cartesian coordinates of the movement of the 4 x 4 × 4 Rubik's Cube

After the decryption process using 4 × 4 × 4 Rubik's Cube method, a second decryption was
carried out using the Vigenere Cipher algorithm.

Table 1. 4 × 4 × 4 Rubik's Cube Movement Notation

Side The direction of Movement on Rubik's Cube 𝟒 × 𝟒 × 𝟒
F (Front) Front side rotation rotates around the z-axis by 90° clockwise
F’ (F accent) Front side rotation rotates around the z-axis by 90°counterclockwise
F2 (F double) Front side rotation rotates around the z-axis by 180°
f (inner front) Inner front side rotation rotates around the z-axis by 90° clockwise
f’ (f accent) Inner front side rotation rotates around the z-axis by 90°counterclockwise
f2 (f double) Inner front side rotation rotates around the z-axis by 180°
B (Back) Rear side rotation rotates around the z-axis by 90° clockwise
B’ (B accent) Rear side rotation rotates around the z-axis by 90° counterclockwise
B2 (B double) Rear side rotation rotates around the z-axis by 180°
b (inner back) Inner back side rotation rotates around the z-axis by 90° clockwise
b’ (b accent) Inner back side rotation rotates around the z-axis by 90° counterclockwise
b2 (b double) Inner back side rotation rotates around the z-axis by 180°
U (Up) Top side rotation rotates around the y-axis by 90° clockwise
U’ (U accent) Top side rotation rotates around the y-axis by 90° counterclockwise
U2 (U double) The rotation of the top side rotates around the y-axis by 180°
u (inner up) The inner top side rotates around the y-axis by 90° clockwise
u’ (u accent) The inner top side rotates around the y-axis by 90° counterclockwise
u2 (u double) Inner top side rotation rotates around the y-axis by 180°
D (Down) Bottom side rotation rotates around the y-axis by 90° clockwise
D’ (D accent) Bottom side rotation rotates around the y-axis by 90° counterclockwise
D2 (D double) Bottom side rotation rotates around the y-axis by 180°
d (inner down) The inner bottom side rotates around the y-axis by 90° clockwise
d’ (d accent) The inner bottom side rotates around the y-axis by 90° counterclockwise
d2 (d double) Inner bottom side rotation rotates around the y-axis by 180°
L (Left) Left side rotation rotates around the x-axis by 90° clockwise
L’ (L accent) Left side rotation rotates around the x-axis by 90° counterclockwise
L2 (L double) Left side rotation rotates around the x-axis by 180°
l (inner left) Inner left side rotation rotates around the x-axis by 90° clockwise

284
 Side The direction of Movement on Rubik's Cube 𝟒 × 𝟒 × 𝟒
l’ (l accent) The inner left side rotation rotates around the x-axis by 90° counterclockwise
l2 (l double) The inner left side rotation rotates around the x-axis by 180°
R (Right) Right side rotation rotates around the x-axis by 90° clockwise
R’ (R accent) Right side rotation rotates around the x-axis by 90° counterclockwise
R2 (R double) Right side rotation rotates around the x-axis by 180°
r (inner right) Inner right side rotation rotates around the x-axis by 90° clockwise
r’ (r accent) Inner right side rotation rotates around the x-axis by 90° counterclockwise
r2 (r double) The inner right side rotation rotates around the x-axis by 180°

The Vigenere Cipher encryption process is carried out in the following steps:
1. Determine the encrypted text, then divide it per block.
2. Determine the lock and key space to be used.
3. Convert letters by following ASCII table rules.
4. Text encryption with the Vigenere Cipher method.
𝐶𝑖 = 𝑒𝑘 ( 𝑃𝑖 ) = (( 𝑃𝑖 + 𝐾𝑖 − 64) 𝑚𝑜𝑑 95 ) + 32
5. Ciphertext generated.
After the encryption process with the Vigenere Cipher method, the preliminary ciphertext
is obtained. The text will be used as the initial text in the second encryption process, namely by
using the 4 × 4 × 4 Rubik's Cube algorithm.
The 4 × 4 × 4 Rubik's Cube encryption process is carried out in the following steps:
1. Determine the position of the plaintext to be encrypted in 4 × 4 × 4 Rubik's Cube blocks.
2. Determine the plaintext per character in the specified block.
3. Fill all the remaining blocks with an “X”.
4. Determine the key to use.
5. Obtaine ciphertext.
The encryption process is carried out by combining two methods, namely Vigenere
Cipher and the 4 × 4 × 4 Rubik's Cube. The first process uses the Vigenere Cipher method,
and the second uses the 4 × 4 × 4 Rubik's Cube. The process is carried out sequentially and the
ciphertext obtained from the first process becomes the plaintext of the second process, which
is the final ciphertext. As for the decryption process, it is done the other way around.
The decryption process in Rubik's Cube algorithm can be done by the reverse of the encryption
process (Ma’rifah, 2022). The decryption process using the 4 × 4 × 4 Rubik's Cube method is
carried out with the following algorithm:
1. Form a Rubik based on the given key.
2. Insert ciphertext sequentially based on a predetermined order.
3. Determine the inverse of the key.
4. Returns the Rubik's Cube with the inverse of the key.
5. Enter the plaintext that matches the ciphertext into the decryption of the Vigenere Cipher.
The Vigenere Cipher decryption process is carried out in the following steps:
1. Insert the decrypted ciphertext, then divide it per block.
2. Determine the lock and key space to be used.
3. Convert letters by following ASCII table rules.
4. Text decryption with the Vigenere Cipher method.
𝑃𝑖 = 𝑑𝑘 ( 𝐶𝑖 ) = (( 𝐶𝑖 − 𝐾𝑖 ) 𝑚𝑜𝑑 95 ) + 32
5. Get plaintext.

285
RESULTS AND DISCUSSION
Encryption Process by Using Vigenere Cipher
Plaintext : Universitas Ahmad Dahlan memperoleh Akreditasi Institusi “A” tahun 2017.
Key : Matematika_2018
Plaintext and keys are substituted into numeric form based on the values in the American
Standard Code for Information Interchange (ASCII) table.
Table 2. Substitution of plaintext and key into ASCII table
𝑷𝒊 U n i v e r s I t a
ASCII Value 85 110 105 118 101 114 115 105 116 97
𝑲𝒊 M a t e m a t I k a
ASCII Value 77 97 116 101 109 97 116 105 107 97
𝑷𝒊 S (space) A h m a d (space) D a
ASCII Value 115 32 65 104 109 97 100 32 68 97
𝑲𝒊 _ 2 0 1 8 M a T e m
ASCII Value 95 50 48 49 56 77 97 116 101 109
𝑷𝒊 H l a n (space) m e M p e
ASCII Value 104 108 97 110 32 109 101 109 112 101
𝑲𝒊 A t i k a _ 2 0 1 8
ASCII Value 97 116 105 107 97 95 50 48 49 56
𝑷𝒊 R o l e h (space) A K r e
ASCII Value 114 111 108 101 104 32 65 107 114 101
𝑲𝒊 M a t e m a t I k a
ASCII Value 77 97 116 101 109 97 116 105 107 97
𝑷𝒊 D i t a s i (space) I n s
ASCII Value 100 105 116 97 115 105 32 73 110 115
𝑲𝒊 _ 2 0 1 8 M a T e m
ASCII Value 95 50 48 49 56 77 97 116 101 109
𝑷𝒊 T i t u s i (space) “ A “
ASCII Value 116 105 116 117 115 105 32 34 65 34
𝑲𝒊 A t i k a _ 2 0 1 8
ASCII Value 97 116 105 107 97 95 50 48 49 56
𝑷𝒊 (space) t a h u n (space) 2 0 1
ASCII Value 32 116 97 104 117 110 32 50 48 49
𝑲𝒊 M a t e m a t I k a
ASCII Value 77 97 116 101 109 97 116 105 107 97
𝑷𝒊 7 .
ASCII Value 55 46
𝑲𝒊 _ 2
ASCII Value 95 50

After the substitution, the encryption process is carried out one by one as follows:

𝐶𝑖 = 𝑒𝑘 ( 𝑃𝑖 ) = (( 𝑃𝑖 + 𝐾𝑖 − 64 ) 𝑚𝑜𝑑 95 ) + 32

𝐶1 = (( 𝑃1 + 𝐾1 − 64 ) 𝑚𝑜𝑑 95 ) + 32
= (( 85 + 77 − 64 ) 𝑚𝑜𝑑 95 ) + 32 = 35 = #
𝐶2 = (( 𝑃2 + 𝐾2 − 64 ) 𝑚𝑜𝑑 95) + 32
= (110 + 97 − 64 ) 𝑚𝑜𝑑 95 = 80 = 𝑃
𝐶3 = (( 𝑃3 + 𝐾3 − 64 ) 𝑚𝑜𝑑 95 ) + 32
= (( 105 + 116 − 64 ) 𝑚𝑜𝑑 95) + 32 = 92 = ^
......
𝐶68 = (( 𝑃68 + 𝐾68 − 64 ) 𝑚𝑜𝑑 95 ) + 32
= (( 50 + 105 − 64 ) 𝑚𝑜𝑑 95) + 32 = 123 = {

286
 𝐶69 = (( 𝑃69 + 𝐾69 − 64 ) 𝑚𝑜𝑑 95 ) + 32
= (( 48 + 107 − 64 )𝑚𝑜𝑑 95 ) + 32 = 123 = {
𝐶70 = (( 𝑃70 + 𝐾70 − 64 ) 𝑚𝑜𝑑 95 ) + 32
= (( 49 + 97 − 64 ) 𝑚𝑜𝑑 95 ) + 32 = 114 = 𝑟
𝐶71 = (( 𝑃71 + 𝐾71 − 64 ) 𝑚𝑜𝑑 95 ) + 32
= (( 55 + 95 − 64 ) 𝑚𝑜𝑑 95 ) + 32 = 118 = 𝑣
𝐶72 = (( 𝑃72 + 𝐾72 − 64 ) 𝑚𝑜𝑑 95 ) + 32
= (( 46 + 50 − 64 ) 𝑚𝑜𝑑 95 ) + 32 = 64 = @
Based on the encryption process above, the ciphertext obtained is as follows:

#𝑃^\𝑆𝑇ℎ𝑆’𝐶𝑆2𝑄𝑦&/𝐹𝑡 ∗ 𝑂𝑗𝑎𝐾𝑍𝑎𝑀𝑤}”}@𝑄𝑎𝐾𝑉𝑎6𝑈^𝐺𝐷{%𝑟, 7𝑎
> 𝑇𝑎𝑉^^𝑎𝑈𝐼22𝑅: 𝑀𝑉𝑉𝑁𝑐𝑃𝑡{{𝑟𝑣@
𝟒 × 𝟒 × 𝟒 Rubik’s Cube
Plaintext :
#𝑃^\𝑆𝑇ℎ𝑆’𝐶𝑆2𝑄𝑦&/𝐹𝑡 ∗ 𝑂𝐽𝑎𝐾𝑍𝑎𝑀𝑤}”}@𝑄𝑎𝐾𝑉𝑎6𝑈^𝐺𝐷{%𝑟, 7𝑎
> 𝑇𝑎𝑉^^𝑎𝑈𝐼22𝑅: 𝑀𝑉𝑉𝑁𝑐𝑃𝑡{{𝑟𝑣@
′
Key : 𝑅 − 𝐿 − 𝑈2 − 𝐷 − 𝐹 − 𝐵2 − 𝑈′

Figure 3. Initialize encryption process with the 4 × 4 × 4 Rubik's Cube

The first step, at the initialization stage of the Rubik's Cube, rotates around the x-axis by 90°
clockwise on the right side (R). So the resulting Rubik's Cube block position is as follows:

Figure 4. Initialize encryption process with the 4 × 4 × 4 Rubik's Cube first step

287
The second step results in the first stage, the Rubik's Cube is rotated on the left side rotating
around the x-axis by 90° counterclockwise (L'). So that the following results are obtained:

Figure 5. Initialize encryption process with the 4 × 4 × 4 Rubik's Cube second step
In the third step, the Rubik's Cube generated in the second stage of rotation of the top side
rotates around the y-axis by 180° (U2). The following results were obtained:

Figure 6. Initialize encryption process with the 4 × 4 × 4 Rubik's Cube third step
In the fourth step, the Rubik's Cube generated in the third stage of rotation of the bottom side
rotates around the y-axis by 90° clockwise(D). The following results were obtained:

Figure 7. Initialize encryption process with the 4 × 4 × 4 Rubik's Cube fourth step
In the fifth step, the Rubik's Cube generated in the fourth stage of rotation of the front side
rotates around the z-axis by 90° clockwise (F). The following results were obtained:

288
 Figure 8. Initialize the encryption process with the 4 × 4 × 4 Rubik's Cube fifth step
In the sixth step, the back side rotation rotates around the z-axis by 180° (B2). The following
results were obtained:

Figure 9. Initialize encryption process with the 4 x 4 × 4 Rubik's Cube sixth step
In the last step, the Rubik's Cube generated in the sixth stage is rotated around the z-axis by
180° on the back side (U'). So that the ciphertext results are obtained as follows:

Figure 10.Initialize encryption process with the 4 × 4 × 4 Rubik's Cube seventh step
Based on the encryption process above, the ciphertext obtained is as follows:
𝑐𝐷6𝑇{𝐶𝑇@𝑋𝑆ℎ}𝑋𝑟𝐺#𝐼 : 𝑁𝑉𝐾𝑤@𝑎𝑎𝑀𝑋𝑄𝑋𝑋𝑋𝑋2^{𝐽{𝑈𝑃𝑎%^𝑡"𝑋𝑋𝑄𝐹𝑋𝑋/^2𝑎𝑡𝑃𝑅𝑈
∗ 𝑎7𝑎𝑀𝑎𝑍}\𝑆𝑋𝑋𝑆′𝑣𝑟2𝑋𝑉𝐾𝑋𝑋𝑉𝑉𝑂𝑋𝑋𝑋𝑋𝑋𝑋𝑋𝑋, 𝑦& >

Decryption Process For the 𝟒 × 𝟒 × 𝟒 Rubik’s Cube

Ciphertext :
𝑐𝐷6𝑇{𝐶𝑇@𝑋𝑆ℎ}𝑋𝑟𝐺#𝐼 : 𝑁𝑉𝐾𝑤@𝑎𝑎𝑀𝑋𝑄𝑋𝑋𝑋𝑋2^{𝐽{𝑈𝑃𝑎%^𝑡"𝑋𝑋𝑄𝐹𝑋𝑋/^2𝑎𝑡𝑃𝑅𝑈
∗ 𝑎7𝑎𝑀𝑎𝑍}\𝑆𝑋𝑋𝑆′𝑣𝑟2𝑋𝑉𝐾𝑋𝑋𝑉𝑉𝑂𝑋𝑋𝑋𝑋𝑋𝑋𝑋𝑋, 𝑦& >

289
Key : 𝑅 − 𝐿′ − 𝑈2 − 𝐷 − 𝐹 − 𝐵2 − 𝑈′
Key inverse : 𝑈 − 𝐵2 − 𝐹 ′ − 𝐷′ − 𝑈2 − 𝐿 − 𝑅′

Figure 11. Decryption result of the 4 × 4 × 4 Rubik's Cube

Based on the the 4 × 4 × 4 Rubik's Cube decryption process, the following plaintext is
obtained:
#𝑃^\𝑆𝑇ℎ𝑆’𝐶𝑆2𝑄𝑦&/𝐹𝑡 ∗ 𝑂𝑗𝑎𝐾𝑍𝑎𝑀𝑤}”}@𝑄𝑎𝐾𝑉𝑎6𝑈^𝐺𝐷{%𝑟, 7𝑎
> 𝑇𝑎𝑉^^𝑎𝑈𝐼22𝑅: 𝑀𝑉𝑉𝑁𝑐𝑃𝑡{{𝑟𝑣@

Vigenere Cipher
The Vigenere Cipher decryption process is almost the same as the encryption process, using the
Matematika_2018 key.
Ciphertext and keys are substituted into numbers based on the values in the American Standard
Code for Information Interchange (ASCII) table which can be seen in Table 3 below.
Ciphertext :
#𝑃^\𝑆𝑇ℎ𝑆’𝐶𝑆2𝑄𝑦&/𝐹𝑡 ∗ 𝑂𝑗𝑎𝐾𝑍𝑎𝑀𝑤}”}@𝑄𝑎𝐾𝑉𝑎6𝑈^𝐺𝐷{%𝑟, 7𝑎
> 𝑇𝑎𝑉^^𝑎𝑈𝐼22𝑅: 𝑀𝑉𝑉𝑁𝑐𝑃𝑡{{𝑟𝑣@
Key : Matematika_2018
Table 3. ASCII Symbols and Character Convertion
𝑪𝒊 # P ^ \ S T h S ‘ C
Nilai ASCII 35 80 94 92 83 84 104 83 96 67
𝑲𝒊 M a T e m A t i k a
Nilai ASCII 77 97 116 101 109 97 116 105 107 97
𝑪𝒊 S 2 Q Y & / F t * O
Nilai ASCII 83 50 81 121 38 47 70 116 42 79
𝑲𝒊 _ 2 0 1 8 M a t e m
Nilai ASCII 95 50 48 49 56 77 97 116 101 109
𝑪𝒊 J A K Z a M w } “ }
Nilai ASCII 74 97 75 90 97 77 119 125 34 125
𝑲𝒊 a t I k a _ 2 0 1 8
Nilai ASCII 97 116 105 107 97 95 50 48 49 56
𝑪𝒊 @ Q A K V a 6 U ^ G
Nilai ASCII 64 81 97 75 86 97 54 85 94 71
𝑲𝒊 M A T e m a t i k a

290
 Nilai ASCII 77 97 116 101 109 97 116 105 107 97
𝑪𝒊 D { % R , 7 a > T a
Nilai ASCII 68 123 37 114 44 55 97 62 84 97
𝑲𝒊 _ 2 0 1 8 M a t e m
Nilai ASCII 95 50 48 49 56 77 97 116 101 109
𝑪𝒊 V ^ ^ a U I 2 2 R :
Nilai ASCII 86 94 94 97 85 73 50 50 82 58
𝑲𝒊 a t I k a _ 2 0 1 8
Nilai ASCII 97 116 105 107 97 95 50 48 49 56
𝑪𝒊 M V V N c P t { { r
Nilai ASCII 77 86 86 78 99 80 116 123 123 114
𝑲𝒊 M a T e m a t i k a
Nilai ASCII 77 97 116 101 109 97 116 105 107 97
𝑪𝒊 v @
Nilai ASCII 118 64
𝑲𝒊 _ 2
Nilai ASCII 95 50

After being substituted, the following decryption process is carried out one by one:
𝑃𝑖 = 𝑑𝑘 ( 𝐶𝑖 ) = ( ( 𝐶𝑖 − 𝐾𝑖 ) 𝑚𝑜𝑑 95 ) + 32
𝑃1 = (( 𝐶1 − 𝐾1 ) 𝑚𝑜𝑑 95 ) + 32
= (( 35 − 77 ) 𝑚𝑜𝑑 95 ) + 32 = 85 = 𝑈
𝑃2 = (( 𝐶2 − 𝐾2 ) 𝑚𝑜𝑑 95 ) + 32
= (( 80 − 97 ) 𝑚𝑜𝑑 95 ) + 32 = 110 = 𝑛
𝑃3 = (( 𝐶3 − 𝐾3 ) 𝑚𝑜𝑑 95 ) + 32
= (( 94 − 116 ) 𝑚𝑜𝑑 95 ) + 32 = 105 = 𝑖
𝑃4 = (( 𝐶4 − 𝐾4 ) 𝑚𝑜𝑑 95 ) + 32
= (( 92 − 101 ) 𝑚𝑜𝑑 95 ) + 32 = 118 = 𝑣
𝑃5 = (( 𝐶5 − 𝐾5 ) 𝑚𝑜𝑑 95 ) + 32
= ( ( 83 − 109 ) 𝑚𝑜𝑑 95 ) + 32 = 101 = 𝑒
...
𝑃68 = (( 𝐶68 − 𝐾68 ) 𝑚𝑜𝑑 95 ) + 32
= (( 123 − 105 ) 𝑚𝑜𝑑 95 ) + 32 = 50 = 2
𝑃69 = (( 𝐶69 − 𝐾69 ) 𝑚𝑜𝑑 95 ) + 32
= (( 123 − 107 ) 𝑚𝑜𝑑 95 ) + 32 = 48 = 0
𝑃70 = (( 𝐶70 − 𝐾70 ) 𝑚𝑜𝑑 95 ) + 32
= (( 114 − 97 ) 𝑚𝑜𝑑 95 ) + 32 = 49 = 1
𝑃71 = (( 𝐶71 − 𝐾71 ) 𝑚𝑜𝑑 95 ) + 32
= (( 118 − 95 ) 𝑚𝑜𝑑 95 ) + 32 = 55 = 7
𝑃72 = (( 𝐶72 − 𝐾72 ) 𝑚𝑜𝑑 95 ) + 32
= (( 64 − 50 )𝑚𝑜𝑑 95 ) + 32 = 46 = .

Based on the Vigenere Cipher decryption process, the plaintext is recovered as follows:
Universitas Ahmad Dahlan memperoleh Akreditasi Institusi “A” pada tahun 2017.

Encryption Simulation Process Using Python Base Language, Google

colab
Python is a simple programming language. Unlike other languages that are difficult to read and
understand, Python places more emphasis on code readability to make it easier to understand
syntax. This makes Python very easy to learn both for beginners and for those who have
mastered other programming languages. Python is a high-level programming language (High-

291
Level Language). Python is a programming language that is ranked as the 5th most used
programming language in the world (Trisno, 2016).
The encryption process in Python is divided into two stages, namely encoding with the Vigenere
Cipher and the 4 x 4×4 Rubik's Cube methods. In the process of encoding the Vigenere Cipher
method in Python, the following display will appear.

Figure 12. Vigenere Cipher encryption process in Python

Figure 12 will encrypt the sentence that Ahmad Dahlan University obtained Institutional
Accreditation "A" in 2017. The encoding process begins by entering the desired process, 1 for
the encryption process and 2 for the decryption process. Then enter the desired message and
key, then the ciphertext message appears: #𝑃^\𝑆𝑇ℎ𝑆′𝐶𝑆2𝑄𝑦&/𝐹𝑡 ∗
𝑂𝑗𝑎𝐾𝑍𝑎𝑀𝑤}”}@𝑄𝑎𝐾𝑉𝑎6𝑈^𝐺𝐷{%𝑟, 7𝑎 > 𝑇𝑎𝑉^^𝑎𝑈𝐼22𝑅: 𝑀𝑉𝑉𝑁𝑐𝑃𝑡{{𝑟𝑣@ .
After the encryption process is carried out using the Vigenere Cipher method, it will then be
encrypted with a 4 × 4 × 4 Rubik's Cube. The key to be used is “𝑅 − 𝐿’ − 𝑈2 − 𝐷 − 𝐹 −
𝐵2 − 𝑈’ ”. So the display will appear as shown below:

Figure 13. 4 × 4 × 4 Rubik's Cube encryption process in Python

292
Based on the picture above, the encryption results are obtained as follows:
99 68 54 84 123 67 84 64 32 83 104 125 88 114 71 35 94 73 58 78 86 75 119 64
97 97 77 88 81 88 88 88 88 50 94 123 106 123 85 80 97 37 94 116 29 88 88 81
70 88 88 47 94 50 97 116 88 82 85 42 97 55 97 77 97 90 125 92 83 88 88 83 25
118 114 50 88 86 75 88 88 86 86 79 88 88 88 88 88 88 88 88 44 121 38 62
Then the results of the encryption are converted to ASCII characters as shown below:

Figure 14. Conversion to ASCII characters

So the encryption results are obtained as follows:
𝑐𝐷6𝑇{𝐶𝑇@𝑋𝑆ℎ}𝑋𝑟𝐺#^𝐼: 𝑁𝑉𝐾𝑤@𝑎𝑎𝑀𝑋𝑄𝑋𝑋𝑋𝑋2^{𝐽{𝑈𝑃𝑎%^𝑡"𝑋𝑋𝑄𝐹𝑋𝑋/^2𝑎𝑡𝑃𝑅𝑈
∗ 𝑎7𝑎𝑀𝑎𝑍}\𝑆𝑋𝑋𝑆′𝑣𝑟2𝑋𝑉𝐾𝑋𝑋𝑉𝑉𝑂𝑋𝑋𝑋𝑋𝑋𝑋𝑋𝑋, 𝑦& >
Decryption Process
In the decryption process, the first thing to do is to decrypt it using a 4 × 4 × 4 Rubik's Cube.
The plaintext of the second encryption is:
𝑐𝐷6𝑇{𝐶𝑇@𝑋𝑆ℎ}𝑋𝑟𝐺#^𝐼: 𝑁𝑉𝐾𝑤@𝑎𝑎𝑀𝑋𝑄𝑋𝑋𝑋𝑋2^{𝐽{𝑈𝑃𝑎%^𝑡"𝑋𝑋𝑄𝐹𝑋𝑋/^2𝑎𝑡𝑃𝑅𝑈 ∗
𝑎7𝑎𝑀𝑎𝑍}\𝑆𝑋𝑋𝑆′𝑣𝑟2𝑋𝑉𝐾𝑋𝑋𝑉𝑉𝑂𝑋𝑋𝑋𝑋𝑋𝑋𝑋𝑋, 𝑦& > .
Then the key used is the reverse of the key in the previous encryption process The following
key is obtained "𝑈 − 𝐵2 − 𝐹^′ − 𝐷 − 𝑈2 − 𝐿 − 𝑅′". The process can be seen in the following
image:

Figure 15. 4 × 4 × 4 Rubik's Cube decryption process in Python

293
Based on Figure 15, the results of the decription are as follows:
99 38 121 92 50 84 104 39 83 67 83 83 81 94 80 47 81 88 123 34 125 119 77 97
90 75 97 74 79 42 116 70 62 73 58 44 54 85 94 71 123 37 114 97 55 97 97 88
86 86 77 86 82 50 50 75 85 97 94 88 86 97 88 88 80 116 84 88 88 88 64 64 118
114 125 123 88 88 35 94 88 88 78 88 88 88 88 88 88 88 88 88 88 88 88
Then the results of the decryption are converted to ASCII characters as shown below:

Figure 16. Conversion to ASCII characters

After the decryption process is carried out using the 4 × 4 × 4, Rubik's Cube, then the
Vigenere Cipher method is carried out as shown in the following image:

Figure 17. Vigenere Cipher decryption process in Python

Based on Figure 17 we get the sentence

Universitas Ahmad Dahlan memperoleh Akreditasi Institusi “A” tahun 2017.

Limitation and Suggestion for Further Research

Further research is expected to improve existing deficiencies and is expected to further develop
what has been done in this research. For this reason, further research is recommended to develop
a document file security system for all types of documents with a security system using another
cryptographic algorithm or the latest which is better than the Vigenere Cipher and
4 × 4 × 4 Rubik's Cube cryptography, as well as the development of a Python program by
integrating the results of the Vigenere Cipher with the 4 × 4 × 4 Rubik's Cube.

CONCLUSIONS
Based on the discussion in this study, it can be concluded that the security in the encryption
process lies in the length of the Vigenere Cipher key character and the notation of the 4 × 4 × 4
Rubik's Cube movement. The encryption process using the Vigenere Cipher and 4 × 4 × 4
Rubik's Cube method produces a more random and complicated ciphertext. The use of two
types of ciphers allows the security of messages to be doubled.

294
 The encryption technique used using Vigenere Cipher with ASCII substitution
modification is performed by using the equation 𝐶𝑖 = 𝑒𝑘 ( 𝑃𝑖 ) = (( 𝐶𝑖 − 𝐾𝑖 −
64) 𝑚𝑜𝑑 95 ) + 32 encoding results then re-encoded using Rubik's Cube 4 × 4 × 4. The
message process uses 4 × 4 × 4 Rubik's Cube decryption followed by Vigenere Cipher
decryption using the equation 𝑃𝑖 = 𝑑𝑘 ( 𝐶𝑖 ) = (( 𝐶𝑖 − 𝐾𝑖 ) 𝑚𝑜𝑑 95 ) + 32.
In this study, the encoding process manually takes a very long time. But with the help of
Python, we can minimize the steps and errors made especially in the encoding process with the
4 × 4 × 4 Rubik's Cube which uses a lot of rotation on the key.

ACKNOWLEDGMENT
Authors thank to all parties who support this research. This research is supported by the Institute
of Research and Community Service of Universitas Ahmad Dahlan under number grant: PD-
158/SP3/LPPM-UAD/VIII/2023 and the manuscript has been completed when the
corresponding author visits the University of Toronto in Fall 2023.

AUTHOR CONTRIBUTIONS STATEMENT

The author's contribution is to collect an algorithm in a cryptographic system which combines
a text message security system through the Vigenere Cipher and the 4 × 4 × 4 Rubik's Cube
and implements it through the Python online base language software, google colab.

REFERENCES
Ahamed, B. B., & Krishnamoorthy, M. (2020). SMS Encryption and Decryption Using
Modified Vigenere Cipher Algorithm, Journal of the Operations Research Society of
China, 10, 835-848. https://doi.org/10.1007/s40305-020-00320-x
Al-Meer, A., & Al-Kuwari, S. (2023). Physical unclonable functions (PUF) for IoT
devices. ACM Computing Surveys, 55(14s), 1-31. https://doi.org/10.1145/3591464
Amrulloh, A., & Ujianto, E. I. H. (2019). Kriptografi Simetris Menggunakan Algoritma
Vigenere Cipher. CoreIT, 5(2), 71–77.
Arifin, S., Muktyas, I. B., & Prasetyo, P. W. (2021). Unimodular matrix and bernoulli map on
text encryption algorithm using python. Al-Jabar: Jurnal Pendidikan Matematika, 12(2),
447–455. http://dx.doi.org/10.24042/ajpm.v12i2.10469
Aulia, R., Zakir, A., & Zulhafiz, M. (2019). Penerapan Algoritma One Time Pad & Linear
Congruential Generator Untuk Keamanan Pesan Teks. Jurnal Nasional Informatika Dan
Ilmu Komputer, 4(1), 37-41. http://dx.doi.org/10.30743/infotekjar.v4i1.1590
Baldoni, M. W., Ciliberto, C., & Cattaneo G. M. P (2008). Elementary Number Theory,
Cryptography and Codes. Springer. https://doi.org/10.1007/978-3-540-69200-3
Bingö l, S. (2022). The changes in Ottoman diplomatic cryptography and its methods during the
19th century (1811–1877), Cryptologia 47(6), 541-569.
https://doi.org/10.1080/01611194.2022.2092916
Boussif, M., Aloui, N., & Cherif, A. (2020). Securing DICOM images by a new encryption
algorithm using Arnold transform and Vigenère cipher, IET Image Processing, 14(6),
1209-1216. https://doi.org/10.1049/iet-ipr.2019.0042
Budiman, A., & Paradise. (2019). Modification of Vigenere Algorithm and One Time Pad
Using Rivest Code 6 (RC6) Key Expansion. Compiler, 8(2), 149-155.
http://dx.doi.org/10.28989/compiler.v8i2.481
Buser, M., Dowsley, R., Esgin, M., Gritti, C., Kermanshahi, S. K., Kuchta, V., Legrov, J., Liu,
J., Phan, R., Sakzad, A., Steinfeld, R., & Yu, J. (2023). A Survey on Exotic Signatures for

295
 Post-quantum Blockchain: Challenges and Research Directions. ACM Computing Surveys,
55 (12), 251:1-32. https://doi.org/10.1145/3572771
Chiu, R., Castañeda, C. E., Orozco-Lopez, O., & Mancilla, L. (2023). Images cipher based on
convolution with chaotic maps and retrieving using. Optics and Laser Technology, 167,
109680. https://doi.org/10.1016/j.optlastec.2023.109680
Delfs, H., & Knebl, H. (2007). Introduction to Cryptography: Principles and Applications
(Information Security and Cryptography (Second Edition). Springer.
Dey, J., & Dutta, R. (2023). Progress inMultivariate Cryptography: Systematic Review,
Challenges, and Research Directions. ACM Computing Surveys, 55(12), 1-34.
https://doi.org/10.1145/3571071
Fatonah, S., Yulandari, A., & Ariyus, D. (2016). Analisis Penerapan Modifikasi Algoritma
Vigenere Cipher, Caesar Cipher, Vernam Cipher dan Hill Cipher Untuk Penyisipan Pesan
Dalam Gambar. Voice of Informatic, 8(2), 19–30.
http://dx.doi.org/10.30872/jim.v15i2.3746
Grošek, O., Antal, E., & Fabšič, T. (2019). Remarks on breaking the Vigenère autokey cipher.
Cryptologia, 43(6), 486-496. http://dx.doi.org/10.1080/01611194.2019.1596997
Huang, B., Gao, J., & Li, X. (2023). Efficient lattice‑based revocable attribute‑based encryption
against decryption key exposure for cloud file sharing. Journal of Cloud Computing, 12(1),
1–15. https://doi.org/10.1186/s13677-023-00414-w
Hoerudin, M., & Pratama, E. K. D. (2020). Steganografi Teks di Audio Menggunakan Vigenere
Cipher. January.
Irawan, M. D. (2017). Implementasi Kriptografi Vigenere Cipher Dengan PHP. Jurnal
Teknologi Informasi 1(1), 11–21. http://dx.doi.org/10.36294/jurti.v1i1.21
Jaithunbi, A. K., Sabena, S., & Sairamesh, L. (2022). Preservation of Data Integrity in Public
Cloud Using Enhanced Vigenere Cipher Based Obfuscation. Wireless Personal
Communications, 129, 271-284. http://dx.doi.org/10.1007/s11277-022-10097-2
Liwandouw, V. B., & Wowor, A. D. (2016). Kombinasi Algoritma Rubik, CPSRNG, Chaos,
dan S-Box Fungsi Linier Dalam Perancangan Kriptografi Cipher Blok. SESINDO 2015,
2015. 207-214.
Luengo, E. A., Olivares, B. A., Villalba, L. V. G., & Hernandez-Castro, J. (2023). Further
analysis of the statistical independence of the NIST SP statistical independence of the
NIST SP. Applied Mathematics and Computation, 459: 128222.
http://dx.doi.org/10.1016/j.amc.2023.128222
Ma’rifah, S. H. (2022). Implementasi Algoritma Rubik’s Cube dan Algoritma Rivest-Shamir-
Adleman (RSA) pada Pengamanan Citra DIgital Iris Mata (Undergraduate Theses).
Universitas Islam Negeri Maulana Malik Ibrahim
Minarni, M., & Redha, R. (2020). Implementasi Least Significant Bit (LSB) dan Algoritma
Vigenere Cipher Pada Audio Steganografi. Jurnal Sains dan Teknologi, 20(2), 168-174.
http://dx.doi.org/10.36275/stsp.v20i2.268
Moosa, H., Ali, M., Alaswad, H., Elmedany, W., & Balakrishna, C. (2023). A combined
Blockchain and zero-knowledge model for healthcare B2B and B2C data sharing, Arab
Journal of Basic and Applied Sciences, 30(1), 179-196.
https://doi.org/10.1080/25765299.2023.2188701
Nana, & Prasetyo, P. W. (2021). An implementation of Hill Cipher and 3× 3 × 3 rubik ’ s cube
to enhance communication security. Bulletin of Applied Mathematics and Mathematics
Education, 1(2), 75–92. https://doi.org/10.12928/bamme.v1i2.4252
Padhye, S., Sahu., R. A., & Saraswat, V. (2018). Introduction to Cryptography. CRC Press
Park, S., Kim, J., Cho, K., & Yum D. H. (2020). Finding the key length of a Vigenère cipher:
How to improve the twist algorithm, Cryptologia, 44(3), 197-204.
http://dx.doi.org/10.1080/01611194.2019.1657202

296
Permanasari, Y. (2017). Kriptografi Klasik Monoalphabetic. Jurnal Teori dan Terapan
Matematika, 16(1), 7–10. http://dx.doi.org/10.29313/jmtm.v16i1.2543
Pirandola, S., Andersen, U.L., Banchi, L., Berta, M., Bunanda, D., Colbeck, R., Englund, D.,
Gehring. T., Lupo, C., Attaviani, C., Pereira, J.L., Razavi, M., Shaari. S., Tommamichel.
M., Usenko, V. C., Vallone, G., Villoresi, P., & Walden, P. (2020). Advances in quantum
cryptography. Advances in Optics and Photonics, 12(4), 1012-1236.
http://dx.doi.org/10.1364/aop.361502
Pocher, N., Zichici, M., Merizzi, F., Shafiq. M. Z., & Ferretti, S. (2023). Detecting anomalous
cryptocurrency transactions: An AML/CFT application of machine learning‑based
forensics, Electronic Markets, 33(1), 37. https://doi.org/10.1007/s12525-023-00654-3
Rehman, M. U., Shafique, A., & Usman, A. B. (2023). Securing Medical Information
Transmission Between IoT Devices: An Innovative Hybrid Encryption Scheme Based on
Quantum Walk, DNA Encoding, and Chaos. Internet of Things, 24, 100891.
http://dx.doi.org/10.1016/j.iot.2023.100891
Rupa, C., Greshmant., Shah, M. S. (2023). Novel secure data protection scheme using Martino
homomorphic encryption, Journal of Cloud Computing, 12(1), 47.
http://dx.doi.org/10.1186/s13677-023-00425-7
Sumandri. (2017). Studi Model Algoritma Kriptografi Klasik dan Modern. Prosiding Seminar
Matematika Dan Pendidikan Matematika UNY 2017, 265–272.
http://dx.doi.org/10.29313/jmtm.v16i1.2543
Syahib, M. I., Riadi, I., & Umar, R. (2017). Analisis Forensik Digital Aplikasi Beetalk Untuk
Penanganan. Cybercrime Menggunakan Metode NIST. Prosiding Semnasif 2017, 1(1),
134–139. http://dx.doi.org/10.30645/j-sakti.v4i1.196
Tampubolon, A. (2021). Implementasi Kombinasi Algoritma RSA dan Algoritma DES Pada
Aplikasi Pengaman Pesan Teks. Jurnal SAINTIKOM (Jurnal Sains Manajemen
Informatika Dan Komputer), 20(1), 38-43. http://dx.doi.org/10.53513/jis.v20i1.2598
Teranishi, K., & Kogiso, K. (2023). Optimal security parameter for encrypted control systems
against eavesdropper and malicious server. SICE Journal of Control, Measurement, and
System Integration, 16(1), 203-214. http://dx.doi.org/10.1080/18824889.2023.2215691
Trisno, I. B. (2016) Belajar Pemrograman Sulit? Coba Python. In: Buku Ajar. Ubahara
Manajemen Press Surabaya.
Uniyal, N., Dobhal, G., Rawat, A., & Sikander. (2021). A Novel Encryption Approach Based
on Vigenère Cipher for Secure Data Communication, Wireless Personal Communications,
119, 1577–1587. http://dx.doi.org/10.1007/s11277-021-08295-5
Ye, C. Q., Li, J., Chen, X. B., Hou, Y., & Wang, Z. (2023). Security and application of semi-
quantum key distribution protocol for users with different quantum capabilities, EPJ
Quantum Technology, 10:21. http://dx.doi.org/10.1140/epjqt/s40507-023-00180-3
Younus, Z. S., & Hussain, M. K. (2022). Image steganography using exploiting modification
direction for compressed encrypted data, Journal of King Saud University-Computer and
Information Sciences, 34, 2951–2963. http://dx.doi.org/10.1016/j.jksuci.2019.04.008
Yudanto, Y. S., & Suartana, I. M. (2022). Analisis Kekuatan Enkripsi Data Pada Citra Digital
Menggunakan Metode Rubiks Cube, Journal of Informatics and Computer Science
(JINACS), 3(4), 557–563. http://dx.doi.org/10.26740/jinacs.v3n04.p557-563

297