Proceedings of the 5th International Conference on Smart Systems and Inventive Technology (ICSSIT 2023)

IEEE Xplore Part Number: CFP23P17-ART; ISBN: 978-1-6654-7467-2

A Key Generation Algorithm for Cryptographic

Algorithms to Improve Key Complexity and
2023 5th International Conference on Smart Systems and Inventive Technology (ICSSIT) | 978-1-6654-7467-2/23/$31.00 ©2023 IEEE | DOI: 10.1109/ICSSIT55814.2023.10060906

Efficiency
Mr.B.Umapathy Dr.G.Kalpana
Research Scholar, Department of Computer Science, Associate professor & Head, Department of Computer
College of Science and Humanities, Science, College of Science and Humanities,
SRM Institute of Science and Technology, Kattankulathur, SRM Institute of Science and Technology, Kattankulathur,
Chennai, Tamil Nadu- 603203, India. Chennai, Tamil Nadu- 603203, India.
[email protected] [email protected]

Abstract: In the recent days people use a variety of The energy costs of asymmetric and hash
online software applications to move data from one algorithms are the highest and lowest, respectively.
location to another. To secure personal data from The energy cost of asymmetric algorithms depends
hackers, software or applications use cryptographic- on the key size, whereas those of symmetric
based algorithms. The encryption and decryption
algorithms are not significantly impacted by key size.
processes are the foundation of the cryptographic
algorithm, which will be carried out with the help of a The energy consumption of a symmetric algorithm
key. Cryptographic algorithms employ automatic key depends on both the cost of bulk data encryption and
generation that starts with the user's password, whereas decryption as well as the cost of key setup. A
another generating key directly interprets the password. cryptographic algorithm's level of security can be
A symmetric algorithm uses the same key for both traded off for energy savings [19].
encryption and decryption. For key generation,
symmetric algorithms use a second or subsidiary Cryptology is used in the cloud storage
method. The password is protected using this key service industry to provide security, integrity,
generation process from various key attacks. The key reliability, and other benefits. Cryptography and
generation algorithm functions as an interpreter,
cryptanalysis are the two subfields of cryptology.
transforming a password from a human-readable form
to a machine-readable form. An increase in Numerous cryptographic algorithms are being
permutations and combinations helps to protect the developed to safeguard data, and the cryptanalysis
password; additional characteristics are being added to process is used to determine an algorithm's
the algorithm. To get around the restricted key bit size, complexity so that it might be improved. The key is
this paper proposed the KEY SECURE-KEY (KS- crucial to cryptanalysis and cryptography. The
KEY) algorithm. However, increasing the key size is not cryptographic algorithm makes use of the key to
a suitable way to encrypt data because multi-core transform plain text into cipher text and to boost
processors in modern microprocessors are significantly complexity to prevent brute-force attacks. A separate
increasing processing speed.
algorithm almost completely completes the key
Keywords: Cloud Storage Services, Cryptography, creation process [1][6].
Security, Key Generation, Encryption Key, Symmetric Key
II. RELATED WORKS
I. INTRODUCTION
The Advanced Encryption Standard (AES)
Cryptographic methodology is successful, uses the XOR operation, byte substitution operation,
they eventually discovered some threats that were and circular rotation operation to process the key
entirely based on keys. The key generation technique generation's (128,192,256) bits. Whenever encryption
is constantly improved upon or modified to provide a and decryption use a hexadecimal conversion
high level of security until the cryptographic process, the AES character is converted to a
algorithm fails to avoid the situation described in hexadecimal value [3]. By throwing away every
these threats. Therefore, key creation is crucial to eighth bit of the initial key, the Data Encryption
modern encryption and decryption techniques. In Standard (DES) key generation process creates a 64-
general, key generation algorithms received less bit key that is then divided into two 28-bit pieces. Bit
attention in cryptography than the encryption and shifting and byte substitution make up the DES
decryption processes [2][7]. operation [4]. Key generation for the Blowfish
algorithm ranges from 32 to 448 bits. This flexibility

978-1-6654-7467-2/23/$31.00 ©2023 IEEE 647

Authorized licensed use limited to: Andhra University College of Engineering. Downloaded on November 20,2024 at 08:06:02 UTC from IEEE Xplore. Restrictions apply.
 Proceedings of the 5th International Conference on Smart Systems and Inventive Technology (ICSSIT 2023)
IEEE Xplore Part Number: CFP23P17-ART; ISBN: 978-1-6654-7467-2

is making cryptanalysis using XOR operations more [13]. The lightweight cryptographic algorithm has
difficult [5]. been designed using Recursive Pared Parity and
Transformation of Bits techniques which are also
The strength of the encryption and applicable for IoT embedded platforms and proved
decryption algorithms depends on how difficult it is that efficient than AES [18].
to acquire the keys. In the research mentioned above,
the majority of the cryptographic algorithms' key III. PROPOSED KS-KEY ALGORITHM
sizes are almost fixed, with the exception of the
Blowfish method, which has a maximum key size of A character password made up of a
448 bits. In the actual world, ransomware breaks the combination of letters, numbers, special characters,
highest security measures as a result of unbiased etc. is used to enter the KS key algorithm. For the
attacks on users and companies. Ransomware infects password to be secure and effective, there's a set of
models in large part via creating keys; the threat can guidelines that must be followed by an algorithm.
easily be mitigated by using a defense-in-depth With the use of these guidelines, key-building is
strategy [8]. made more complex and confusing. The character
password in the flow diagram (figure 1) is initialized
In symmetric key encryption using a genetic and starts at position 0. If the binary character is
algorithm, the key generation process divides the user present in the current position value, block 1 is
input and then simply converted using ASCII executed; otherwise, block 2 is carried out. Repeat
character conversion it results in a matric key [9]. this step until all the characters present in the
Identity-based re-encryption, the key generation password are executed. Character Passwords are all
process gets a user Identity as an input for the master non-binary characters and are passed in blocks one at
secret key combined with public parameter the a time based on their position. Here, the characters
algorithm output’s the user secret key which to are transformed into ASCII binary characters. The
ensure the trust authority [10]. DNA-based random translated characters are added further.
key generation and management for OTP Encryption
the secure keys are directly generated from organisms Block B begins execution at position 0 and
that are highly random. The DNA is processed is the receives the translated binary characters produced by
key to improving the security and credibility of the block A. In this case, the translated binary characters
data owner [11]. and the current position value of the Character
password are bit-wise XORed. The XOR process is
The only use of cryptography does not repeated until the final value in the translated binary
provide a way to improve cloud computing security. characters are executed. After the XOR binary
In a practical setting, cloud security is improved by characters, the current position value of the Character
incorporating both cryptographic algorithms and password will be appended.The KS-KEY method
security policies [12]. Cloud computing services completes the execution of all the characters in the
encrypt all data using keys of identical size without password and results in the binary value as the key.
taking into account any priority that would increase Further cryptographic algorithm may be utilize the
the cost or lengthen the execution time. The amount key for both encryption and decryption.
of data that is prioritized for encryption at various
levels saves money and time [17]. Services for A. Pseudo code for KS-KEY Algorithm:
creating and maintaining keys, often known as key
generation and key management, the user is KS-KEY ( Character_password )
responsible for carrying out the entire execution {
process [14]. Word key, temp
For ( i=0; i< length ( Character_password );
In real-time applications, the encryption i++)
approaches are improved by combining binary tree {
traversals and XOR operations. DoS assaults, bypass If ( Character_password [i] == ‘0’ or ’1’)
attacks, and intruder attacks can all be protected {
against with the use of the XOR operation [15][16]. temp = null
AES is the best performing algorithm when For ( j=0; j< length ( key ); j++)
compared to symmetric and asymmetric algorithms {
like DES, RSA, BLOWFISH, and others in a variety temp = temp + ( key [ j ]
of contexts and with a variety of file formats, XORCharacter_password [ i ] )
including picture files, binary files, text files, etc. }

978-1-6654-7467-2/23/$31.00 ©2023 IEEE 648

Authorized licensed use limited to: Andhra University College of Engineering. Downloaded on November 20,2024 at 08:06:02 UTC from IEEE Xplore. Restrictions apply.
 Proceedings of the 5th International Conference on Smart Systems and Inventive Technology (ICSSIT 2023)
IEEE Xplore Part Number: CFP23P17-ART; ISBN: 978-1-6654-7467-2

key = temp + Character_passwrod [ i ]

}
Else
{
temp = ASCII_Binary_Value (
Character_passwrod [ i ] )
key = key + temp
}
}
return ( key )
}

*ASCII_Binary_Value is a function used to

convert characters to ASCII binary characters.
*XOR is an Exclusive OR operation.

B. Rules:

 The Character password must have a

minimum of one binary character.
 The password strength is dependent upon
using no of binary character in regular
intervals.

Fig. 1. Flow Diagram of KS-KEY Algorithm

The KS-KEY method heavily relies on

binary characters. Based on the binary values,
confusion and combination of the key are created.
The protection key's greatest strength is determined
by the number of binary characters that are set at
frequent intervals. This algorithm makes it difficult to
move backward. Character password which is
provided by the user given as a input for the KS-Key
algorithm. The main goal is converting Character
passwords to intricate binary characters. The XOR
operation and ASCII Binary value operation are two
crucial conversion methods.

978-1-6654-7467-2/23/$31.00 ©2023 IEEE 649

Authorized licensed use limited to: Andhra University College of Engineering. Downloaded on November 20,2024 at 08:06:02 UTC from IEEE Xplore. Restrictions apply.
 Proceedings of the 5th International Conference on Smart Systems and Inventive Technology (ICSSIT 2023)
IEEE Xplore Part Number: CFP23P17-ART; ISBN: 978-1-6654-7467-2

IV. ANALYSIS OF IMPLEMENTATION AND

RESULTS  (2)

A. Experimental Setting: To evaluate the

“Ky” starts the conversion of p[i] to binary value and
effectiveness of the suggested KS-KEY algorithm
appended to the previous converted binary value in
by using scenario-based ideas. The system setup
Eq.(3).
is an Intel Core i7 (2.60 GHz) with 16 GB of
RAM, and the experimental execution is carried
out in the Python programming language. (3)

B. Step by step execution of KS-KEY: The key size will differ based on character password
count and the combination of binary characters in
Step 1: Get the user input as the character password Eq.(4).
and analyze the count of the character, the count set
as no of the looping.

Step 2: Once the looping parameter has been (4)

specified, the Character password will be executed
based on the looping value. TABLE I. COMPARSION OF KEY SIZE AND KEY POSSIBILITES

Step 3: The current position of the character Algorithm Key Size Key possibilities
password value is checked, whether it has the binary
value the block 1 will be executed else the block 2 is DES 56 bits 256
executed.

Step 4: In block 1, first analyze the number of the bits

from the ready queue and perform the XOR operation AES 128,192,256 bits 2128 ,2196 ,2256
between the current bits and ready queue of the
character password. BLOWFISH 32-448 bits 232 – 2448

Step 5: In block 2, the current value of the character User password-

password is converted to binary value based on the User password-based based key
KS-KEY key size possibilities
ASCII conversion method.

Step 6: The block 1 and block 2 will be executed

D. Experimental results:
until it reaches the last position of the character
password and results as binary key.
Step by step data transformation
C. Our Notations:
“P” is denoted as Character_password and u = 01110101
“i” is position. The KS-KEY Key is generated by
um = 0111010101101101
looping a combination of “Kx” and “Ky”. “Kx” is
executed when p[i] is a binary character. “Ky" is uma = 011101010110110101100001
executed when p[i] is non-binary character in Eq.(1)
representation. ⊗ denoted as XOR operation. uma1 = 1000101010010010100111101

uma1@ = 100010101001001010011110101000000

uma1@3 = 10001010100100101001111010100000
00110011
(1)
uma1@31 = 0111010101101101011000010101111
“Kx” starts execution, then check the length of “Ky”. 11110011001
If there is any value in “Ky”, the values XOR with
Input :character_password = uma1@31
the p[i] and finally added with P[i] in Eq.(2).

978-1-6654-7467-2/23/$31.00 ©2023 IEEE 650

Authorized licensed use limited to: Andhra University College of Engineering. Downloaded on November 20,2024 at 08:06:02 UTC from IEEE Xplore. Restrictions apply.
 Proceedings of the 5th International Conference on Smart Systems and Inventive Technology (ICSSIT 2023)
IEEE Xplore Part Number: CFP23P17-ART; ISBN: 978-1-6654-7467-2

Output : Key = with binary conversion procedure 01110101-

011101010110110101100001010111111110011001 01101101-01100001-01011111-11100110-01.The
Backtracking result = uma_�.
E. Key size and it differentiate
The password used in the aforementioned case is
The KS-KEY method provides a way to almost weak, according the KS-KEY algorithm
distinguish between the number of character criteria. Even in the worst-case situation, the
transformations and the key's bit size. The bit size of suggested technique offers extremely good
the key for a classical method is character * 8 and the backtracking safety.
key size is relatively constant. Even if the character
count is the same in the proposed approach, the key's V. CONCLUSION
bit size will vary, which makes it unpredictable. The
password, for instance, is "um1apa0thy1". The bit Key generation is a crucial step in all
size for the key in a classical approach that functions encryption and decryption algorithms. Based on the
is 88 (11*8) and the password includes 11 characters. results of the key generation procedure, encryption
The password includes 11 characters, however, the and decryption intervene. A Novel key generation
suggested technique works by multiplying the total algorithm is suggested in this research. The key size
number of binary characters by the total number of prediction and safe backtracking are improved by the
binary non-binary characters, or *8, to get the KS-KEY generation technique. The new symmetric
password. As a result, the key's bit size in Eq. (4) is algorithm may be structured further based on the key
67 (3+ (8*8)). generation algorithm. That approach allowing for
Another 11-character password in the suggested highly secure encryption and decryption processes.
scheme is "um1apath20." As a result of the new 11- Despite the desire for brute force to get more
character password, the key's bit size now is 72 (2+ sophisticated, it generates enormous complexity in a
(9*8)). The suggested approach would provide fair amount of encryption time. Because the key and
greater diversity for the same amount of characters metadata are not stored anywhere, the CS service
while taking into account the previous password key provider is unable to operate in this structure. The
size of 67 and the new password key size of 72 database service providers, in this instance, have the
utilizing the same 11 characters. The suggested user's encrypted data, which is protected from all
method won't follow an 8 16 24 32 40 48 56 64 128 types of attack methods.
192 256 pattern. The benefit will assist in preventing
brute force attacks employing a combination of the VI. REFERENCES
128, 192, or 256 keys. Character length is not defined
[1] W. Stallings, Cryptography and Network Security: Principles
in the proposed technique, making it more difficult to and Practices, Pearson, 2005.
anticipate the key size using brute force when there
are several key size options for a given character [2] Shazia Afzal, Muhammad Yousaf, Humaira Afzal,
count. NawafAlharbe, Muhammad Rafiq Mufti, "Cryptographic Strength
Evaluation of Key Schedule Algorithms", Security and
Communication Networks, vol. 2020, Article
F. Backtracking keys ID 3189601, 9 pages, 2020. https://doi.org/10.1155/2020/3189601

The hacker cannot interpret the password character, [3] Rahul Saha, G. Geetha, Gulshan Kumar, Tai-hoon Kim, "RK-
AES: An Improved Version of AES Using a New Key Generation
and the exact execution of the XOR operation Process with Random Keys", Security and Communication
performed is impossible to find, while backtracking Networks, vol. 2018, Article
in binary values. So the same password character ID 9802475, 11 pages, 2018. https://doi.org/10.1155/2018/980247
used in different websites or domains is secured by 5.
the Non-backtracking technique. Even the hacker, [4] D. Coppersmith, "The Data Encryption Standard (DES) and its
intruded binary key cannot obtain the character strength against attacks," in IBM Journal of Research and
password because the same binary key can be Development, vol. 38, no. 3, pp. 243-250, May 1994, doi:
interpreted from different character passwords by 10.1147/rd.383.0243.
using the proposed algorithm due to an XOR [5] B. Schneier, “Description of a new variable-length key, 64-bit
operation. block cipher (Blow- fish), ”1994, doi: 10.1007/3-540-58108-1_24.

The following example uses the research findings [6] Johannes A, Buchanan, “Introduction to cryptography”,
shown experimental results: Binary key SpringerVerlag.
‘011101010110110101100001010111111110011001
’ for character password ‘uma1@31’. Let backtrack

978-1-6654-7467-2/23/$31.00 ©2023 IEEE 651

Authorized licensed use limited to: Andhra University College of Engineering. Downloaded on November 20,2024 at 08:06:02 UTC from IEEE Xplore. Restrictions apply.
 Proceedings of the 5th International Conference on Smart Systems and Inventive Technology (ICSSIT 2023)
IEEE Xplore Part Number: CFP23P17-ART; ISBN: 978-1-6654-7467-2

[7] Handschuh H. (2011) RC6. In: van Tilborg H.C.A., Jajodia

S. (eds) Encyclopedia of Cryptography and Security. Springer,
Boston, MA. https://doi.org/10.1007/978-1-4419-5906-5_608.

[8]Bajpai, Pranshu, and Richard Enbody. "Dissecting.

netransomware: key generation, encryption and
operation." Network Security 2020.2 (2020): 8-14.

[9] Sindhuja, K., and S. Pramela Devi. "A symmetric key

encryption technique using genetic algorithm." International
journal of computer science and information technologies 5.1
(2014): 414-416.

[10] Liu, L., & Ye, J. (2018). Identity-based re-encryption scheme

with lightweight re-encryption key generation. Journal of Discrete
Mathematical Sciences and Cryptography, 21(1), 41-57.

[11] Zhang, Yunpeng, Xin Liu, and Manhui Sun. "DNA based
random key generation and management for OTP
encryption." Biosystems 159 (2017): 51-63.

[12]Jaber, AwsNaser, and MohamadFadli Bin Zolkipli. "Use of

cryptography in cloud computing." 2013 IEEE International
conference on control system, computing and Engineering. IEEE,
2013.

[13] Panda, Madhumita. "Performance analysis of encryption

algorithms for security." 2016 International Conference on Signal
Processing, Communication, Power and Embedded System
(SCOPES). IEEE, 2016.

[14] Uma, G., and L. Jayasimman. "Enhanced convergent

encryption key generation for secured data deduplication in cloud
storage." Journal of Physics: Conference Series. Vol. 1142. No. 1.
IOP Publishing, 2018.

[15] T. Sivakumar, S. Veeramani, M. Pandi* and G. Gopal, “A

Novel Encryption of Text Messages Using Two Fold Approach”,
Recent Advances in Computer Science and Communications 2020;
13(6) .https://doi.org/10.2174/2666255813666191119123159

[16]MeenuTalwar* and BalamuruganBalusamy, “Iot Secured

Disjunctive XOR Two Factor Mutual Authentication for Users”,
Recent Advances in Computer Science and Communications 2020;
13(6) . https://doi.org/10.2174/2666255813666191128160711

[17]Darwazeh, Nour S., Raad S. Al-Qassas, and Fahd AlDosari.

"A secure cloud computing model based on data
classification." Procedia Computer Science 52 (2015): 1153-1158.

[18]R. Chatterjee, “Design of Lightweight Cryptographic Model

for End-to-End Encryption in IoT Domain,” vol. 01, no. 04, pp.
215–224, 2019.doi:https://doi.org/10.36548/jsws.2019.4.002

[19]N. R. Potlapally, S. Ravi, A. Raghunathan and N. K. Jha, "A

study of the energy consumption characteristics of cryptographic
algorithms and security protocols," in IEEE Transactions on
Mobile Computing, vol. 5, no. 2, pp. 128-143, Feb. 2006, doi:
10.1109/TMC.2006.16.

978-1-6654-7467-2/23/$31.00 ©2023 IEEE 652

Authorized licensed use limited to: Andhra University College of Engineering. Downloaded on November 20,2024 at 08:06:02 UTC from IEEE Xplore. Restrictions apply.