0% found this document useful (0 votes)
25 views

Ensuring Data Integrity Using Secure Hash Algorithm SHA-512_Group3

Uploaded by

mentharith
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
25 views

Ensuring Data Integrity Using Secure Hash Algorithm SHA-512_Group3

Uploaded by

mentharith
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 6

Ensuring Data Integrity Using Secure Hash

Algorithm SHA-512
Ho Chandara1, Horn Bunhak2, Men Rithydet3, Sot Sochetra4, Seak Chhaynee5, Reth Monypong6, Yoeung Sokheng7

Department of Telecomunications and Networking, Cambodia Academy of Digital Technology

2nd bridge Prek Leap, National Road Number 6, Phnom Penh, Cambodia
[email protected], [email protected]

[email protected], [email protected]

[email protected], [email protected]

[email protected]

Abstract— This research examines how the Secure Hash has become a cornerstone of cybersecurity with its various
Algorithm (SHA-512) helps protect digital data from tampering iterations like (SHA-1, SHA-2, SHA-3) ensuring data
and corruption. We implemented SHA-512 in Python and tested integrity across diverse applications, including digital
its ability to detect unauthorized changes in different types of signatures, blockchain technology, and secure
files, including text, images, and audio. Our experiments show communications [4].
that SHA-512 creates unique digital fingerprints for each file,
and even the smallest change to the original data results in a So, the remainder of this paper dives into the principles
completely different fingerprint. This makes it highly effective underlying the Secure Hash Algorithm 512, to examine its
at detecting any modifications to digital content. The results variant and applications, and evaluates its effectiveness in
confirm that SHA-512 is a reliable tool for ensuring data maintaining data integrity in today’s digital landscape.
remains unchanged during storage and transmission, making it
valuable for applications like secure file sharing, digital LITERATURE REVIEW
signatures, and database security. This research provides In the subject of cybersecurity, especially in the field of
practical evidence of SHA-512's effectiveness in maintaining
information security, maintaining data integrity has long been
data integrity across various digital systems.
a concern, and scholars have repeatedly emphasized how
Keywords—Data Integrity, Data Security, Secure Hash crucial it is to contemporary digital ecosystems. Several
Algorithm, Hash, Cryptography, Message Padding, studies highlight the dangers of cyberattacks, data corruption
and data tampering. Smith et al. [5] emphasize that data
INTRODUCTION integrity is a pivotal aspect of clinical trials, influencing
research credibility and data breaches can have profound
In Today’s Digital Landscape, Ensuring the integrity of financial and reputational consequences, especially for
data is a critical component of modern information security organizations that is operating in high-stakes industries such
practices. In an era marked by increasing cyber threats and the as finance and healthcare. Ravi Kumar Sharma [6] also points
proliferation of digital data, safeguarding the authenticity and out that poor data quality and integrity problems are often
consistency of data during transmission and become a top overlooked until they cause significant losses, which
priority. So that bad and unreliable data cannot potentially exacerbates the issues even more.
cause companies millions of dollars in revenue loss and have
far reaching consequence beyond financial damage for the Ensuring data integrity is a cornerstone of modern
party involved [1]. According to a survey conducted by the information security, with cryptographic hash functions
research firm Gartner, organizations believe to have poor data playing a pivotal role in detecting tampering and verifying
quality is to be responsible for an average of 15 million dollars authenticity. Among these The Secure Hash Algorithm (SHA)
per years in losses, In the same study Gartner also found that family has been extensively studied for its reliability and
nearly 60% of those surveyed did not know how much bad robustness. While earlier versions like SHA-1 and SHA-2
data is costing their business because they don’t measure them have proven effective, advancements in computational power
in the first place [2]. and cyber threats have driven the adoption of stronger
algorithms such as SHA-512 [7][12].
However, ensuring data integrity is no easy task. Data in
transit and storage usually faces numerous challenges and SHA-512 is distinguished by its 512-bit hash output and
threats, including unauthorized tampering, accidental higher resilience to collision and preimage attacks, making it
corruption, and even deliberate cyberattacks. As data grows in particularly well-suited for scenarios demanding enhanced
volume and complexity, so does the challenge of safeguarding data security. The advantage of using SHA-512 instead of the
its authenticity. Traditional methods of error detection often other iteration is because of its longer hash length and
fall short in addressing the sophisticated threats and computational robustness as key factors [8].
challenges that are posed by modern cybercriminals [3]. In the subject of cryptographic hashing, there has been a
This is where cryptographic hash functions, such as the lot of interest in the process of hashing files with multiple
Secure Hash Algorithm (SHA), come into play. These parameters, such as different block sizes, input lengths, and
algorithms create a unique digital footprint, or hash value, of salting approaches. The effect of parameter adjustment on
the original input. Even the smallest change in the input data hash function performance is examined in studies by Harris E.
results in a completely different hash value, making any Michail, George Athanasiou [9], especially through the use of
tampering or modifying of data immediately detectable. SHA pipelined designs. According to their research, the area-

XXX-X-XXXX-XXXX-X/XX/$XX.00 ©20XX IEEE


throughput trade-offs in cryptographic systems can be greatly lengths, this study aims to identify configurations that strike
impacted by changing characteristics such as block size and an optimal balance between security and computational
design. Larger block sizes, for instance, might boost efficiency. Additionally, this research introduces a dynamic
throughput at the expense of more hardware area utilization; parameter adjustment framework, enabling SHA-512 to adapt
as a result, these configurations are better suited for high- to varying system conditions in real time. Through extensive
performance systems but less so for situations with limited experimental analysis, this paper seeks to contribute novel
resources. These results highlight how crucial it is to insights into leveraging SHA-512’s potential for ensuring
customize hash function parameters [9]. robust data integrity across a wide range of applications, from
high-performance systems to resource-constrained
In addition to its standalone applications, SHA-512 has environments.
been adopted in layered systems where integrity must be
maintained at scale. For instance, in file integrity monitoring METHODOLOGIES
systems, hashing files with varying parameters enhances
customization and resilience against tampering [10]. The methodologies employed in this research focus on
Furthermore, SHA-512 is increasingly used in file integrity implementing the Secure Hash Algorithm SHA-512 to ensure
monitoring systems, where hashing files with varying the integrity of the data. The implementation addresses the
parameters allows for improved customization and resilience specifications outlined in cryptographic standards,
against tampering [11]. particularly FIPS PUB 180-4, and was developed using
Python [15]. This section details the structured approach
The implementation of SHA512 in practical applications undertaken, highlighting each phase of the implementation
has demonstrated its versatility across various domains. The process, from input preprocessing to the generation of the final
Current standard implementation processes data in 1024-bit hash value.
blocks with messages being padded according to specific rules
to ensure proper block argument. The algorithm performs 80 The implementation of the SHA-512 algorithm in this
rounds of processing for each block, using an eighth 64-bit research was conducted manually, without relying on external
working variable and a set of constraints derived from the first libraries, to gain a deeper understanding of its underlying
80 prime numbers [12]. The process of SHA-512 typically processes. Python was selected as the programming language
follows: due to its flexibility and ability to handle complex
computations. The development environment used was Visual
• Padding the message to ensure its length is Studio Code, which provided a user-friendly interface and
congruent to 896 modulo 1024 powerful debugging tools to facilitate the coding and testing
process. The manual approach involved breaking down the
• Appending the 128-but representation of the SHA-512 algorithm into its core components, such as
original message length padding, message scheduling, and compression functions, and
• Breaking the padded message into 1024-bit implementing each step sequentially. This method ensured a
blocks thorough exploration of the algorithm's mechanics and its
application in ensuring data integrity.
• Initializing the Hash values from H0 to H7 with
the first 64 bit of the fractional parts of the square The SHA-512 hashing algorithm follows a structured
roots of the first 8 prime numbers. sequence of steps to produce a unique and collision-resistant
512-bit hash value. Each phase of the process is designed to
• Processing each 1024-bit block through the enhance the integrity and security of the input data. The steps
compression function are as follows:
• Updating the intermediate hash values after each 1) Padding the Message: To prepare the input message
block processing for processing, it is padded to ensure that its length is
• Generating a final 512-bit hash value [13] congruent to 896 modulo 1024. The padding begins with the
appending of a single '1' bit to the message, followed by a
Despite these advances, several critical areas remain series of '0' bits. This process continues until the message
unexplored. Current literature lacks a comprehensive analysis length satisfies the condition of being congruent to 896
of SHA-512 performance under varying workload patterns, modulo 1024. The padding ensures that the message can be
particularly in edge computing environments. Additionally, divided into 1024-bit blocks for subsequent processing.
while parameter optimization has been studied, there is limited
research on dynamic parameter adjustment based on real-time 2) Appending the Message Length: After padding, the
system conditions. The relationship between blocks. algorithm appends a 128-bit representation of the original
message length (before padding). This step provides essential
Size optimization and energy efficiency in resource-
constrained devices also remain inadequately explored. information regarding the original size of the message,
Furthermore, existing studies have not fully addressed the ensuring that the algorithm can maintain data integrity and
challenges of maintaining optimal performance when the accurate representation of the input during the hashing
implementing SHA-512 in legacy systems or heterogeneous process.
computing environments [14]. 3) Breaking the Padded Message into Blocks: The
This research paper aims to address these gaps specifically padded message is divided into 1024-bit blocks. Each block
to investigate the optimization of SHA-512 for enhancing file will be processed individually through the compression
integrity verification. By systematically exploring the impact function, enabling efficient handling of large datasets while
of parameter variations, such as block size, salting, and input
maintaining the integrity of the entire message in the final
hash value.
4) Initializing Hash Values: The algorithm initializes
eight 64-bit hash values (H0 through H7). These values are
derived from the first 64 bits of the fractional parts of the
square roots of the first eight prime numbers. These
initialized constants act as the starting values for the
compression process, playing a key role in ensuring the
uniqueness of the hash value.
5) Processing Each Block through the Compression
Function: Each 1024-bit block is processed in 80 rounds. In
each round, a message schedule is created, consisting of 80
words (64 bits each), derived from the current block’s data
and bitwise operations. The block is processed through a
series of bitwise operations, modular additions, and
predefined constants (K values). These constants are derived
from the first 80 prime numbers. A set of eight working
variables (a, b, c, d, e, f, g, h) is used to process the data in
each round.
6) Updating Intermediate Hash Values: After processing
each block, the intermediate hash values (H0 to H7) are
updated by adding the values of the working variables. The
updated hash values then serve as the initial state for
processing the next block, ensuring continuity and
consistency throughout the entire message.
7) Generating the Final Hash Value: After all 1024-bit
blocks have been processed, the final 512-bit hash value is
obtained by concatenating the updated hash values (H0
through H7). This final hash uniquely represents the input
data, offering strong resistance to tampering and collisions,
which ensures the integrity of the data.
This structured approach guarantees the generation of a
unique and collision-resistant hash, making SHA-512 an
effective tool for ensuring data integrity and security.
Figure 1 illustrates the SHA-512 hashing process, outlining
the key steps involved in generating a 512-bit hash value. It
shows the padding of the input message to meet specific
length requirements, followed by appending the message
length. The padded message is divided into 1024-bit blocks,
processed through 80 rounds of compression with bitwise
operations, and updated hash values (H0 to H7). Finally, the
diagram depicts the concatenation of these values to form the The generated hash values are stored and compared
final 512-bit hash output, ensuring data integrity and collision during integrity checks. By hashing the original data and
resistance. periodically comparing it with the stored hash, any
unauthorized modifications can be detected. The SHA-512
algorithm's collision resistance ensures that even minor
changes in the input produce entirely different hash values,
making it an effective method for local data integrity
verification.
This methodology highlights the practicality and
robustness of SHA-512 in securing data locally, ensuring that
the integrity of stored or processed data is maintained without
reliance on external networks or transmission protocols.
Ensuring the integrity of data during transmission is critical
for maintaining the trustworthiness and security of
communication systems. This methodology presented
combines the Secure Hash Algorithm SHA-512 and the
Transport Layer Security (TLS) protocol to safeguard data in RESULTS
transit. This dual-layer approach provides a robust
Based on our propositions, we implemented the SHA-512
framework for ensuring data integrity and confidentiality.
algorithm in Python from scratch, strictly adhering to the
SHA-512 generates a unique, tamper-evident 512-bit hash
NIST Federal Information Processing Standards Publication
value for the original data before transmission. This
(FIPS PUB 180-4) specifications. The implementation
cryptographic hash value acts as a fingerprint, uniquely
involved manually constructing the message padding,
identifying the data. Any alteration during transit, whether
scheduling, and compression functions as defined in the
accidental or malicious, results in a different hash value,
standard.
which the receiver can detect by recalculating the hash upon
receipt. This process ensures that the transmitted data remains The results obtained from the implementation of the SHA-
unmodified and trustworthy. Now let dive into the depth of 512 algorithm in Python are presented in this section. This
the methodology one by one. Before transmission, the experiment aimed to evaluate the algorithm's performance
original data is input into the SHA-512 hashing algorithm, and effectiveness in hashing diverse data types, including
The algorithm process the data through its compression text, images, and voice files. The results provide a detailed
functions, producing a 512-bit hash value, this hash value is analysis of how the algorithm generates unique 512-bit hash
packaged alongside the original data for secure transmission. values for each input and its sensitivity to any changes in the
Upon receiving the data and hash, the receiver uses the same input data to ensure the integrity during the data transit
SHA-512 algorithm to generate a hash from the received data, process.
the generated hash is compared with the transmitted hash, a
match confirms the data’s integrity, a mismatch signals For our first experiment is we can put an input of a simple
potential tampering or corruption. After that TLS is employed string with the value of “hello everyone!”, with that input
going through the algorithm that we proposed we can see that
to encrypt the data and its corresponding hash during transit,
the output for that string is
ensuring that the communication channel is protected against
“af2f16b1f807262f3d33606d62f0aa91eda91ed97159028ca6
eavesdropping, man-in-the-middle attacks, and unauthorized
access. This protocol provides confidentiality, integrity, and e4100bfccb6f7d651d18cd6df7ab3fdd25964e8938262b55ab
authentication for transmitted data. The communication 8f631dee1f75bcb5a2546f56c65c”. Our algorithm
consistently produced the same hash output value for
begins with TLS handshake, where the sender and receiver
identical text inputs. This demonstrates the deterministic
exchange encryption keys secretly, Certificate are used to
nature of SHA-512, ensuring that identical inputs always
verify the authenticity of both parties, preventing
yield identical hash values. Furthermore, the fixed-length
impersonation, a session key is established to encrypt the data
and hash for the duration of the communication. The original output provides a consistent representation irrespective of the
data and its SHA-512 hash are encrypted using the session input size, a crucial property for data integrity verification.
key and transmitted over the secure channel, Encryption
ensures that even if the data is intercepted, it cannot be read
without the session key. If the TLS connection is interrupted
or compromised, the session is terminated, and alerts are
logged, Data integrity checks using SHA-512 to ensure that
tampered or corrupted data is identified, and retransmission
is initiated as needed.
This methodology applies to scenarios where data
integrity and confidentiality are important, such as in
Financial Transactions, to ensure that transaction details
remain unaltered and confidential while being processed over
the internet and are not tampered with, to protect against
fraudulent activities like data tampering or unauthorized
alterations. In Healthcare Data Sharing we need to safeguard
sensitive medical information transmitted between healthcare
providers, ensuring data is not corrupted or exposed during
transit, and prevent breaches that could compromise patient To ensure data integrity, we can utilize a method called
confidentiality. In secure file transfer, we can maintain data compare-by-hash systems. These systems identify data
integrity of large files, such as legal documents or software blocks by their cryptographic hash values, which remain
packages, by verifying their authenticity upon receipt, it also fixed in length regardless of the input size. Blocks with
protects against tampering that could introduce malicious matching hashes are presumed to be identical, making this an
code or unauthorized changes. efficient way to examine data reliability. However, hash
By combining the tamper-evident properties of SHA-512 collisions are an inherent limitation of such systems. These
with the encryption and authentication capabilities of TLS, collisions occur when different inputs produce the same hash,
this approach offers a comprehensive mechanism for which is a possibility due to the finite number of hash values
protecting data in transit. It ensures that data arrives at its that can be generated [16].
destination both intact and secure, addressing critical
requirements for modern communication.
For instance, if we changed the input from hello everyone! The findings of this study underscore the robustness and
to hello everyone! Even a minor modification like this causes versatility of the SHA-512 algorithm in safeguarding data
a significant change in the resulting hash value, integrity across diverse digital content. The experimental
demonstrating the sensitivity of cryptographic hashes. results affirm the algorithm’s deterministic properties,
sensitivity to input changes, and collision resistance, making
Result1:af2f16b1f807262f3d33606d62f0aa91eda91ed97159 it a critical tool for modern cryptographic applications.
028ca6e4100bfccb6f7d651d18cd6df7ab3fdd25964e893826 In text hashing implications, the deterministic nature of
2b55ab8f631dee1f75bcb5a2546f56c65c SHA-512, as evidenced by consistent hash generation for
identical text inputs, is particularly beneficial for applications
Result2:131cc1742781465f2c1c86abfdf8c94a8aae4ae16504 such as database verification and secure communication. The
fixed-length hash output, regardless of input size, ensures
3ddcbe4976ee834b9171044501abd3c6d32443dfaec3608a94
compatibility with various systems and protocols, which is
4c919cbb6afdb331c7d88471906caf0a18 essential for scalable cryptographic solutions. This
experiment highlights the algorithms effectiveness in
As shown above, the hash values are entirely different, from securing textual data in scenarios like email authentication
the first bit to the last. This stark difference illustrates the and digital signatures.
avalanche effect, a property of cryptographic hash functions
In image hashing and avalanche effect, the algorithm's
where a small change in the input results in a vastly different
sensitivity to alterations in image files underscores its
output. Such behavior ensures that even the slightest
potential in detecting unauthorized modifications in
alteration in data is detectable, which is crucial for verifying multimedia data. This property is invaluable for applications
data integrity. in digital forensics, intellectual property protection, and
Secondly, we can test our methodology with image file watermarking. The ability to discern even single-pixel
hashing with this we can use input as a 256x256 JPEG image changes ensures that visual data can be authenticated with
file and with this image file we can get the output of the input high precision, which is critical in sectors such as media
production and law enforcement.
is:‘f3d7a62f8df6829f028c062fa3484d197e3c7e34e9c50151
284d6d95f1d347ab3a2a9f30f34bd0c857e27b5b93974a90a3 In the context of voice data, SHA-512 ensures that audio
66e3a1645c1c5018b01dcac737ef30’, with this hashing files remain untampered during transmission or storage. This
process it exhibited a high degree of sensitivity to even the capability is particularly relevant in secure voice
smallest changes in the input file. For instance, altering a communication, audio archiving, and digital rights
single pixel in the image resulted in a completely different management. The experiment demonstrates that even minute
hash value, emphasizing the avalanche effect, a hallmark of changes in audio input yield entirely different hashes, further
solidifying the algorithm’s effectiveness in protecting
strong cryptographic hash functions. This ensures that even
dynamic and high-dimensional data.
minimal tampering with the image data can be detected
effectively, bolstering the algorithm’s collision resistance. In border implications, the study demonstrates that the
Finally, the last experiment that we can test without SHA-512 algorithm is well-equipped to handle diverse data
topology is with a voice file specifically a 5 second WAV types without compromising performance or security. Its
audio clip file and with that voice file we can get the hash is: versatility makes it a suitable candidate for integration into
‘2ed8e8a7a432a5c03d7e1b18e5fcf74bb9b2c8d123f8ec774c modern cryptographic frameworks, including blockchain
35a7c87a6e73117e9df94e746649d0ab74ae8a244a6c56ab29 technologies, where immutability and trust are paramount.
cf9d396cdf9a635d7e71ba63a9c’. Similarly to the other Additionally, its collision resistance and resistance to
experiment, when hashing voice files, the algorithm tampering align with the stringent requirements of emerging
demonstrated remarkable robustness. Slight alterations, such applications in IoT, healthcare, and financial services.
as trimming 0.1 seconds from the audio clip, resulted in While the results affirm the algorithm's strengths, future
drastically different hash values. This behavior reinforces work could explore its computational efficiency and
SHA-512’s ability to detect and prevent data tampering in performance in resource-constrained environments. Given
multimedia files, which is critical for applications requiring the growing demand for lightweight cryptographic solutions,
secure storage and transfer of audio data. examining the scalability of SHA-512 in mobile and IoT
Overall, the experimental finding confirms that the SHA- devices would be a valuable avenue for research.
512 algorithm is not only versatile but also highly reliable in By situating these capabilities and potential applications
maintaining data integrity across various formats. Its within a broader context, the discussion highlights the
deterministic nature, sensitivity to Input changes, and strong relevance of SHA-512 in contemporary and future
collision resistance make it a robust tool for cryptographic cryptographic practices, reaffirming its role as a cornerstone
applications. These results further underscore its applicability in securing digital data.
in real world scenarios where, ensuring the authenticity and
integrity of diverse types of data is paramount. CONCLUSION
DISCUSSION In an era where data integrity is critical to ensure trust and
security in digital systems, cryptographic hashing algorithms
play a pivotal role. This research highlights the effectiveness
of Secure Hash Algorithm (SHA-512) in maintaining data Conference on Semantics, Knowledge and Grids, Beijing, China:
IEEE, Nov. 2010, pp. 105–112. doi: 10.1109/SKG.2010.19.
integrity across various use cases, from analysis, SHA-512
[7] M. Sumagita and I. Riadi, ‘Analysis of Secure Hash Algorithm
has proven to be highly reliable due to its strong (SHA) 512 for Encryption Process on Web Based Application’, vol.
cryptographic properties, including resistance to collision and 7, pp. 373–381, Sep. 2018.
pre-image attacks. [8] H. Cheng, D. Dinu, and J. Großschädl, ‘Efficient Implementation of
the SHA-512 Hash Function for 8-Bit AVR Microcontrollers’, in
The implementation of SHA-512 demonstrates its ability Innovative Security Solutions for Information Technology and
to generate unique and irreversible hash values, making it an Communications, vol. 11359, J.-L. Lanet and C. Toma, Eds., in
Lecture Notes in Computer Science, vol. 11359. , Cham: Springer
indispensable tool in detecting unauthorized data International Publishing, 2019, pp. 273–287. doi: 10.1007/978-3-030-
modifications. Moreover, its efficiency in handling large 12942-2_21.
datasets underscores its practicality for real-world [9] I. Ahmad and A. Das, ‘Hardware implementation analysis of SHA-
applications. As cybersecurity threats continue to evolve, 256 and SHA-512 algorithms on FPGAs’, Comput. Electr. Eng., vol.
31, pp. 345–360, Sep. 2005, doi:
integrating robust hashing mechanisms such as SHA-512 10.1016/j.compeleceng.2005.07.001.
within organizational workflows is imperative. [10] ‘Hashing Technology: Automatic File Integrity Checking.’ Accessed:
Dec. 25, 2024. [Online]. Available:
Future research could explore optimizing the performance https://isid.com/technology/hashing/
of SHA-512 in resource-constrained environments and [11] F. Al-Shareefi and Z. Albarmani, ‘Comparing two cryptographic
combining it with emerging technologies like blockchain for hash algorithms: SHA-512 and whirlpool- a case study on file
integrity monitoring’, BIO Web Conf., vol. 97, p. 00093, Apr. 2024,
enhanced security. By adopting such advanced solutions, doi: 10.1051/bioconf/20249700093.
organizations can fortify their defenses against data [12] ‘(PDF) Analysis of Secure Hash Algorithm (SHA) 512 for
tampering and ensure the authenticity and reliability of their Encryption Process on Web Based Application’. Accessed: Dec. 25,
digital assets. 2024. [Online]. Available:
https://www.researchgate.net/publication/327392778_Analysis_of_S
ecure_Hash_Algorithm_SHA_512_for_Encryption_Process_on_Web
REFERENCES _Based_Application?enrichId=rgreq-
[1] S. Duggineni, ‘Data Integrity and Risk’, Open J. Optim., vol. 12, no. a4b1f1a02914924578a86e6027b57053-
2, Art. no. 2, Jun. 2023, doi: 10.4236/ojop.2023.122003. XXX&enrichSource=Y292ZXJQYWdlOzMyNzM5Mjc3ODtBUzo2
[2] ‘How To Create A Business Case For Data Quality Improvement’, NjY2Mzg1NzE1MzYzODVAMTUzNTk1MDQyOTk2Mw%3D%3
Gartner. Accessed: Dec. 23, 2024. [Online]. Available: D&el=1_x_3&_esc=publicationCoverPdf
https://www.gartner.com/smarterwithgartner/how-to-create-a- [13] S. Gueron, S. Johnson, and J. Walker, ‘SHA-512/256’, in 2011
business-case-for-data-quality-improvement Eighth International Conference on Information Technology: New
[3] V. G. Garagad, N. C. Iyer, and H. G. Wali, ‘Data Integrity: A security Generations, Apr. 2011, pp. 354–358. doi: 10.1109/ITNG.2011.69.
threat for Internet of Things and Cyber-Physical Systems’, in 2020 [14] ‘(PDF) An encryption scheme based on AES and SHA-512’,
International Conference on Computational Performance Evaluation ResearchGate. Accessed: Dec. 25, 2024. [Online]. Available:
(ComPE), Shillong, India: IEEE, Jul. 2020, pp. 244–249. doi: https://www.researchgate.net/publication/286945255_An_encryption
10.1109/ComPE49325.2020.9200170. _scheme_based_on_AES_and_SHA-512
[4] P. Gupta and S. Kumar, ‘A Comparative Analysis of SHA and MD5 [15] National Institute of Standards and Technology (US), ‘Secure hash
Algorithm’, vol. 5, 2014. standard’, National Institute of Standards and Technology (U.S.),
[5] ‘(PDF) The Impact of Data Integrity on Clinical Trial Outcomes: Washington, D.C., NIST FIPS 180-4, 2015. doi:
Insights from Machine Learning’, ResearchGate. Accessed: Dec. 24, 10.6028/NIST.FIPS.180-4.
2024. [Online]. Available: [16] H.-C. Hsiao et al., ‘A Study of User-Friendly Hash Comparison
https://www.researchgate.net/publication/373214559_The_Impact_of Schemes’, in 2009 Annual Computer Security Applications
_Data_Integrity_on_Clinical_Trial_Outcomes_Insights_from_Machi Conference, Dec. 2009, pp. 105–114. doi: 10.1109/ACSAC.2009.20.
ne_Learning
[6] M. Zhou, R. Zhang, W. Xie, W. Qian, and A. Zhou, ‘Security and
Privacy in Cloud Computing: A Survey’, in 2010 Sixth International

You might also like