Scribd
Upload
97 views

Sha 3

This document provides an overview of secure hash algorithms (SHA) including SHA-1, SHA-2, and SHA-3. It explains that SHA is used for checking data integrity, validating data authenticity. It describes the basic properties of hash functions including producing fixed-length outputs from variable-length inputs and being nearly impossible to derive the original message from the hash value. It then details the different versions of SHA including the key properties, security levels, and applications of SHA-1, SHA-2, and SHA-3.

Uploaded by

Ashish Maharjan
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
97 views

Sha 3

This document provides an overview of secure hash algorithms (SHA) including SHA-1, SHA-2, and SHA-3. It explains that SHA is used for checking data integrity, validating data authenticity. It describes the basic properties of hash functions including producing fixed-length outputs from variable-length inputs and being nearly impossible to derive the original message from the hash value. It then details the different versions of SHA including the key properties, security levels, and applications of SHA-1, SHA-2, and SHA-3.

Uploaded by

Ashish Maharjan
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 17

Central Department of Computer Science

and Technology

Presented By:
Dharmendra Thapa (Roll 29)

1
Why we need SHA?

• Checking Data Integrity


• Data Validating
• Authenticity of Data

2
• Take arbitrary length input and return
fixed length outputs
• Use input as a block and perform
mathematical operation for data
compression
• Output know as message digest(hash
value)
Secure Hash Algorithms • Collision Resistance
(SHA)
• Nearly Impossible to return original
message form hash value

3
SHA Family
• Original version of the 160-bit hash function published in 1993
SHA-0
under the name "SHA".
• Withdrawn shortly after publication due to an undisclosed
"significant flaw"

• Develop in 1995
• 160-bit
SHA-1 hash
earlier MD5 algorithm.
function which resembles the

• Use 512-bit as input and generate 40 hexadecimal digit(160-bit)

• Develop in 2001
• Use different block sizes, SHA-224 SHA-256 SHA-384
SHA-2 and SHA-512
• Use Merkle-Damgard Construction.

• Develop in 2012
• A hash function formerly called Keccak.
SHA-3 • Use Sponge Construction.
• Use different block sizes, 224/256/384/512 bits

4
SHA-1

5
SHA-1

6
SHA-2

7
SHA-2

SHA-224/SHA-256 384/SHA-512

8
• History
• NIST call for algorithm for SHA-3 in
Nov 2007
• 64 submission in oct 2008
• 5 algorithms are selected in dec 2010
• Keccak is nominated as SHA-3 in oct
2012
SHA-3
• Introduction
• The Hash Function based on Sponge
Construction.
• 24 rounds
• Variant are, 224/256/384/512 bits.
• Used in SSL/SSH/TLS/PGP,
Cryptocurrencies, Digital Certificates

9
Working of SHA-3

10
Working of SHA-3

State :
The State is represented by 3-D array.

The state array is 5*5*w in size. (w= 2L)


b=25* 2L, L=0,1,2,…,6
b ∈ {25,50,100,200,400,800,1600}

Round :
Number of round can be calculate by
nr = 12+2*L

11
Working of SHA-3

12
Working of SHA-3
The θ Step is to view the state as a
2Darray (more precisely: a 5×5
array), where each array element
consists of a single word with w bits

The next two steps compute an


auxiliary 5×5 array B from the state
array S. Note
that B[i, j] refers to a word with w
bits

The χ Step manipulates the B array


computed in the previous step and
places the result in the state array S

The Iota Step is the most


straightforward one. It adds a
predefined w-bit constant to the lane
at location [0,0] of the state array S.

13
SHA-3 Specification

14
Comparison between SHA-1, SHA-2 and SHA-3

SHA-1 SHA-2 SHA-3

Block size: 512 bits Block size: 512/1024 bits Block size: 1152/1088/8
32/576 bits
Hash Digest Size: 256 bits (i.e., 32
Hash Digest Size: 160 bits (i.e., 20
bytes), or 40 hexadecimal digits bytes), or 64 hexadecimal digits/512 Hash Digest Size: 224/256/384/512
bits (i.e., 64 bytes), or 128 bits (i.e., 28/32/48/64 bytes), or
Rounds: 80 (4 groups of 20 rounds) hexadecimal digits 56/64/96/128 hexadecimal digits

Construction: Merkle–Damgård Rounds: 64 (for SHA-224 and Rounds: 24


SHA-256)/80 (SHA-384/SHA-512)
Security Level: Low Construction: Sponge (Keccak)
Construction: Merkle–Damgård
Application: Previously widely Security Level: High
used in TLS and SSL. Still used Security Level: High
for HMAC Application: Used to replace SHA-
Application: Widely used in: 2 when necessary (in specific
Security applications and protocols circumstances).
(e.g., TLS, SSL, PGP, SSH,
S/MIME, Ipsec), Cryptocurrencies
transactions validation, Digital
certificates

15
References

1. Christof Paar. (2023) Lecture 21 (update): SHA-3 Hash Function by


Christof Paar. [Online].
https://www.youtube.com/watch?v=JWskjzgiIa4&t=3337s

2. Digicert. (2023) Hash Algorithm Comparison: MD5, SHA-1, SHA-2 &


SHA-3. [Online]. https://codesigningstore.com/hash-algorithm-comparison

3. Karmani, Mouna & Benhadjyoussef, Noura & Hamdi, Belgacem &


Machhout, Mohsen. (2021). The SHA3-512 Cryptographic Hash Algorithm
Analysis And Implementation On The Leon3 Processor. International
Journal of Engineering Trends and Technology. 69. 71-78.
10.14445/22315381/IJETT-V69I6P210.

4. National Institute of Standards and Technolog, "SHA-3 Standard:


Permutation-Based Hash and," FEDERAL INFORMATION PROCESSING
STANDARDS, Aug 2015.

16
Thank You

17

You might also like