Highly Secure AES with Key Generation Using SHA-256 Hash Function

In the modern cryptography world, data is being continuously encrypted and decrypted when it is being transferred or stored in databases so that no one can attack the original data for security purposes. There are a lot of encryption and decryption algorithms designed in previous days to increase the security, but to secure data in advanced computing power and cryptanalysis techniques The Advanced Encryption Standard algorithm was used and made it prove the data is being more secure compared to previously designed algorithms due to its symmetricity, flexibility in having multiple key sizes and versatility in file encryption, image encryption and network security protocols. Its security relies on the key size used in the algorithm for encryption and decryption. In this paper we are integrating Secure Hash Algorithm (SHA-256) with AES for adding an extra security and barrier layer for the key used by AES. SHA is a part of the SHA-2 family where multiple hashing functions come under it. Hashing is the process of increasing the security of the system by hashing the data so that it can be prevented from brute-force attacks, which are very common in the hardware world. This process will include randomness and increase key entropy. This approach won’t affect the performance of AES and will also make it the better option for securing the data in the modern cryptographic world.

Authors

Institutions

Publication Details

Published
2025-06-05
DOI
https://doi.org/10.1109/iccsp64183.2025.11088569
Citations
1
Primary Topic
Physical Unclonable Functions (PUFs) and Hardware Security
Type
article
Field-Weighted Citation Impact
2.27
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Highly Secure AES with Key Generation Using SHA-256 Hash Function

R. Sakthivel, Maniyar Mohammed Saqlain
1 citations
Physical Unclonable Functions (PUFs) and Hardware Security
2.27
article

Highly Secure AES with Key Generation Using SHA-256 Hash Function

R. Sakthivel, Maniyar Mohammed Saqlain
article en
1 citations

Abstract

In the modern cryptography world, data is being continuously encrypted and decrypted when it is being transferred or stored in databases so that no one can attack the original data for security purposes. There are a lot of encryption and decryption algorithms designed in previous days to increase the security, but to secure data in advanced computing power and cryptanalysis techniques The Advanced Encryption Standard algorithm was used and made it prove the data is being more secure compared to previously designed algorithms due to its symmetricity, flexibility in having multiple key sizes and versatility in file encryption, image encryption and network security protocols. Its security relies on the key size used in the algorithm for encryption and decryption. In this paper we are integrating Secure Hash Algorithm (SHA-256) with AES for adding an extra security and barrier layer for the key used by AES. SHA is a part of the SHA-2 family where multiple hashing functions come under it. Hashing is the process of increasing the security of the system by hashing the data so that it can be prevented from brute-force attacks, which are very common in the hardware world. This process will include randomness and increase key entropy. This approach won’t affect the performance of AES and will also make it the better option for securing the data in the modern cryptographic world.

Vellore Institute of Technology University (IN)
Affordable and clean energy
Openalex Percentile: Top 13%
Physical Unclonable Functions (PUFs) and Hardware Security
2.27
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.