Information and network security 40 sha3 secure hash algorithm

Jul 23, 2021Download as pptx, pdf

0 likes128 views

SHA-3 is the latest member of the Secure Hash Algorithm family of standards, released by NIST on August 5, 2015. Although part of the same series of standards, SHA-3 is internally different from the MD5-like structure of SHA-1 and SHA-2

Information and Network Security:40
SHA 3 Secure Hash Algorithm
Prof Neeraj Bhargava
Vaibhav Khanna
Department of Computer Science
School of Engineering and Systems Sciences
Maharshi Dayanand Saraswati University Ajmer

SHA-3
• SHA-1 not yet "broken”
• but similar to broken MD5 & SHA-0
• so considered insecure
• SHA-2 (esp. SHA-512) seems secure
• shares same structure and mathematical operations as
predecessors so have concern
• NIST announced in 2007 a competition for the SHA-3
next gen NIST hash function
• goal to have in place by 2012 but not fixed

SHA-3
• As yet, SHA-1 has not yet been "broken".
• That is, no one has demonstrated a technique for producing collisions
in less than brute-force time.
• However, because SHA-1 is very similar in structure and in the basic
mathematical operations used to MD5 and SHA-0, both of which have
been broken, SHA-1 is considered insecure and has been phased out
for SHA-2.

SHA-3
• SHA-2, particularly the 512-bit version, would appear to provide
unassailable security.
• However, SHA-2 shares the same structure and mathematical
operations as its predecessors, and this is a cause for concern.
• Because it will take years to find a suitable replacement for SHA-2,
should it become vulnerable, NIST decided to begin the process of
developing a new hash standard.

SHA-3
• Accordingly, NIST announced in 2007 a competition to produce the
next generation NIST hash function, to be called SHA-3.
• NIST would like to have a new standard in place by the end of 2012,
but emphasizes that this is not a fixed timeline.

SHA-3 Requirements
replace SHA-2 with SHA-3 in any use
so use same hash sizes
preserve the online nature of SHA-2
so must process small blocks (512 / 1024 bits)
evaluation criteria
security close to theoretical max for hash sizes
cost in time & memory
characteristics: such as flexibility & simplicity

SHA-3 Requirements
• The basic requirements that must be satisfied by any candidate for
SHA-3 are:
• It must be possible to replace SHA-2 with SHA-3 in any application by
a simple drop-in substitution. Therefore, SHA-3 must support hash
value lengths of 224, 256, 384, and 512 bits.
• SHA-3 must preserve the online nature of SHA-2. That is, the
algorithm must process comparatively small blocks (512 or 1024 bits)
at a time instead of requiring that the entire message be buffered in
memory before

SHA-3 Requirements
• Beyond these basic requirements, NIST has defined a set of
evaluation criteria. These criteria are designed to reflect the
requirements for the main applications supported by SHA-2, and are:
• • Security: The strength of SHA-3 should be close to the theoretical
maximum for the different required hash sizes, and for both preimage
resistance and collision resistance. SHA-3 algorithms must be
designed to resist any potentially successful attack on SHA-2 functions

SHA-3 Requirements
• • Cost: be both time and memory efficient over a range of hardware
platforms.
• • Algorithm and implementation characteristics: such as flexibility
(e.g., tunable parameters for security/performance tradeoffs,
opportunity for parallelization, and so on), and simplicity (which
makes it easier to analyze the security properties of the algorithm)

Assignment
• What is SHA 3 Secure Hash Algorithm
• Discuss the requirements of SHA 3

The Secure Hash Algorithm (SHA) is a cryptographic hash function developed by the US National Security Agency. SHA-512 is the latest version that produces a 512-bit hash value. It processes message blocks of 1024 bits using an 80-step compression function that updates a 512-bit buffer. Each step uses a 64-bit value derived from the message and a round constant. SHA-512 supports messages up to 2^128 bits in length and adds between 1 and 1023 padding bits as needed.

The SHA Hashing AlgorithmBob Landstrom

SHA-3rokham khawaja

The document discusses the SHA-3 algorithm, which is the latest member of the Secure Hash Algorithm family of standards released by NIST in 2015. It provides an overview of the limitations of previous SHA standards like SHA-1 and SHA-2, the history and design of SHA-3, which uses the Keccak algorithm and sponge construction. Later sections cover specifics of SHA-3 like padding, the block permutation, and implementations in various cryptography libraries.

Design of Secure Hash Algorithm(SHA)Saravanan T.M

Information and data security cryptographic hash functionsMazin Alwaaly

This document discusses hash functions and their cryptographic applications. It begins by defining hash functions and their properties like one-wayness and collision resistance. It then discusses various applications of cryptographic hash functions like message authentication codes, digital signatures, password files, and more. It provides details on how hash functions are used for message authentication and digital signatures. It also describes the Secure Hash Algorithm family of hash functions like SHA-1, SHA-2, and the NIST competition for the SHA-3 standard.

ch12.pptSomuPatil8

Cryptography and Network Security Chapter 12 discusses hash and message authentication code (MAC) algorithms. It covers popular hash functions like SHA-512 and Whirlpool, as well as how to construct MACs using hash-based MACs like HMAC and cipher-based MACs like CMAC. HMAC is the preferred way to construct a MAC using a cryptographic hash function. CMAC improves on CBC-MAC by using two keys and padding to avoid message size limitations.

HMAC&CMAC.pptDrVASAVIBANDE

SHA 3 algorithm introduction, diagram, designSohaKhan63

The document discusses the SHA-3 algorithm, which was selected as the winner of a NIST competition to develop a new cryptographic hash function. SHA-3 uses the Keccak algorithm and sponge construction, absorbing data into a state and transforming it using a permutation function. It supports hash values of 224, 256, 384, or 512 bits. SHA-3 aims to provide improved security over earlier functions like SHA-1 and SHA-2 by addressing potential weaknesses.

Secure Hash Algorithm (SHA)ShahDhruv21

The document discusses the Secure Hash Algorithm (SHA) and provides details about its purpose, working, steps, and applications. SHA was developed by NIST and NSA to provide authentication, not encryption. It works by hashing message content into fixed-length values to detect changes to data. The steps involve padding bits, appending length, dividing input into blocks, initializing variables, and processing blocks by copying variables and dividing the block into sub-blocks. SHA is used for password logins, digital signatures, integrity checking, and authentication in applications like PGP, SSL, and SSH.

Shaha123

Hash functions take a variable-length input and produce a fixed-length output. They are used to verify data integrity and ensure data has not been altered. Cryptographic hash functions have properties of being one-way and collision resistant. Secure Hash Algorithm 512 (SHA-512) is an iterative cryptographic hash function that produces a 512-bit hash value. It works by processing the input message in 1024-bit blocks through 80 rounds of compression functions using logical operations and round constants. SHA-512 and other cryptographic hash functions have applications in security protocols like TLS, PGP, and DNSSEC.

crypto secure-hash-algorithm-versions.pptshuchiagarwal12

The document describes the Secure Hash Algorithm (SHA) and its variants SHA-1 and SHA-512. SHA was originally designed by NIST and NSA in 1993 to produce 160-bit hash values from messages of any size. It was later revised as SHA-1 in 1995. SHA-512, introduced in 2002, produces 512-bit hash values and has an increased security level compared to SHA-1. Both algorithms work by padding the input message, appending its length, dividing it into blocks, initializing a chaining variable, and processing each block through multiple rounds that update the chaining variable.

Hash mac algorithmsFraboni Ec

This document provides an overview of hash functions, secure hash algorithms (SHA), and HMAC. It describes how hash functions work by taking a message and producing a fixed-size hash value. SHA algorithms like SHA-1, SHA-256, SHA-384, and SHA-512 are described as secure hash functions developed by NIST. The document outlines the 5 steps of the SHA-512 algorithm: 1) append padding bits, 2) append length, 3) initialize hash buffer, 4) process message in blocks, and 5) output hash value. HMAC is then introduced as a way to incorporate a secret key into an existing hash algorithm like MD5 or SHA-1 to produce a message authentication code

Hash mac algorithmsTony Nguyen

This document discusses hash and MAC algorithms. It provides details on hash functions, the Secure Hash Algorithm (SHA), and HMAC. Hash functions take a message and produce a fixed-size hash value. SHA is a secure hash algorithm developed by NIST that produces 160-bit or longer hash values. It works by padding the message, appending the length, initializing buffers, processing the message in blocks through compression functions, and outputting the hash value. HMAC is a MAC algorithm that incorporates a secret key into an existing hash function like MD5 or SHA. It works by padding the key, XORing it with ipad or opad, appending the message or hash, and applying the hash function to produce the

Hash mac algorithmsLuis Goldster

Hash mac algorithmsDavid Hoen

This document discusses hash and MAC algorithms. It provides details on hash functions, the Secure Hash Algorithm (SHA), and HMAC. Hash functions take a message and produce a fixed-size hash value. SHA is a secure hash algorithm developed by NIST that produces 160-bit or longer hash values. It works by padding and processing the message in blocks, using a compression function and initialization vector. HMAC is a MAC algorithm that incorporates a secret key into the hashing process. It works by XORing the key with ipad and opad pads, hashing the padded message, and outputting the result. HMAC allows existing hash functions to be used for message authentication in a way that relies on the secret

Hash mac algorithmsJames Wong

This document discusses hash and MAC algorithms. It provides details on hash functions, the Secure Hash Algorithm (SHA), and HMAC. Hash functions take a message and produce a fixed-size hash value. SHA is a secure hash algorithm developed by NIST that produces 160-bit or longer hash values. It works by padding and processing the message in blocks, using a compression function and initialization vector. HMAC is a MAC algorithm that incorporates a secret key into an existing hash function like MD5 or SHA. It works by XORing the key with ipad and opad pads, hashing the padded message, and outputting the result. HMAC executes with similar speed to the underlying hash function.

Hash& mac algorithmsHarry Potter

This document discusses hash and MAC algorithms. It provides details on hash functions, the Secure Hash Algorithm (SHA), and HMAC. Hash functions take a message and produce a fixed-size hash value. SHA is a secure hash algorithm developed by NIST that produces 160-bit or longer hash values. It involves padding the message, initializing a buffer, processing the message in blocks through a compression function, and outputting the final hash. HMAC is a MAC algorithm that incorporates a secret key into an existing hash function like MD5 or SHA. It pads and XORs the key, hashes the result with the message, then hashes again with a padded key to produce the MAC value.

Hash mac algorithmsYoung Alista

Secure Hash AlgorithmVishakha Agarwal

Secure Hash Algorithm (SHA) was developed by NIST and NSA to hash messages into fixed-length message digests. SHA has multiple versions including SHA-1, SHA-2, and SHA-3. SHA-1 produces a 160-bit message digest and works by padding the input message, appending the length, dividing into blocks, initializing variables, and processing blocks through 80 rounds of operations to output the digest. SHA-512 is closely modeled after SHA-1 but produces a 512-bit digest and uses 1024-bit blocks.

presentation on keccak algorithm functionalitySohaKhan63

The document discusses the SHA-3 algorithm, which uses the Keccak algorithm to hash inputs into fixed-length outputs. SHA-3 was developed through a public competition after vulnerabilities were found in earlier hash functions like SHA-1 and SHA-2. It uses a sponge construction and Keccak-f permutation to absorb data into a state and squeeze out the hashed output. SHA-3 supports four hash lengths and aims to provide security against cryptographic attacks.

keccak.ppt that is about introduction and basicsSohaKhan63

secure hash function for authentication in CNSNithyasriA2

Cryptographic hash functions are used for message authentication, digital signatures, and other applications. They must be resistant to preimage, second preimage, and collision attacks. Popular hash functions include SHA-1, SHA-2 (SHA-256, SHA-384, SHA-512), and the new standard SHA-3. SHA-3 uses a sponge construction that partitions inputs into blocks processed sequentially by an iteration function f to produce an output block. This provides resistance against cryptanalysis attacks on previous hash functions.

NSC_Unit-III_final.pptDrVASAVIBANDE

This document discusses message authentication and the different functions that can be used for message authentication: message encryption, hash functions, and message authentication codes (MACs). It outlines the security requirements for message authentication and describes how symmetric and public-key encryption, hash functions, and MACs can provide authentication. It provides details on how MACs work and their properties. It also discusses hash functions and how they are used for message integrity checks, message authentication codes, and digital signatures.

cryptography summary hash function slidessarala9

Hash Functions - Uses, Requirements, Secure Hash AlgorithmGoldenMIT

PERFORMANCE ANALYSIS OF SHA-2 AND SHA-3 FINALISTSijcisjournal

National Institute of Science and Technology (NIST) published the first Secure Hash Standard SHA-0 in 1993 as Federal Information Processing Standard publication (FIPS PUBS) which two years later was replaced by SHA-1 to improve the original design and added SHA-2 family by subsequent revisions of the FIPS. Most of the widely used cryptographic hash functions are under attack today. With the need to maintain a certain level of security, NIST had selected new cryptographic hash function through public competition. The winning algorithm, Keccak will not only have to establish a strong security, but also has to exhibit good performance and capability to run. In this context, we have analysed SHA-3 finalists along with the used standard SHA-2. The performances of respective algorithms are evaluated by computing cycles per byte. The empirical analysis shows that two SHA-3 finalists viz. Skein and BLAKE perform better which are nearly same as the performance of SHA-2.

PERFORMANCE ANALYSIS OF SHA-2 AND SHA-3 FINALISTSijcisjournal

Information and network security 47 authentication applicationsVaibhav Khanna

Information and network security 46 digital signature algorithmVaibhav Khanna

More Related Content

Similar to Information and network security 40 sha3 secure hash algorithm (20)

Secure Hash Algorithm (SHA)ShahDhruv21

Shaha123

crypto secure-hash-algorithm-versions.pptshuchiagarwal12

Hash mac algorithmsFraboni Ec

Hash mac algorithmsTony Nguyen

Hash mac algorithmsLuis Goldster

Hash mac algorithmsDavid Hoen

This document discusses hash and MAC algorithms. It provides details on hash functions, the Secure Hash Algorithm (SHA), and HMAC. Hash functions take a message and produce a fixed-size hash value. SHA is a secure hash algorithm developed by NIST that produces 160-bit or longer hash values. It works by padding and processing the message in blocks, using a compression function and initialization vector. HMAC is a MAC algorithm that incorporates a secret key into the hashing process. It works by XORing the key with ipad and opad pads, hashing the padded message, and outputting the result. HMAC allows existing hash functions to be used for message authentication in a way that relies on the secret

Hash mac algorithmsJames Wong

This document discusses hash and MAC algorithms. It provides details on hash functions, the Secure Hash Algorithm (SHA), and HMAC. Hash functions take a message and produce a fixed-size hash value. SHA is a secure hash algorithm developed by NIST that produces 160-bit or longer hash values. It works by padding and processing the message in blocks, using a compression function and initialization vector. HMAC is a MAC algorithm that incorporates a secret key into an existing hash function like MD5 or SHA. It works by XORing the key with ipad and opad pads, hashing the padded message, and outputting the result. HMAC executes with similar speed to the underlying hash function.

Hash& mac algorithmsHarry Potter

This document discusses hash and MAC algorithms. It provides details on hash functions, the Secure Hash Algorithm (SHA), and HMAC. Hash functions take a message and produce a fixed-size hash value. SHA is a secure hash algorithm developed by NIST that produces 160-bit or longer hash values. It involves padding the message, initializing a buffer, processing the message in blocks through a compression function, and outputting the final hash. HMAC is a MAC algorithm that incorporates a secret key into an existing hash function like MD5 or SHA. It pads and XORs the key, hashes the result with the message, then hashes again with a padded key to produce the MAC value.

Hash mac algorithmsYoung Alista

Secure Hash AlgorithmVishakha Agarwal

presentation on keccak algorithm functionalitySohaKhan63

keccak.ppt that is about introduction and basicsSohaKhan63

secure hash function for authentication in CNSNithyasriA2

NSC_Unit-III_final.pptDrVASAVIBANDE

cryptography summary hash function slidessarala9

Hash Functions - Uses, Requirements, Secure Hash AlgorithmGoldenMIT

PERFORMANCE ANALYSIS OF SHA-2 AND SHA-3 FINALISTSijcisjournal

Secure Hash Algorithm (SHA)ShahDhruv21

Shaha123

crypto secure-hash-algorithm-versions.pptshuchiagarwal12

Hash mac algorithmsFraboni Ec

Hash mac algorithmsTony Nguyen

Hash mac algorithmsLuis Goldster

Hash mac algorithmsDavid Hoen

Hash mac algorithmsJames Wong

Hash& mac algorithmsHarry Potter

Hash mac algorithmsYoung Alista

Secure Hash AlgorithmVishakha Agarwal

presentation on keccak algorithm functionalitySohaKhan63

keccak.ppt that is about introduction and basicsSohaKhan63

secure hash function for authentication in CNSNithyasriA2

NSC_Unit-III_final.pptDrVASAVIBANDE

cryptography summary hash function slidessarala9

Hash Functions - Uses, Requirements, Secure Hash AlgorithmGoldenMIT

PERFORMANCE ANALYSIS OF SHA-2 AND SHA-3 FINALISTSijcisjournal

More from Vaibhav Khanna (20)

Information and network security 47 authentication applicationsVaibhav Khanna

Information and network security 46 digital signature algorithmVaibhav Khanna

Information and network security 45 digital signature standardVaibhav Khanna

Information and network security 44 direct digital signaturesVaibhav Khanna

Information and network security 43 digital signaturesVaibhav Khanna

Information and network security 42 security of message authentication codeVaibhav Khanna

Information and network security 41 message authentication codeVaibhav Khanna

Message authentication aims to protect integrity, validate originator identity, and provide non-repudiation. It addresses threats like masquerading, content or sequence modification, and source/destination repudiation. A Message Authentication Code (MAC) provides assurance that a message is unaltered and from the sender by appending a cryptographic checksum to the message dependent on the key and content. The receiver can validate the MAC to verify integrity and authenticity.

Information and network security 38 birthday attacks and security of hash fun...Vaibhav Khanna

Information and network security 37 hash functions and message authenticationVaibhav Khanna

Information and network security 35 the chinese remainder theoremVaibhav Khanna

Information and network security 34 primalityVaibhav Khanna

Information and network security 33 rsa algorithmVaibhav Khanna

Information and network security 32 principles of public key cryptosystemsVaibhav Khanna

Information and network security 31 public key cryptographyVaibhav Khanna

Information and network security 30 random numbersVaibhav Khanna

Information and network security 29 international data encryption algorithmVaibhav Khanna

Information and network security 28 blowfishVaibhav Khanna

Information and network security 27 triple desVaibhav Khanna

Information and network security 26 aes decryption and implementational issuesVaibhav Khanna

Information and network security 25 algorithmic steps of aesVaibhav Khanna