2016 2nd International Conference on Science and Technology-Computer (ICST) 2016
DOI: 10.1109/icstc.2016.7877365
|View full text |Cite
|
Sign up to set email alerts
|

SHA-2 and SHA-3 based sequence randomization algorithm

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
3
0

Year Published

2017
2017
2024
2024

Publication Types

Select...
4
2
1

Relationship

0
7

Authors

Journals

citations
Cited by 7 publications
(3 citation statements)
references
References 11 publications
0
3
0
Order By: Relevance
“…Even a slight change in the input results in a completely different hash value. With this characteristic, the hash function is widely utilized across various domains today, including data integrity [1], authentication [1,2], digital signatures [3], random number generation [1,4], password storage [5], and blockchain networks [6]. Given the diverse requirements for hash functions, numerous algorithms have been developed over time, including SHA-1, SHA-2, and SHA-3.…”
Section: Introductionmentioning
confidence: 99%
“…Even a slight change in the input results in a completely different hash value. With this characteristic, the hash function is widely utilized across various domains today, including data integrity [1], authentication [1,2], digital signatures [3], random number generation [1,4], password storage [5], and blockchain networks [6]. Given the diverse requirements for hash functions, numerous algorithms have been developed over time, including SHA-1, SHA-2, and SHA-3.…”
Section: Introductionmentioning
confidence: 99%
“…The SHA-2 hash algorithm is sub-divided into three sections such as padding unit, message scheduler and compression function [7]. Table 3 depicts a comparison between different SHA-2 hash functions.…”
Section: Sha-2mentioning
confidence: 99%
“…Examples of hash functions are MD2, MD4, MD5, Secured Hashing Algorithms are (SHA-1, SHA-2and SHA-3) and etc. hash function is irreversible and supports the one way property which means that there is no way to extract the input data again from the output after hashing [7]. 2) Pre-image Resistance-Given an output value y, it is computationally infeasible to find x such that h(x) = y.…”
Section: Hash Functionmentioning
confidence: 99%