Absolute Data Security Scheme: An Advanced Approach towards

Data Security
Ritu Shukla∗ Dinesh Goyal
Rajasthan Technical University, Poornima Institute of Rajasthan Technical University, Poornima Institute of
Engineering & Technology Engineering & Technology
[email protected] [email protected]

Shruti Thapar Rohit Chhabra

Rajasthan Technical University, Poornima Institute of Rajasthan Technical University, Jaipur Engineering
Engineering & Technology College & Research Centre
[email protected] [email protected]

ABSTRACT ACM Reference Format:

With the exponential increase in the applications of digitalization, Ritu Shukla, Dinesh Goyal, Shruti Thapar, and Rohit Chhabra. 2022. Abso-
lute Data Security Scheme: An Advanced Approach towards Data Security.
the risk of data breach and theft is also rising tremendously. The
In International Conference on Information Management & Machine Intelli-
abrupt increase in the use of digital money, especially after de- gence (ICIMMI 2022), December 23, 24, 2022, Jaipur, India. ACM, New York,
monetization and then during Corona pandemic, has developed NY, USA, 6 pages. https://doi.org/10.1145/3590837.3590953
dependencies on the online transactions via different digital pay-
ments and financial service providers. In this it has become chal- 1 INTRODUCTION
lenging to keep the information including credentials, One Time
Contrary to the fundamental purpose of security for which it was
Password etc. secure. In the course of time, number of blooming
introduced to conceal both diplomatic and military confidential
techniques are introduced which secure the information whether
information from the adversary, these days it has been designed and
it is in the network or stored at secured architecture. But the soul
adopted to offer an effectual means of securing and protecting data.
of these techniques is the complex algorithms that keep the data
Security has become an ongoing activity that is deeply embedded
confidential from the attackers/ unintended users. In this paper we
in all the applications. A small text message sent from one end,
are proposing a robust scheme named as Absolute Data Security
uses cryptographic techniques to keep the message confidential
Scheme which can be useful for securing applications commonly
and original, till it reaches to the intended person [2].
used in modern environment. A customized version of International
Whenever one talks about modern cryptography, it normally
Data Encryption Algorithm (IDEA) algorithm is used in combina-
points to the cryptosystem because it composed of the study and
tion with message digest algorithm to provide better security. It
application of keeping the information hidden by using the keys,
is a combination which preserves the confidentiality as well as
which are related to the web based applications, transactions,
integrity of the data. This scheme is a combination of encryption;
ATM’s, e-commerce, computer passwords etc.
decryption and message digest techniques which contribute in the
All over the history, however, there has been one central prob-
secure transmission of the data.
lem limiting widespread use of cryptography and this quandary
is key management. In the cryptography, the term key refers to
CCS CONCEPTS a numeric value which is used by a cryptographic algorithm to
• B7; Security and privacy → Database and storage security. modify information to make that protected and visible only secured
information to individuals who have the subsequent key to detect
KEYWORDS the original message. Therefore, the term key management refers
Security, CDEA, MD5, Cryptography, encryption, decryption, IDEA, to the secure organization of keys to avail them to the users where
ATM and when they are required [6].
∗ Corresponding author The message/information hiding systems can be done in three
aspects i.e. security, capacity and robustness. Security explains the
Permission to make digital or hard copies of all or part of this work for personal or
classroom use is granted without fee provided that copies are not made or distributed ability of any individual to detect secreted information; capacity
for profit or commercial advantage and that copies bear this notice and the full citation tells us the amount of information that can be secreted and the
on the first page. Copyrights for components of this work owned by others than the robustness defines the struggle to modifications of the cover content
author(s) must be honored. Abstracting with credit is permitted. To copy otherwise, or
republish, to post on servers or to redistribute to lists, requires prior specific permission before concealed information is destroyed [4].
and/or a fee. Request permissions from [email protected]. The major advancement in the field of cryptography is the in-
ICIMMI 2022, December 23, 24, 2022, Jaipur, India vention of new technique termed as public-key cryptography. The
© 2022 Copyright held by the owner/author(s). Publication rights licensed to ACM.
ACM ISBN 978-1-4503-9993-7/22/12. . . $15.00 prime notion of public-key cryptography is to resolve the problem
https://doi.org/10.1145/3590837.3590953 of sharing the key by introducing the idea of using more than one
key in the whole process. In the technique of public-key cryptog-
raphy, the key comes in a pair of two; i.e. public & private key
ICIMMI 2022, December 23, 24, 2022, Jaipur, India Ritu Shukla et al.

Figure 1: Components of Cryptography

Table 1: – Selection of Sub- keys

BIT POSITIONS SUB- KEYS

Round 1 (K1 to K6) (6-keys x 16 bits per sub-key);
1 - 96

Round 5 (K25 to K30);

And output transformation (K49 to K52)
97 - 128 & 1 - 64 (of shifted key) Round 2 (K7 to K12);
Round 6 (K31 to K36)
65 - 128 & 1 – 32 (of shifted key) Round 3 (K13 to K18);
Round 7 (K37 to K42)
33 - 128 Round 4 (K19 to K24)
Round 8 (K43 to K48)

[12]. The public key from the pair can be given and shared publicly • Bitwise XOR
without compromising and the private key from the same pair has • Addition Modulo (216 )
to be kept secret by its holder. Any process performed by using • Multiplication Modulo (216 +1)
public key can be undone only by using its corresponding private
key. 2.1 Generation of Sub-Keys
A key of 128-bits is partitioned into 52 sub keys, each of 16-bits.
2 LITERATURE REVIEW Six sub keys, K1 n to K6 n , are used in the nth iteration and four sub
IDEA is a secure symmetric-key cryptographic algorithm. It gener- keys, K47 to K52 , are used in the final transformation [4].
ates a block cipher. It is a block-oriented cryptographic algorithm. These sub-keys are used in the fourteen steps which are repeated
The algorithm is applied on the plain text block of particular size of 8 times in the form of 8-rounds. These steps are comprised of
64-bits and uses key of 128-bits. This extended combination makes operations – modulo addition, modulo multiplication and XOR.
it resistant to the brute force attacks. IDEA is based on a basic func- Below are the fourteen steps which make a complete round [1]:
tion which is comprised of number of steps and these are repeated -
8 times [3]. • P1 & 1st sub-key K1 are multiplied.
The block of 64 bits of plain text is divided into 4 numbers of • P2 & 2nd sub-key K2 are added.
sub-blocks; each sub-block of 16-bits is given as input to the first • P3 & 3rd sub-key K3 are added.
iteration. The result of the first round is given as input to the next • P4 & 4th sub-key K4 are multiplied.
round. After the last iteration i.e. 8th iteration, its result is passed • Results of steps 1 & 3 are Bitwise XOR.
on to the final transformation phase that generates a cipher text • Results of steps 2 & 4 are Bitwise XOR.
block of 64-bits [3]. • Results of step 5 & 5th sub-key K5 are multiplied.
The mathematical operations used in the algorithm are as fol- • Results of steps 6 & 7 are added.
lows: • Results of step 8 & 6th sub-key K6 are multiplied.
Absolute Data Security Scheme: An Advanced Approach towards Data Security ICIMMI 2022, December 23, 24, 2022, Jaipur, India

Figure 2: Block diagram of Customized IDEA

• Results of steps 7 & 9 are added. 3 PROPOSED WORK

• Results of steps 1 & 9 are Bitwise XOR. Absolute data security scheme is completely secure as compared to
• Results of steps 3 & 9 are Bitwise XOR. IDEA as this scheme combines the new version of IDEA (C-IDEA)
• Results of steps 2 & 10 are Bitwise XOR. and Message Digest 5 (hash function) to provide an algorithm which
• Results of steps 4 & 10 are Bitwise XOR. facilitates not just the confidentiality but also the integrity of the
The steps to be carried out in Output Transformation: - message.
• X1 & the 1st sub-key is multiplied. The complete working of the scheme is as follows:
• X2 & the 2nd sub-key is added. At the sender’s end, the message which is to be transmitted
• X3 & the 3rd sub-key is added. is fragmented into blocks of 64 bits. After this, two algorithms are
• X4 & the 4th sub-key is multiplied [1]. applied on the plain text block.
[Singh et. al.] , IJAREEIE International Journal of Advanced • MD5 – This algorithm calculates the hash value of the plain-
Research in Electrical, Electronics & Instrumentation Engineering, text block (M1) which checks the integrity of the message.
Issue 2, Vol.2, ISSN: 2320-3765. • Customized International Data Encryption Algorithm – This
The paper explored the presence of weak keys in IDEA and a new algorithm in combination with the key and number of rounds
attack on the 6th round has also been detected. In order to solve this chosen by the user, converts the plain text into the cipher
problem, the author projected to change the size of key from 128 bits text. The encryption process takes place.
to 256 bits which in turn makes it more complex as well as less prone The cipher-text block and number of rounds appended to hash
to the attacks. This way will reduce the possibility of other kinds of value are combined and transmitted to the other end.
attack when 104 sub-keys are involved. The algorithm is referred At the other end, receiver receives the complete block. The same
as S-IDEA (Secure International Data Encryption Algorithm). algorithms are performed on the block. The cipher text block is
[Ritu et al.], International Journal of Scientific& Engineering decrypted using C-IDEA and the number of rounds appended to
Research, Volume 5, Issue 9, 192 ISSN 2229-5518, presented cus- the hash value. The hash value of the block (M2) obtained after the
tomized data encryption algorithm (CDEA) that can improve the decryption process is calculated using MD5 algorithm [1].
security by keeping 2 attributes secret. In conventional IDEA, key If M1 matches to M2 i.e. M1=M2, then only the plain text will
was the only attribute which was kept secret and shared via secure be visible at the receiver end. In case of any kind of intentional
channel. The two attributes that are kept secretly are: key and the or unintentional modifications in the original text are found, the
number of rounds. In this way, along with the key, the attacker tampered message will not be visible at the receiver end.
has to work to find the number of rounds to breach the encrypted
message. 4 RESULT
In Customized IDEA, the number of rounds to be applied and the The working, security and the complexity aspects of CDEA and
key are kept secret/ hidden and the plain/original text is transmitted ADS Scheme are discussed in this section. It includes experimental
in the encrypted form known as the cipher text. Earlier the attacker results of ADS Scheme.
struggles to find only the key but CDEA makes it more complex by
working on two unknown values which improves the security and 4.1 Example of ADS Scheme
make it dynamic as well [1]. • The Input message is as follows: hello world this is new in
computer Science
ICIMMI 2022, December 23, 24, 2022, Jaipur, India Ritu Shukla et al.

Figure 3: Sender-side method (ADSS)

Table 2: Key matrix for encryption

E1 1 E1 2 E1 3 E1 4 E1 5 E1 6
E2 1 E2 2 E2 3 E2 4 E2 5 E2 6
E3 1 E3 2 E3 3 E3 4 E3 5 E3 6
E4 1 E4 2 E4 3 E4 4 E4 5 E4 6
E5 1 E5 2 E5 3 E5 4 E5 5 E5 6
E6 1 E6 2 E6 3 E6 4 E6 5 E6 6
E7 1 E7 2 E7 3 E7 4 E7 5 E7 6
E8 1 E8 2 E8 3 E8 4 E8 5 E8 6
E9 1 E9 2 E9 3 E9 4

The cipher text obtained by CDEA [1]: ?>?81/2&???>- M2 will be compared, if both the strings match completely, then
?{ÙÆ$?SKaÞ?v?hWÑdm?V?Þ¦u¸1 V?Þ¦u¸1 lAF ×.¦?å only the text generated will be displayed at the receiver’s end.
MD5 applied on this file and generated a md5 string code (m1)
of 32 byte 4.2 Cipher Text
i.e. 831f85c91b87ea4ae86d545f2d72395f “?>?81⁄2&???>-?{ÙÆ$?SKaÞ?v?hWÑdm?V?Þ¦u¸1 V?Þ¦u¸1 lAF×.¦?å”
This encrypted file will be transferred to another end with the
help of network along with 32 byte MD5 code. The original message after decryption
On the other end, first cipher text is decrypted using the same “hello world this is new in computer Science”
algorithm and the text obtained must be the desired one which is
original. In the decryption process, the same algorithm will be used, 5 CONCLUSION
the key will be same but its matrix will be changed. After this, MD5
The algorithm discussed above is capable to work for 4 numbers of
will be applied on the text, let it be M2 is generated. Now, M1 and
rounds.
Absolute Data Security Scheme: An Advanced Approach towards Data Security ICIMMI 2022, December 23, 24, 2022, Jaipur, India

Figure 4: Receiver-side method (ADSS)

Table 3: Key matrix for Decryption

E91 E92 E93 E94 E85 E86

E81 E82 E83 E84 E75 E76
E71 E72 E73 E74 E65 E66
E61 E62 E63 E64 E55 E56
E51 E52 E53 E54 E45 E46
E41 E42 E43 E44 E35 E36
E31 E32 E33 E34 E25 E26
E21 E22 E23 E24 E15 E16
E11 E12 E13 E14
(Note: Radix/base denotes number of rounds and power specifies the number of key)

Figure 6: Condition Integrity Check

Figure 5: Condition1: Integrity Check
6 FUTURE SCOPE
It can be applied on 16 bits block of the plain/original text which An attempt has been made to enhance the security of the message
is equal to 32 bits long key (4 characters) and two characters [6]. communicated over the channel by combining CDEA Algorithm &
ICIMMI 2022, December 23, 24, 2022, Jaipur, India Ritu Shukla et al.

Figure 7: Block diagram for proposed scheme

Message Digest for Encryption and authentication of data respec- [5] Anoop MS Public key cryptography – Applications Algorithms and Mathematical
tively. In future, the message digest algorithm used here is MD5, Explanations. India: Tata Elxsi. http://www.dkrypy.com/home/pkcs.
[6] Research Paper- A simplified IDEA Algorithm by Nick Hoffman.
in future researchers can also use SHA-1 or SHA-512 which will [7] Rajat Goel, Ripu R. Sinha, O.P. Rishi “Novel data Encryption Algorithm”, IJCSI,
give a Message digest of bigger length & thus CRC checksum will ISSN: 1694-0814, Pg.561 to 565.
[8] Harivans Pratap Singh, Shweta Verma, Shailendra Mishra, “Secure- International
be better. The work proposed above is for text files, researchers Data Encryption Algorithm”, IJAREEIE, ISSN: 2320-3765, Pg.780 to 791.
can attempt the same for other data formats like images, audio [9] Sandipan Basu- IDEA-a typical illustration, JGRCS, ISSN-2229-37IX, Volume 2, 7.
or video or any other binary files. Researcher can also work for [10] Pontjho M. Mokhonoana, Martin S. Olivier- “APPLICATION OF MESSAGE DI-
GESTS FOR THE VERIFICATION OF LOGICAL FORENSIC DATA”.
optimization of the proposed technique for better utilization in real [11] L. Agilandeeswari, K. Brindha, Stiffy Sunny, K. Muralibabu- “An novel architec-
time applications. ture for information hiding using HMAC-MD5, International Journal of Engi-
neering and Technology”, 2 (2) 134-139.
[12] Kamaldeep Sharma, Ashish Kumar – “Study and Performance Analysis of IDEA”,
REFERENCES Vol.2, Issue 5, May, ISSN: 2277 128X.
[1] Ritu Shukla “Customized Data Encryption Algorithm” International Journal [13] Chang H.S.,” International Data Encryption Algorithm” CS-627-1 fall.
of Scientific & Engineering Research, Volume 5, Issue 9, September 192ISSN [14] X.Lai and James L. Massey, “A proposal for A New Block Encryption Standard”
2229-5518 Advances in Cryptology EUROCRYPTO’90, Springer-Verlag Berli.
[2] William Stallings, “Cryptography and Network Security”, ISBN 81-317-0366-5, [15] Shannon, Claude, Communication Theory of Secrecy Systems, Bell Systems
Pearson Education, Second Edition, pgs. 29-31, 42-94, 121-144,253-297. Technical Journal 28(4):656-715.
[3] R.Rivest, A.Shamir and L.Adleman, “A Method for Obtaining Digital signatures [16] Mao-Ying Wang, Chih- Pin Su, Department of Electrical Engineering, National
and- Public-key Cryptosystems”, Communications of the ACM, 21 (2), pgs 120- Tsing Hua University, Taiwan-30013.
126. [17] L. Agilandeeswari, K. Brindha, Stiffy Sunny, K. Murali babu, “An Novel Architec-
[4] Atul Kahate, “Cryptography and Network security”, ISBN-10:0-07-064823-9, ture for Information Hiding using HMAC- MD5”
TATA McGraw-Hill Publishing Company Limited, India, Second Edition, pgs [18] Blum M. and Goldwasser S., “An efficient probabilistic public-key encryption
38-62, 152-165, 205-240. scheme which hides all partia information,” Advances in Cryptology-CRYPTO’84,
Lecture notes in computer science (Springer-Verlag), pp.289-299.