Secure Hash Algorithm (SHA-512)
Download as pptx, pdf25 likes58,480 views
The document provides an in-depth overview of the Secure Hash Algorithm 512 (SHA-512), detailing its structure, processing steps, and cryptographic functions including word expansion, compression functions, and constant calculations. It also includes examples of SHA-512 calculations and its applications, such as in secure password hashing and data integrity verification. Additionally, the document discusses cryptanalysis related to SHA-512, highlighting various attack methods and their implications.
1 of 22
Downloaded 1,037 times
Ad
Recommended
SHA- Secure hashing algorithm
SHA- Secure hashing algorithmRuchi Maurya This document outlines the Secure Hashing Algorithm (SHA), focusing on SHA-1, developed by NIST and NSA in 1993 as a federal information processing standard. It details the functioning of SHA-1, including its input requirements, operational steps, and the processing of 512-bit blocks through multiple rounds and iterations. The algorithm is used in various applications, such as secure password hashing and digital signatures.
Secure Hash Algorithm
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.
MD5 ALGORITHM.pptx
MD5 ALGORITHM.pptxRajapriya82 The MD5 algorithm is a cryptographic hash function that generates a 128-bit digest from a message of any length. It works by first padding the message to a length that is a multiple of 512 bits, then appending the message length. It initializes buffers and processes the message in 512-bit blocks using four rounds of 16 operations each, applying different functions to update the buffers. The final buffer values become the MD5 digest. It is commonly used to verify file integrity but is now considered insecure due to possible hash collisions.
Hash Function
Hash Function ssuserdfb2da This document discusses cryptographic hash functions including their applications in message authentication and digital signatures. It describes the requirements for hash functions to be secure including resistance to brute force attacks and cryptanalysis. The document outlines some simple hash functions and provides details on the Secure Hash Algorithm (SHA) family of cryptographic hash functions used in standards like SHA-512 which operates on 1024-bit blocks through 80 rounds. It also mentions NIST's selection of the Keccak algorithm as the new SHA-3 standard.
Message digest 5
Message digest 5Tirthika Bandi MD5 is a cryptographic hash function that produces a 128-bit hash value for a message of any length. It was originally designed to provide authentication of digital signatures but is no longer considered reliable for cryptography due to techniques that can generate collisions. MD5 operates by padding the input, appending the length, dividing into blocks, initializing variables, processing blocks through 4 rounds of operations with different constants each round, and outputting the hash value. While it was intended to be difficult to find collisions or recover the input, MD5 is no longer considered cryptographically secure due to attacks demonstrating collisions.
SHA 1 Algorithm
SHA 1 AlgorithmShiva RamDam The document describes the SHA-1 hashing algorithm. SHA-1 produces a 160-bit hash value from an input of arbitrary length. It works by padding the input, appending the length, initializing hash buffers, processing the message through 80 rounds of compression, and outputting the final hash value. The compression function divides the padded message into 16-word blocks and schedules the words through the rounds using a message scheduling algorithm. It performs logical and bitwise operations on the words and chaining variables to generate a new hash.
Sha
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.
unit 4.pptx of hash function in cryptography
unit 4.pptx of hash function in cryptographyNithyasriA2 This document discusses cryptographic hash functions and their applications. It provides 3 key points:
1. Cryptographic hash functions are algorithms that take a variable-length input and produce a fixed-length output (hash value) that uniquely identifies the input. They have properties of one-wayness and collision resistance.
2. Hash functions have important applications in message authentication, digital signatures, and password protection by providing a means to verify message integrity and authenticity.
3. The security of cryptographic hash functions depends on their resistance to brute-force attacks and cryptanalysis. Attacks aim to find collisions or preimages more efficiently than brute force search. Iterated hash functions are most commonly used due to their security
DES
DESNaga Srimanyu Timmaraju DES was developed as a standard for communications and data protection by an IBM research team in response to a request from the National Bureau of Standards (now called NIST). DES uses the techniques of confusion and diffusion achieved through numerous permutations and the XOR operation. The basic DES process encrypts a 64-bit block using a 56-bit key over 16 complex rounds consisting of permutations and key-dependent calculations. Triple DES was developed as a more secure version of DES.
Block Cipher and its Design Principles
Block Cipher and its Design PrinciplesSHUBHA CHATURVEDI This document discusses block ciphers, including their definition, structure, design principles, and avalanche effect. A block cipher operates on fixed-length blocks of bits and uses a symmetric key. It encrypts bits in blocks rather than one by one. Block ciphers have advantages like high diffusion but are slower than stream ciphers. They are built using the Feistel cipher structure with a number of rounds and keys. Important design principles for block ciphers include the number of rounds, design of the round function, and key schedule algorithm. The avalanche effect causes a small input change to result in a significant output change.
S/MIME
S/MIMEmaria azam S/MIME (Secure Multipurpose Internet Mail Extensions) allows users to securely send emails through encryption and digital signatures. It uses public key cryptography, with algorithms like RSA and ElGamal for encryption and DSS and RSA for digital signatures. S/MIME supports encrypting the message contents, digitally signing the message, or both. It defines new MIME types to implement these security features for email. Other technologies like PGP provide similar email security functionality to S/MIME.
Message Authentication Code & HMAC
Message Authentication Code & HMACKrishna Gehlot This document discusses message authentication codes (MACs). It explains that MACs use a shared symmetric key to authenticate messages, ensuring integrity and validating the sender. The document outlines the MAC generation and verification process, and notes that MACs provide authentication but not encryption. It then describes HMAC specifically, which applies a cryptographic hash function to the message and key to generate the MAC. The key steps of the HMAC process are detailed.
Modern Block Cipher- Modern Symmetric-Key Cipher
Modern Block Cipher- Modern Symmetric-Key CipherMahbubur Rahman The document provides a detailed introduction to modern symmetric-key ciphers, specifically focusing on block ciphers that encrypt and decrypt fixed-size blocks of data using symmetric keys. It discusses various concepts including substitution and transposition methods, the properties of operations like exclusive-or, and the structure of product ciphers which enhance security through diffusion and confusion. The document also covers the design challenges associated with key sizes and mapping in transposition and substitution ciphers.
Classical encryption techniques
Classical encryption techniquesDr.Florence Dayana The document discusses classical encryption techniques emphasizing symmetric and asymmetric encryption, defining key concepts like plaintext, ciphertext, and various ciphers, including the Caesar cipher, Playfair cipher, and the Vigenère cipher. It explains different cryptographic systems, models of symmetric encryption, and the security aspects of ciphers, including brute-force attacks and transposition techniques. Additionally, it highlights the historical context of encryption methods and their evolution with a focus on both mathematical and procedural underpinnings.
Block cipher modes of operation
Block cipher modes of operation harshit chavda The document describes block ciphers, a foundational element in cryptography that encrypts fixed-length blocks of data using symmetric keys. It outlines five modes of operation defined by NIST to handle messages of varying lengths, including Electronic Codebook (ECB), Cipher Block Chaining (CBC), Cipher Feedback (CFB), Output Feedback (OFB), and Counter mode (CTR), each with specific encryption and decryption processes as well as security considerations. The text highlights the importance of initialization vectors (IVs) in ensuring encryption security and explains vulnerabilities associated with reusing IVs and patterns in ciphertext.
Pgp pretty good privacy
Pgp pretty good privacyPawan Arya Pretty Good Privacy (PGP) is an open-source software for email security, providing authentication through digital signatures and confidentiality via symmetric encryption among other features. PGP uses a combination of session keys, public/private keys, and various cryptographic algorithms for secure communication, ensuring message integrity and confidentiality. Its growth is attributed to its availability, flexibility across platforms, and suitability for secure communication over the internet.
DES (Data Encryption Standard) pressentation
DES (Data Encryption Standard) pressentationsarhadisoftengg This document discusses data encryption methods. It defines encryption as hiding information so it can only be accessed by those with the key. There are two main types: symmetric encryption uses one key, while asymmetric encryption uses two different but related keys. Encryption works by scrambling data using techniques like transposition, which rearranges the order, and substitution, which replaces parts with other values. The document specifically describes the Data Encryption Standard (DES) algorithm and the public key cryptosystem, which introduced the innovative approach of using different keys for encryption and decryption.
RSA ALGORITHM
RSA ALGORITHMDr. Shashank Shetty The document summarizes the RSA encryption algorithm. It begins by explaining that RSA was developed in 1977 by Rivest, Shamir and Adleman. It then provides an example to demonstrate how RSA works step-by-step, generating keys, encrypting a message and decrypting the ciphertext. Finally, it discusses some challenges with breaking RSA encryption, including brute force attacks and mathematical attacks based on factoring the encryption keys, as well as timing attacks that aim to deduce keys based on variations in processing time.
Key management
Key managementSujata Regoti Key management involves the generation, exchange, storage, use, and replacement of cryptographic keys within a cryptosystem, addressing the entire key lifecycle to combat threats such as key compromise. Techniques include symmetric and public-key encryption, with notable algorithms like the Diffie-Hellman key exchange introduced in 1976 for secure key exchange. Digital certificates serve as identity documents that bind public keys to individuals or organizations, validated by certification authorities to facilitate secure communications.
block ciphers
block ciphersAsad Ali The document discusses secret key cryptography, which involves using the same key for both encryption and decryption, and is classified into block and stream ciphers. It details the workings of various ciphers, particularly the Feistel cipher structure, including key generation, encryption, and decryption processes for the Data Encryption Standard (DES). Finally, it addresses the design principles, properties of good ciphers, and some controversies surrounding DES's key length and security.
Message authentication
Message authenticationCAS The document discusses computer security focusing on message authentication, highlighting the requirements for message integrity and sender validation. It covers methods such as symmetric and public-key encryption, hash functions, message authentication codes (MAC), and HMAC, explaining their roles in ensuring message security against various attacks. The content serves as an outline for effective communication protocol management in IT, emphasizing the importance of confidentiality and authentication mechanisms.
Cryptography & Network Security
Cryptography & Network SecurityFahad Shaikh The document discusses the benefits of meditation for reducing stress and anxiety. Regular meditation practice can calm the mind and body by lowering heart rate and blood pressure. Meditation may also have psychological benefits like improved focus, emotional regulation, and reduced worrying.
Substitution techniques
Substitution techniquesvinitha96 - Substitution techniques involve replacing the letters of plaintext with other letters, numbers or symbols. The main substitution techniques are Caesar cipher, monoalphabetic cipher, Playfair cipher and Hill cipher.
- The Caesar cipher replaces each letter with the letter three positions down the alphabet. The monoalphabetic cipher uses a single alphabetic key for the entire message. The Playfair cipher encrypts pairs of letters based on a 5x5 grid generated from a keyword. The Hill cipher encrypts blocks of letters as numerical values using a matrix-based approach.
Rotor machine,subsitution technique
Rotor machine,subsitution techniquekirupasuchi1996 This document discusses rotor machines, which are electro-mechanical stream cipher devices used to encrypt and decrypt secret messages. Rotor machines were widely used for cryptography from the 1920s to 1970s. The most famous example is the German Enigma machine, whose messages were deciphered by the Allies during World War II to produce intelligence code-named Ultra. The document also briefly mentions that substitution ciphers encrypt by replacing plaintext units like single letters or pairs of letters with ciphertext units.
Diffie hellman key exchange algorithm
Diffie hellman key exchange algorithmSunita Kharayat The document explains the Diffie-Hellman key exchange, a foundational method for securely sharing cryptographic keys over a public channel, introduced by Whitfield Diffie and Martin Hellman in 1976. It outlines the algorithm's mechanics, including the use of prime numbers and primitive roots, and discusses potential vulnerabilities, such as the man-in-the-middle attack. Additionally, it presents alternative solutions for secure communication, such as the key distribution center (KDC) while highlighting the challenges associated with replay attacks.
Public Key Cryptography
Public Key CryptographyGopal Sakarkar Public key cryptography uses two keys, a public key that can encrypt messages and a private key that decrypts messages. It has six components: plain text, encryption algorithm, public and private keys, ciphertext, and decryption algorithm. Some key characteristics are that it is computationally infeasible to determine the private key from the public key alone, and encryption/decryption is easy when the relevant key is known. The requirements of public key cryptography are that it is easy to generate a public-private key pair, easy to encrypt with the public key, easy for the recipient to decrypt with the private key, and infeasible to determine the private key from the public key or recover the plaintext from the ciphertext and public key alone
Polyalphabetic Substitution Cipher
Polyalphabetic Substitution CipherSHUBHA CHATURVEDI The document discusses various cipher techniques including polyalphabetic ciphers, the Vigenere cipher, homophonic substitution cipher, and the Polybius square. It provides examples of encrypting and decrypting messages using the Vigenere cipher and Polybius square. It also gives the formula for encrypting and decrypting messages using the Vigenere cipher algebraically by converting letters to numbers.
Hash Function
Hash FunctionSiddharth Srivastava This document discusses message authentication techniques including message encryption, message authentication codes (MACs), and hash functions. It describes how each technique can be used to authenticate messages and protect against various security threats. It also covers how symmetric and asymmetric encryption can provide authentication when used with MACs or digital signatures. Specific MAC and hash functions are examined like HMAC, SHA-1, and SHA-2. X.509 is introduced as a standard for digital certificates.
SHA512.pptx
SHA512.pptxssuserb4287c SHA-512 is a cryptographic hash function that produces a 512-bit hash value. It is part of the SHA-2 family and was developed by the National Institute of Standards and Technology. SHA-512 operates by processing message blocks through 80 rounds of computations that include word expansion, compression, and round functions to update digest values. It is commonly used to authenticate files and for password hashing.
Chapter 7-Hash-Function in Cryptography.ppt
Chapter 7-Hash-Function in Cryptography.pptKrishnenduRarhi The document discusses various cryptographic hash functions, focusing on SHA-512 and MD5, including their structures and resistance to attacks. It outlines SHA-512's message length limitations, padding requirements, and compression functions, while also detailing MD5's processing methodology and known vulnerabilities. The importance of preimage resistance, second preimage resistance, and collision resistance in cryptographic hash functions is emphasized throughout.
More Related Content
What's hot (20)
DES
DESNaga Srimanyu Timmaraju DES was developed as a standard for communications and data protection by an IBM research team in response to a request from the National Bureau of Standards (now called NIST). DES uses the techniques of confusion and diffusion achieved through numerous permutations and the XOR operation. The basic DES process encrypts a 64-bit block using a 56-bit key over 16 complex rounds consisting of permutations and key-dependent calculations. Triple DES was developed as a more secure version of DES.
Block Cipher and its Design Principles
Block Cipher and its Design PrinciplesSHUBHA CHATURVEDI This document discusses block ciphers, including their definition, structure, design principles, and avalanche effect. A block cipher operates on fixed-length blocks of bits and uses a symmetric key. It encrypts bits in blocks rather than one by one. Block ciphers have advantages like high diffusion but are slower than stream ciphers. They are built using the Feistel cipher structure with a number of rounds and keys. Important design principles for block ciphers include the number of rounds, design of the round function, and key schedule algorithm. The avalanche effect causes a small input change to result in a significant output change.
S/MIME
S/MIMEmaria azam S/MIME (Secure Multipurpose Internet Mail Extensions) allows users to securely send emails through encryption and digital signatures. It uses public key cryptography, with algorithms like RSA and ElGamal for encryption and DSS and RSA for digital signatures. S/MIME supports encrypting the message contents, digitally signing the message, or both. It defines new MIME types to implement these security features for email. Other technologies like PGP provide similar email security functionality to S/MIME.
Message Authentication Code & HMAC
Message Authentication Code & HMACKrishna Gehlot This document discusses message authentication codes (MACs). It explains that MACs use a shared symmetric key to authenticate messages, ensuring integrity and validating the sender. The document outlines the MAC generation and verification process, and notes that MACs provide authentication but not encryption. It then describes HMAC specifically, which applies a cryptographic hash function to the message and key to generate the MAC. The key steps of the HMAC process are detailed.
Modern Block Cipher- Modern Symmetric-Key Cipher
Modern Block Cipher- Modern Symmetric-Key CipherMahbubur Rahman The document provides a detailed introduction to modern symmetric-key ciphers, specifically focusing on block ciphers that encrypt and decrypt fixed-size blocks of data using symmetric keys. It discusses various concepts including substitution and transposition methods, the properties of operations like exclusive-or, and the structure of product ciphers which enhance security through diffusion and confusion. The document also covers the design challenges associated with key sizes and mapping in transposition and substitution ciphers.
Classical encryption techniques
Classical encryption techniquesDr.Florence Dayana The document discusses classical encryption techniques emphasizing symmetric and asymmetric encryption, defining key concepts like plaintext, ciphertext, and various ciphers, including the Caesar cipher, Playfair cipher, and the Vigenère cipher. It explains different cryptographic systems, models of symmetric encryption, and the security aspects of ciphers, including brute-force attacks and transposition techniques. Additionally, it highlights the historical context of encryption methods and their evolution with a focus on both mathematical and procedural underpinnings.
Block cipher modes of operation
Block cipher modes of operation harshit chavda The document describes block ciphers, a foundational element in cryptography that encrypts fixed-length blocks of data using symmetric keys. It outlines five modes of operation defined by NIST to handle messages of varying lengths, including Electronic Codebook (ECB), Cipher Block Chaining (CBC), Cipher Feedback (CFB), Output Feedback (OFB), and Counter mode (CTR), each with specific encryption and decryption processes as well as security considerations. The text highlights the importance of initialization vectors (IVs) in ensuring encryption security and explains vulnerabilities associated with reusing IVs and patterns in ciphertext.
Pgp pretty good privacy
Pgp pretty good privacyPawan Arya Pretty Good Privacy (PGP) is an open-source software for email security, providing authentication through digital signatures and confidentiality via symmetric encryption among other features. PGP uses a combination of session keys, public/private keys, and various cryptographic algorithms for secure communication, ensuring message integrity and confidentiality. Its growth is attributed to its availability, flexibility across platforms, and suitability for secure communication over the internet.
DES (Data Encryption Standard) pressentation
DES (Data Encryption Standard) pressentationsarhadisoftengg This document discusses data encryption methods. It defines encryption as hiding information so it can only be accessed by those with the key. There are two main types: symmetric encryption uses one key, while asymmetric encryption uses two different but related keys. Encryption works by scrambling data using techniques like transposition, which rearranges the order, and substitution, which replaces parts with other values. The document specifically describes the Data Encryption Standard (DES) algorithm and the public key cryptosystem, which introduced the innovative approach of using different keys for encryption and decryption.
RSA ALGORITHM
RSA ALGORITHMDr. Shashank Shetty The document summarizes the RSA encryption algorithm. It begins by explaining that RSA was developed in 1977 by Rivest, Shamir and Adleman. It then provides an example to demonstrate how RSA works step-by-step, generating keys, encrypting a message and decrypting the ciphertext. Finally, it discusses some challenges with breaking RSA encryption, including brute force attacks and mathematical attacks based on factoring the encryption keys, as well as timing attacks that aim to deduce keys based on variations in processing time.
Key management
Key managementSujata Regoti Key management involves the generation, exchange, storage, use, and replacement of cryptographic keys within a cryptosystem, addressing the entire key lifecycle to combat threats such as key compromise. Techniques include symmetric and public-key encryption, with notable algorithms like the Diffie-Hellman key exchange introduced in 1976 for secure key exchange. Digital certificates serve as identity documents that bind public keys to individuals or organizations, validated by certification authorities to facilitate secure communications.
block ciphers
block ciphersAsad Ali The document discusses secret key cryptography, which involves using the same key for both encryption and decryption, and is classified into block and stream ciphers. It details the workings of various ciphers, particularly the Feistel cipher structure, including key generation, encryption, and decryption processes for the Data Encryption Standard (DES). Finally, it addresses the design principles, properties of good ciphers, and some controversies surrounding DES's key length and security.
Message authentication
Message authenticationCAS The document discusses computer security focusing on message authentication, highlighting the requirements for message integrity and sender validation. It covers methods such as symmetric and public-key encryption, hash functions, message authentication codes (MAC), and HMAC, explaining their roles in ensuring message security against various attacks. The content serves as an outline for effective communication protocol management in IT, emphasizing the importance of confidentiality and authentication mechanisms.
Cryptography & Network Security
Cryptography & Network SecurityFahad Shaikh The document discusses the benefits of meditation for reducing stress and anxiety. Regular meditation practice can calm the mind and body by lowering heart rate and blood pressure. Meditation may also have psychological benefits like improved focus, emotional regulation, and reduced worrying.
Substitution techniques
Substitution techniquesvinitha96 - Substitution techniques involve replacing the letters of plaintext with other letters, numbers or symbols. The main substitution techniques are Caesar cipher, monoalphabetic cipher, Playfair cipher and Hill cipher.
- The Caesar cipher replaces each letter with the letter three positions down the alphabet. The monoalphabetic cipher uses a single alphabetic key for the entire message. The Playfair cipher encrypts pairs of letters based on a 5x5 grid generated from a keyword. The Hill cipher encrypts blocks of letters as numerical values using a matrix-based approach.
Rotor machine,subsitution technique
Rotor machine,subsitution techniquekirupasuchi1996 This document discusses rotor machines, which are electro-mechanical stream cipher devices used to encrypt and decrypt secret messages. Rotor machines were widely used for cryptography from the 1920s to 1970s. The most famous example is the German Enigma machine, whose messages were deciphered by the Allies during World War II to produce intelligence code-named Ultra. The document also briefly mentions that substitution ciphers encrypt by replacing plaintext units like single letters or pairs of letters with ciphertext units.
Diffie hellman key exchange algorithm
Diffie hellman key exchange algorithmSunita Kharayat The document explains the Diffie-Hellman key exchange, a foundational method for securely sharing cryptographic keys over a public channel, introduced by Whitfield Diffie and Martin Hellman in 1976. It outlines the algorithm's mechanics, including the use of prime numbers and primitive roots, and discusses potential vulnerabilities, such as the man-in-the-middle attack. Additionally, it presents alternative solutions for secure communication, such as the key distribution center (KDC) while highlighting the challenges associated with replay attacks.
Public Key Cryptography
Public Key CryptographyGopal Sakarkar Public key cryptography uses two keys, a public key that can encrypt messages and a private key that decrypts messages. It has six components: plain text, encryption algorithm, public and private keys, ciphertext, and decryption algorithm. Some key characteristics are that it is computationally infeasible to determine the private key from the public key alone, and encryption/decryption is easy when the relevant key is known. The requirements of public key cryptography are that it is easy to generate a public-private key pair, easy to encrypt with the public key, easy for the recipient to decrypt with the private key, and infeasible to determine the private key from the public key or recover the plaintext from the ciphertext and public key alone
Polyalphabetic Substitution Cipher
Polyalphabetic Substitution CipherSHUBHA CHATURVEDI The document discusses various cipher techniques including polyalphabetic ciphers, the Vigenere cipher, homophonic substitution cipher, and the Polybius square. It provides examples of encrypting and decrypting messages using the Vigenere cipher and Polybius square. It also gives the formula for encrypting and decrypting messages using the Vigenere cipher algebraically by converting letters to numbers.
Hash Function
Hash FunctionSiddharth Srivastava This document discusses message authentication techniques including message encryption, message authentication codes (MACs), and hash functions. It describes how each technique can be used to authenticate messages and protect against various security threats. It also covers how symmetric and asymmetric encryption can provide authentication when used with MACs or digital signatures. Specific MAC and hash functions are examined like HMAC, SHA-1, and SHA-2. X.509 is introduced as a standard for digital certificates.
Similar to Secure Hash Algorithm (SHA-512) (20)
SHA512.pptx
SHA512.pptxssuserb4287c SHA-512 is a cryptographic hash function that produces a 512-bit hash value. It is part of the SHA-2 family and was developed by the National Institute of Standards and Technology. SHA-512 operates by processing message blocks through 80 rounds of computations that include word expansion, compression, and round functions to update digest values. It is commonly used to authenticate files and for password hashing.
Chapter 7-Hash-Function in Cryptography.ppt
Chapter 7-Hash-Function in Cryptography.pptKrishnenduRarhi The document discusses various cryptographic hash functions, focusing on SHA-512 and MD5, including their structures and resistance to attacks. It outlines SHA-512's message length limitations, padding requirements, and compression functions, while also detailing MD5's processing methodology and known vulnerabilities. The importance of preimage resistance, second preimage resistance, and collision resistance in cryptographic hash functions is emphasized throughout.
crypto secure-hash-algorithm-versions.ppt
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.
Secure Hash Algorithm (SHA 256) - Detailed Architecture
Secure Hash Algorithm (SHA 256) - Detailed ArchitectureSaravananPalani22 SHA-256, a secure hashing algorithm developed by the NSA in 2001, produces a 256-bit hash and is part of the SHA-2 family, offering superior security compared to MD5, SHA-0, and SHA-1. The document outlines the pre-processing of input into a 512-bit format and the step-by-step process to generate the final hash, using examples like the hashing of the word 'password'. Additionally, it emphasizes the immense time required to perform collision attacks at current hash rates, making SHA-256 highly secure.
Cryptography-Hash-Functions.pptx
Cryptography-Hash-Functions.pptxAngeloChangcoco This document discusses cryptographic hash functions. It provides an overview of their usage, properties, structure, and attacks. Hash functions map messages of arbitrary length to fixed-length digests. They are used for applications like file integrity verification, password storage, and digital signatures. The document outlines the design of common hash functions like MD5 and SHA-1/2, and notes that MD5 is insecure while SHA-1 is becoming outdated. It discusses the need for a new secure hash standard, and the NIST SHA-3 competition to select standardized replacement functions.
Information and network security 39 secure hash algorithm
Information and network security 39 secure hash algorithmVaibhav Khanna 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.
Analysis and Evolution of SHA-1 Algorithm - Analytical Technique
Analysis and Evolution of SHA-1 Algorithm - Analytical TechniqueIJCNCJournal The document provides a comprehensive analysis of the SHA-1 cryptographic hash algorithm, detailing its 160-bit output and the mathematical processes involved in generating hash values. Despite being cryptographically broken, SHA-1 remains in use for various applications, with the paper discussing its theory, implementation, and various configurations. The analysis covers the algorithm's architecture, including message expansion, padding, word generation, and compression functions, illustrating the technical details necessary for understanding SHA-1's operation.
Analysis and Evolution of SHA-1 Algorithm - Analytical Technique
Analysis and Evolution of SHA-1 Algorithm - Analytical TechniqueIJCNCJournal The document analyzes the SHA-1 algorithm, a cryptographic hash function that produces a 160-bit hash value, and discusses its theoretical foundations and practical applications despite being cryptographically compromised. It details the algorithm's process, including message encoding, padding, chunking, and the use of mathematical techniques for word expansion, ultimately highlighting its ongoing relevance despite known vulnerabilities. The work aims to provide insights into SHA-1's operation, its relationship with other hash functions, and the structure of digital signatures.
27-SHA1.ppt
27-SHA1.pptPranjalSinha23 This document discusses hash functions and the Secure Hash Algorithm 1 (SHA-1). It describes the goals of hash functions as providing a unique fingerprint of a message through fast computation of a digest in a way that is one-way and makes collisions difficult to find. SHA-1 is presented as iterating over message blocks to compress them into a 160-bit digest value through repeated applications of a compression function. The compression function expands each block before applying four rounds of nonlinear mixing via modular addition and bitwise operations. The document raises the prospect of birthday attacks finding collisions in SHA-1 and implies its security may degrade over time.
Hash Function & Analysis
Hash Function & AnalysisPawandeep Kaur This document discusses hash functions and their analysis for a network security seminar. It begins by defining a hash function as a mathematical function that converts a large amount of data into a small string of integers. Common applications of hash functions include hash tables for quickly searching data, eliminating data redundancy, caches, bloom filters, and pattern matching. Cryptographic hash functions have properties like preimage and second preimage resistance as well as collision resistance. Popular cryptographic hash functions discussed include MD2, MD4, MD5, SHA-1, and SHA-2, along with their advantages, limitations, and examples of attacks.
Data streaming algorithms
Data streaming algorithmsHridyesh Bisht The document discusses data streaming algorithms, particularly focusing on approximate counting and hashing algorithms. It details concepts such as distinct elements counting, frequency estimation, and the workings of various hashing functions like MD5, SHA-1, and SHA-2. Additionally, it describes algorithms for approximating the f0-norm to count distinct items in data streams and highlights the applications of these algorithms in areas like data compression and artificial intelligence.
IRJET- Low Power and Simple Implementation of Secure Hashing Algorithm (SHA-2...
IRJET- Low Power and Simple Implementation of Secure Hashing Algorithm (SHA-2...IRJET Journal This document describes the implementation of the SHA-2 hashing algorithm on an FPGA. It discusses the SHA-2 algorithm and its variants SHA-224, SHA-256, SHA-384, and SHA-512. It describes the preprocessing, message scheduling, and compression functions of the SHA-256 algorithm in detail. The goal of the project is to implement the SHA-2 hashing algorithm in VHDL to generate hash values of fixed length from arbitrary length messages.
Hash Functions - Uses, Requirements, Secure Hash Algorithm
Hash Functions - Uses, Requirements, Secure Hash AlgorithmGoldenMIT The document discusses cryptographic hash functions, focusing on their properties, uses, and security requirements. It highlights the significance of SHA-1 and its successors, including SHA-256, SHA-384, and SHA-512, emphasizing their role in message integrity, authentication, and digital signatures. Additionally, it outlines issues related to hash functions, such as collision resistance and the importance of secure hash algorithms in modern applications.
Secure hashing algorithm
Secure hashing algorithmKarteek Paruchuri This document discusses secure hashing algorithms used for authentication rather than encryption. It provides an overview of the requirements for authentication including preventing masquerading, content modification, sequence modification, and timing modification. It then describes the basic theory behind hashing including producing a message digest, ensuring it is computationally infeasible to find two messages with the same digest, and being unable to recreate a message from its digest. Finally, it details the framework of the SHA-1 hashing algorithm including preprocessing the message, initializing buffers, processing the message in blocks, and outputting the final digest.
lecture13.pdf
lecture13.pdfAlaaElhaddad3 This document summarizes key concepts about hashing versus encryption and applications of hashing functions. It discusses how hashing is one-way while encryption is two-way, and how hashing is used for password storage and message authentication codes (MACs). It also provides an overview of the Secure Hash Algorithm (SHA) family and the structure and process of the SHA-512 hashing algorithm.
Hashfunction
HashfunctionFraboni Ec The document discusses hash functions and message authentication codes (MACs). It begins by defining hash functions and MACs, noting that hash functions generate a fingerprint for a message without a key while MACs use a keyed hash function. It then covers security requirements for hash functions like one-wayness and collision resistance. Popular hash functions are described like MD5, SHA-1, and the SHA-2 family. Constructions for hash functions based on block ciphers and iterated hash functions are also outlined. The document concludes by comparing hash functions and MACs and describing common MAC constructions.
Hashfunction
HashfunctionLuis Goldster The document discusses hash functions and message authentication codes (MACs). It begins by defining hash functions and MACs, noting that hash functions generate a fingerprint for a message without a key while MACs use a keyed hash function. It then covers security requirements for hash functions like one-wayness and collision resistance. Popular hash functions are described like MD5, SHA-1, and the SHA-2 family. Constructions for hash functions based on block ciphers and iterated hash functions are also outlined. The document concludes by comparing hash functions and MACs and describing common MAC constructions.
Hashfunction
HashfunctionJames Wong The document discusses hash functions and message authentication codes (MACs). It begins by defining hash functions and MACs, noting that hash functions generate a fingerprint for a message without a key while MACs use a keyed hash function. It then covers security requirements for hash functions like one-wayness and collision resistance. Popular hash functions are described like MD5, SHA-1, and the SHA-2 family. Constructions for hash functions based on block ciphers and iterated hash functions are also outlined. The document concludes by comparing hash functions and MACs and describing common MAC constructions.
Hashfunction
HashfunctionTony Nguyen The document discusses hash functions and message authentication codes (MACs). It begins by defining hash functions and MACs, noting that hash functions generate a fingerprint for a message without a key while MACs use a keyed hash function. It then covers security requirements for hash functions like one-wayness and collision resistance. Popular hash functions are described like MD5, SHA-1, and the SHA-2 family. Constructions for hash functions based on block ciphers and iterated hash functions are also outlined. The document concludes by comparing hash functions and MACs and describing common MAC constructions.
Ad
Recently uploaded (20)
Introduction to Natural Language Processing - Stages in NLP Pipeline, Challen...
Introduction to Natural Language Processing - Stages in NLP Pipeline, Challen...resming1 Lecture delivered in 2021. This gives an introduction to Natural Language Processing. It describes the use cases of NLP in daily life. It discusses the stages in NLP Pipeline. It highlights the challenges involved covering the different levels of ambiguity that could arise. It also gives a brief note on the present scenario with the latest language models, tools and frameworks/libraries for NLP.
Microwatt: Open Tiny Core, Big Possibilities
Microwatt: Open Tiny Core, Big PossibilitiesIBM Microwatt is a lightweight, open-source core based on the OpenPOWER ISA.
It’s designed for FPGAs and easy experimentation in chip design.
Ideal for education, prototyping, and custom silicon development.
Fully open, it empowers developers to learn, modify, and innovate.
Rapid Prototyping for XR: Lecture 4 - High Level Prototyping.
Rapid Prototyping for XR: Lecture 4 - High Level Prototyping.Mark Billinghurst This is lecture 4 in the course on Rapid Prototyping for XR, taught by Mark Billinghurst on June 11th, 2025. This lecture is about High Level Prototyping.
How to Un-Obsolete Your Legacy Keypad Design
How to Un-Obsolete Your Legacy Keypad DesignEpec Engineered Technologies For any number of circumstances, obsolescence risk is ever present in the electronics industry. This is especially true for human-to-machine interface hardware, such as keypads, touchscreens, front panels, bezels, etc. This industry is known for its high mix and low-volume builds, critical design requirements, and high costs to requalify hardware. Because of these reasons, many programs will face end-of-life challenges both at the component level as well as at the supplier level.
Redesigns and qualifications can take months or even years, so proactively managing this risk is the best way to deter this. If an LED is obsolete or a switch vendor has gone out of business, there are options to proceed.
In this webinar, we cover options to redesign and reverse engineer legacy keypad and touchscreen designs.
For more information on our HMI solutions, visit https://www.epectec.com/user-interfaces.
May 2025: Top 10 Read Articles in Data Mining & Knowledge Management Process
May 2025: Top 10 Read Articles in Data Mining & Knowledge Management ProcessIJDKP Data mining and knowledge discovery in databases have been attracting a significant amount of research, industry, and media attention of late. There is an urgent need for a new generation of computational theories and tools to assist researchers in extracting useful information from the rapidly growing volumes of digital data.
This Journal provides a forum for researchers who address this issue and to present their work in a peer-reviewed open access forum. Authors are solicited to contribute to the Journal by submitting articles that illustrate research results, projects, surveying works and industrial experiences that describe significant advances in the following areas, but are not limited to these topics only.
FUNDAMENTALS OF COMPUTER ORGANIZATION AND ARCHITECTURE
FUNDAMENTALS OF COMPUTER ORGANIZATION AND ARCHITECTUREShabista Imam FUNDAMENTALS OF COMPUTER ORGANIZATION AND ARCHITECTURE
By : Mostafa Abd-El-Barr & Hesham El-Rewini:: wiley
A complete guidance book
Deep Learning for Natural Language Processing_FDP on 16 June 2025 MITS.pptx
Deep Learning for Natural Language Processing_FDP on 16 June 2025 MITS.pptxresming1 This gives an introduction to how NLP has evolved from the time of World War II till this date through the advances in approaches, architectures and word representations. From rule based approaches, it advanced to statistical approaches. from traditional machine learning algorithms it advanced to deep neural network architectures. Deep neural architectures include recurrent neural networks, long short term memory, gated recurrent units, seq2seq models, encoder decoder models, transformer architecture, upto large language models and vision language models which are multimodal in nature.
دراسة حاله لقرية تقع في جنوب غرب السودان
دراسة حاله لقرية تقع في جنوب غرب السودانمحمد قصص فتوتة دراسة حاله لقرية تقع في جنوب غرب السودان لتوفير إحتياجاتها من الطاقه من مصادر الطاقات المتجدده المتوفره بها
Rapid Prototyping for XR: Lecture 1 Introduction to Prototyping
Rapid Prototyping for XR: Lecture 1 Introduction to PrototypingMark Billinghurst Lecture 1 of a course on Rapid Prototyping for XR taught by Mark Billinghurst at Oulu University on June 9th, 2025. This lecture presents an Introduction to Prototyping.
Deep Learning for Image Processing on 16 June 2025 MITS.pptx
Deep Learning for Image Processing on 16 June 2025 MITS.pptxresming1 This covers how image processing or the field of computer vision has advanced with the advent of neural network architectures ranging from LeNet to Vision transformers. It covers how deep neural network architectures have developed step-by-step from the popular CNNs to ViTs. CNNs and its variants along with their features are described. Vision transformers are introduced and compared with CNNs. It also shows how an image is processed to be given as input to the vision transformer. It give the applications of computer vision.
Generative AI & Scientific Research : Catalyst for Innovation, Ethics & Impact
Generative AI & Scientific Research : Catalyst for Innovation, Ethics & ImpactAlqualsaDIResearchGr Invited keynote at the Artificial Intelligence Symposium on AI-powered Research Innovation, taking place at ENSEM (L'École Nationale Supérieure d'Électricité et de Mécanique), Casablanca on June 21, 2025. I’ll be giving a keynote titled: "Generative AI & Scientific Research: Catalyst for Innovation, Ethics & Impact". Looking forward to engaging with researchers and doctoral students on how Generative AI is reshaping the future of science, from discovery to governance — with both opportunities and responsibilities in focus.
#AI hashtag#GenerativeAI #ScientificResearch #Innovation #Ethics #Keynote #AIinScience #GAI #ResearchInnovation #Casablanca
1. Thinking, Creative Thinking, Innovation
2. Societies Evolution from 1.0 to 5.0
3. AI - 3P Approach, Use Cases & Innovation
4. GAI & Creativity
5. TrustWorthy AI
6. Guidelines on The Responsible use of GAI In Research
Structured Programming with C++ :: Kjell Backman
Structured Programming with C++ :: Kjell BackmanShabista Imam Step into the world of high-performance programming with the Complete Guidance Book of C++ Programming—a definitive resource for mastering one of the most powerful and versatile languages in computer science.
Whether you're a beginner looking to learn the fundamentals or an intermediate developer aiming to sharpen your skills, this book walks you through C++ from the ground up. You'll start with basics like variables, control structures, and functions, then progress to object-oriented programming (OOP), memory management, file handling, templates, and the Standard Template Library (STL).
Rapid Prototyping for XR: Lecture 2 - Low Fidelity Prototyping.
Rapid Prototyping for XR: Lecture 2 - Low Fidelity Prototyping.Mark Billinghurst This is lecture 2 on the Rapid Prototyping for XR course taught by Mark Billingurst on June 10th 2025. This lecture is about Low Fidelity Prototyping.
Modern multi-proposer consensus implementations
Modern multi-proposer consensus implementationsFrançois Garillot Multi-proposer consensus protocols let multiple validators propose blocks in parallel, breaking the single-leader throughput bottleneck of classic designs. Yet the modern multi-proposer consensus implementation has grown a lot since HotStuff. THisworkshop will explore the implementation details of recent advances – DAG-based approaches like Narwhal and Sui’s Mysticeti – and reveal how implementation details translate to real-world performance gains. We focus on the nitty-gritty: how network communication patterns and data handling affect throughput and latency. New techniques such as Turbine-like block propagation (inspired by Solana’s erasure-coded broadcast) and lazy push gossip broadcasting dramatically cut communication overhead. These optimizations aren’t just theoretical – they enable modern blockchains to process over 100,000 transactions per second with finality in mere milliseconds redefining what is possible in decentralized systems.
Introduction to Python Programming Language
Introduction to Python Programming Languagemerlinjohnsy This PPT covers features, applications, variable, data types and statements in Python
Rapid Prototyping for XR: Lecture 5 - Cross Platform Development
Rapid Prototyping for XR: Lecture 5 - Cross Platform DevelopmentMark Billinghurst This is lecture 5 in the course about Rapid Prototyping for XR, taught by Mark Billinghurst. This lecture is about Cross Platform Development.
International Journal of Advanced Information Technology (IJAIT)
International Journal of Advanced Information Technology (IJAIT)ijait International journal of advanced Information technology (IJAIT) is a bi monthly open access peer-
reviewed journal, will act as a major forum for the presentation of innovative ideas, approaches,
developments, and research projects in the area advanced information technology applications and
services. It will also serve to facilitate the exchange of information between researchers and industry
professionals to discuss the latest issues and advancement in the area of advanced IT. Core areas of
advanced IT and multi-disciplinary and its applications will be covered during the conferences.
Ad
Secure Hash Algorithm (SHA-512)
- 1. Secure Hash Algorithm-512 (SHA-512) Course Code: CSE-6304 Course Id: Network Security Presented To Presented By Mr. Md. Shohidul Islam Md. Shariful Islam Assistant Professor Student id: 142419-P Department of CSE, DUET Session: 2014-15 1 April 5, 2016
- 2. Outlines SHA-512 overview processing of SHA-521 word expansion compression function round function additive constants example using SHA-512 applications cryptanalysis 2April 5, 2016
- 3. Overview developed by National Institute of Standards and Technology member of SHA-2 family latest version of Secure Hash Algorithm based on the Merkle-Damgard scheme maximum message size 2128-1 bits block size 1024 bits message digest size 512 bits number of rounds 80 word size 64 bits 3April 5, 2016
- 4. Figure: SHA-512 Processing of a Single 1024-Bit Block 4 Processing of SHA-512
- 5. Message block and digest word 5April 5, 2016 Figure: Padding and length field Figure: A message block and the digest as words
- 6. Processing of SHA-512 appending padding and fixed 128 bit length field dividing the augmented message into blocks using a 64-bit word derived from the current message block using 8 constants based on square root of first 8 prime numbers (2-19) updating a 512-bit buffer using a round constant based on cube root of first 80 prime numbers (2-409) 6April 5, 2016
- 7. Message block and digest word 7April 5, 2016 operates on words each block consists of sixteen 64 bits(1024 bits) words message digest has eight 64 bits (512 bits) words named A,B,C,D,E,F,G,H expanding 80 words from sixteen 64 bits words
- 8. Figure: Word expansion in SHA-512 8 SHA-512 Initial Values & Word Expansion Table : Values of constants in message digest initialization of SHA-512 Buffer Value (in Hexadecimal) Buffer Value (in Hexadecimal) A0 6A09E667F3BCC908 E0 510E527FADE682D1 B0 BB67AE8584CAA73B F0 9B05688C2B3E6C1F C0 3C6EF372FE94F82B G0 1F83D9ABFB41BD6B D0 A54FF53A5F1D36F1 H0 5BE0CD19137E2179
- 9. Calculation of constants 9April 5, 2016 For example, The 8th prime is 19, with the square root (19)1/2= 4.35889894354 Converting this number to binary with only 64 bits in the fraction part, we get, The fraction part ∶ (5𝐵𝐸0𝐶𝐷19137𝐸2179)16 The 80th prime is 409, with the cubic root (409)1/3 = 7.42291412044. Converting this number to binary with only 64 bits in the fraction part, we get The fraction part: (6C44198C4A475817)16 (100.0101 1011 1110 …1001)2 (4.5𝐵𝐸0𝐶𝐷19137𝐸2179)16
- 10. Figure: Compression Function in SHA-512 10 SHA-512 Compression Function
- 11. Figure: List of round constants used in SHA-512 11 SHA-512 Round constants (K)
- 12. Figure: Structure of each round in SHA-512 12 SHA-512 Round Function
- 13. 13 SHA-512 Round Function Majority Function Conditional Function Rotate Functions April 5, 2016
- 14. 14 SHA-512 Majority Function calculation We apply the Majority function on buffers A, B, and C. If the leftmost hexadecimal digits of these buffers are 0x7, 0xA, and 0xE, respectively, what is the leftmost digit of the result? Solution The digits in binary are 0111, 1010, and 1110. a. The first bits are 0, 1, and 1. The majority is 1. b. The second bits are 1, 0, and 1. The majority is 1. c. The third bits are 1, 1, and 1. The majority is 1. d. The fourth bits are 1, 0, and 0. The majority is 0. The result is 1110, or 0xE in hexadecimal. April 5, 2016
- 15. 15 SHA-512 Conditional Function calculation We apply the Conditional function on E, F, and G buffers. If the leftmost hexadecimal digits of these buffers are 0x9, 0xA, and 0xF respectively, what is the leftmost digit of the result? Solution The digits in binary are 1001, 1010, and 1111. a. The first bits are 1, 1,and 1.The result is F1, which is 1. b. The second bits are 0,0, and 1. The result is G2, which is 1. c. The third bits are 0,1,and 1.The result is G3, which is 1. d. The fourth bits are 1,0,and 1.The result is F4, which is 0. The result is 1110, or 0xE in hexadecimal. April 5, 2016
- 16. 16 Example using SHA-512 ASCII characters: “abc”, which is equivalent to the following 24-bit binary string: 01100001 01100010 01100011 = 616263 in Hexadecimal The original length is 24 bits, or a hexadecimal value of 18. the 1024-bit message block, in hexadecimal, is 6162638000000000 0000000000000000 0000000000000000 0000000000000000 0000000000000000 0000000000000000 0000000000000000 0000000000000000 0000000000000000 0000000000000000 0000000000000000 0000000000000000 0000000000000000 0000000000000000 0000000000000000 0000000000000018 W0 = 6162638000000000 W5 = 0000000000000000 W1 = 0000000000000000 W6 = 0000000000000000 W2 = 0000000000000000 W7 = 0000000000000000 W3 = 0000000000000000 W8 = 0000000000000000 W4 = 0000000000000000 W9 = 0000000000000000 W10 = 0000000000000000 W13 = 0000000000000000 W11 = 0000000000000000 W14 = 0000000000000000 W12 = 0000000000000000 W15 = 0000000000000018 April 5, 2016
- 17. The following table shows the initial values of these variables and their values after each of the first two rounds. The process continues through 80 rounds. The output of the final round is 73a54f399fa4b1b2 10d9c4c4295599f6 d67806db8b148677 654ef9abec389ca9 d08446aa79693ed7 9bb4d39778c07f9e 25c96a7768fb2aa3 ceb9fc3691ce8326 17 Example using SHA-512 a 6a09e667f3bcc908 f6afceb8bcfcddf5 1320f8c9fb872cc0 b bb67ae8584caa73b 6a09e667f3bcc908 f6afceb8bcfcddf5 c 3c6ef372fe94f82b bb67ae8584caa73b 6a09e667f3bcc908 d a54ff53a5f1d36f1 3c6ef372fe94f82b bb67ae8584caa73b e 510e527fade682d1 58cb02347ab51f91 c3d4ebfd48650ffa f 9b05688c2b3e6c1f 510e527fade682d1 58cb02347ab51f91 g 1f83d9abfb41bd6b 9b05688c2b3e6c1f 510e527fade682d1 h 5be0cd19137e2179 1f83d9abfb41bd6b 9b05688c2b3e6c1f
- 18. 18 Example using SHA-512 The hash value is then calculated as H1,7 = 5be0cd19137e2179 + ceb9fc3691ce8326 = 2a9ac94fa54ca49f H1,6 = 1f83d9abfb41bd6b + 25c96a7768fb2aa3 = 454d4423643ce80e H1,5 = 9b05688c2b3e6c1f + 9bb4d39778c07f9e = 36ba3c23a3feebbd H1,4 = 510e527fade682d1 + d08446aa79693ed7 = 2192992a274fc1a8 H1,3 = a54ff53a5f1d36f1 + 654ef9abec389ca9 = 0a9eeee64b55d39a H1,2 = 3c6ef372fe94f82b + d67806db8b148677 = 12e6fa4e89a97ea2 H1,1 = bb67ae8584caa73b + 10d9c4c4295599f6 = cc417349ae204131 H1,0 = 6a09e667f3bcc908 + 73a54f399fa4b1b2 = ddaf35a193617aba The resulting 512-bit message digest is ddaf35a193617aba cc417349ae204131 12e6fa4e89a97ea2 0a9eeee64b55d39a 2192992a274fc1a8 36ba3c23a3feebbd 454d4423643ce80e 2a9ac94fa54ca49f
- 19. 19 SHA-512 Applications Used as part of a system to authenticate archival video from the International Criminal Tribunal of the Rwandan genocide. Proposed for use in DNSSEC are moving to 512-bit SHA-2 for secure password hashing by Unix and Linux vendors
- 20. 20 SHA-512 Cryptanalysis Published in Year Attack method Rounds New Collision Attacks Against Up To 24-step SHA-2 2008 Deterministic 24/80 Preimages for step-reduced SHA-2 2009 Meet-in-the- middle 42/80 46/80 Advanced meet-in-the-middle preimage attacks 2010 Meet-in-the- middle 42/80 Bicliques for Preimages: Attacks on Skein-512 and the SHA-2 family 2011 Biclique 50/80 57/80 Branching Heuristics in Differential Collision Search with Applications to SHA-512 2014 Heuristic differential 38/80
- 21. Thanks All 21April 5, 2016