SHA- Secure hashing algorithm
Download as pptx, pdf12 likes14,288 views
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.
1 of 16
Downloaded 268 times
![How SHA-1 works.?
Step 5.1 : Copy chaining variables A-E into variables
a-e.
Step 5.2 : Divide current 512-bit block into 16 sub-
blocks of 32-bits.
Step 5.3 : SHA has 4 rounds, each consisting of 20
steps. Each round takes 3 inputs-
512-bit block,
The register abcde
A constant K[t] (where t= 0 to 79)](https://image.slidesharecdn.com/sha-170910180513/85/SHA-Secure-hashing-algorithm-8-320.jpg)
![How SHA-1 works.?
Step 5.4 : SHA has a total of 80 iterations (4 rounds X 20 -
iterations). Each iteration consists of following operations:-
abcde = ( e +Process P + S5(a) + W[t] + K[t] ), a, S30(b) , c , d
Where,
abcde = The register made up of 5 variables a, b, c, d, e.
Process P = The logic operation.
St = Circular-left shift of 32-bit sub-block by t bits.
W[t[ = A 32-bit derived from the current 32-bit sub-block.
K[t] = One of the five additive constants.](https://image.slidesharecdn.com/sha-170910180513/85/SHA-Secure-hashing-algorithm-9-320.jpg)
![How SHA-1 works.?
The values of W[t] are calculated as follows :
For the first 16 words of W (i.e. t=0 to 15) , the
contents of the input message sub-block M[t] become
the contents of W[t].
For the remaining 64 values of W are derived using the
equation
W[t] = s1 ( W[t-16] XOR W[t-14] XOR W[t-8] XOR W[t-3])](https://image.slidesharecdn.com/sha-170910180513/85/SHA-Secure-hashing-algorithm-12-320.jpg)
Ad
Recommended
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.
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.
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.
Introduction to Cryptography
Introduction to CryptographyMd. Afif Al Mamun Cryptography is the practice of securing communication and information by converting plaintext into ciphertext. The document provides an introduction to cryptography including its history from ancient times to the present. It discusses terminology like plaintext, encryption, ciphertext, decryption, and keys. Symmetric key cryptography uses a single key for encryption and decryption while asymmetric key cryptography uses two different keys. Examples of symmetric methods are DES, 3DES, AES, and RC4, while RSA is a common asymmetric method. Applications of cryptography include ATMs, email passwords, e-payments, e-commerce, electronic voting, defense services, securing data, and access control.
DC - Unit - 6 - Mathematical Preliminaries for Lossy Coding
DC - Unit - 6 - Mathematical Preliminaries for Lossy CodingGyanmanjari Institute Of Technology Distortion criteria – The Human Visual System, Auditory Perception Models – Probability Models, Linear System Models, Physical Models Scalar Quantization: The Quantization Problem Uniform Quantizer Adaptive Quantization – Forward Adaptive , Backward Adaptive Non uniform Quantization – pdf optimized Quantization, Companded Quantization Entropy Coded Quantization – Entropy coding of Lloyd – Max Quantizer Outputs Vector Quantization : Advantages of Vector Quantization over Scalar Quantization The Linde-Buzo-Gray Algorithm Tree structured Vector Quantization Structured Vector Quantization
Secure Hash Algorithm (SHA-512)
Secure Hash Algorithm (SHA-512)DUET 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.
Different types of research ppt
Different types of research pptSWATHY M.A This document discusses different types of research categorized by purpose, process, and outcome. There are four types of research defined by purpose: descriptive research involves fact-finding without variable control; analytical research analyzes phenomena through secondary data; exploratory research gains insights in preliminary stages; predictive research determines frequency or association. Qualitative research uses words and explores perspectives while quantitative research uses numbers and measurement. Applied research solves practical problems while fundamental research formulates theory without immediate application.
Networking devices
Networking devicesMubassir Ambekar Networking devices connect electronic devices together to share files and resources. They include routers, hubs, switches, bridges, gateways, and network interface cards. Routers direct network traffic and route information between local area networks. Hubs connect devices physically but copy all data to every port. Switches intelligently send data only to the destination port, unlike hubs. Bridges connect networks using the same protocol, while gateways allow communication across different networks using protocols. Network interface cards provide the physical connection between a computer and the network.
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.
Hash function
Hash function Salman Memon A hash function compresses input data into a shorter, fixed-length output known as a hash value, often used for file integrity checks, password encryption, and data verification. It serves as a digital fingerprint, making it nearly impossible to alter the original data without changing the hash. Various hash functions exist, including MD5, SHA, and HMAC, each with specific applications and characteristics.
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.
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.
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.
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.
AES-Advanced Encryption Standard
AES-Advanced Encryption StandardPrince Rachit The Advanced Encryption Standard (AES) is a widely accepted encryption algorithm established by NIST to secure classified information and operates on 128-bit blocks. AES uses a series of repeated functions - including substitution, shifting, mixing, and key addition - with the number of rounds varying based on key size (10, 12, or 14 rounds). Despite its robustness, there are advanced attacks like the related key attack which attempt to weaken AES, though these remain impractical with current technology for key sizes of 128 bits and above.
Data Encryption Standard (DES)
Data Encryption Standard (DES)Haris Ahmed - DES (Data Encryption Standard) is a symmetric block cipher algorithm that encrypts data in 64-bit blocks using a 56-bit key. It was the first encryption standard adopted by the U.S. government for protecting sensitive unclassified federal government information.
- DES works by performing 16 rounds of complex substitutions and permutations on each data block, encrypting it using the key. It has various modes of operation like ECB, CBC, CFB, OFB, and CTR that specify how it operates on data.
- In 1998, DES was broken using a brute force attack by the Electronic Frontier Foundation in just 3 days, showing the need for stronger algorithms like AES which replaced DES as the encryption standard
Web Security
Web SecurityDr.Florence Dayana The document discusses web security, focusing on threats and security protocols such as SSL, TLS, and SET for secure communications over the internet. It covers the architecture of SSL, key management, data integrity, and the security features of TLS, as well as the operational details of secure electronic transactions. Additionally, it explains the processes involved in payment authorization using SET and the significance of dual signatures in securing transaction information.
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.
Symmetric and Asymmetric Encryption.ppt
Symmetric and Asymmetric Encryption.pptHassanAli980906 Symmetric and asymmetric encryption methods are compared. Symmetric encryption uses a single shared key for encryption and decryption while asymmetric encryption uses two separate keys: a public key for encryption and a private key for decryption. The main advantages of symmetric encryption are that it is simple and fast but key distribution is insecure. Asymmetric encryption is more secure for key distribution since users only need to share public keys, but it is more complex computationally.
Block Ciphers and the Data Encryption Standard
Block Ciphers and the Data Encryption StandardDr.Florence Dayana 1. The document discusses network security and provides details about stream ciphers and block ciphers. It explains how each type of cipher works and provides examples of each.
2. Details are given about the Feistel cipher structure and how it provides diffusion and confusion through repeated rounds. The Data Encryption Standard (DES) algorithm is described as a prominent example of a Feistel cipher.
3. Principles of block cipher design are outlined, emphasizing the importance of number of rounds, design of the round function F, and the key schedule algorithm in providing security.
RC4&RC5
RC4&RC5Mohamed El-Serngawy RC4 is a symmetric key stream cipher algorithm invented in 1987. It operates by combining a pseudo-random keystream with plaintext using XOR operations. The keystream is generated from an initial random permutation of bytes. RC4 has been used to encrypt network traffic but weaknesses have been found, including biases in the early output bytes that allow recovery of encryption keys. While simple and fast, RC4 is no longer considered secure for many applications.
2. public key cryptography and RSA
2. public key cryptography and RSADr.Florence Dayana Public Key Cryptography (PKC) is an encryption method utilizing a pair of public and private keys for secure communications. The document explains the principles, requirements, and applications of PKC, including the RSA algorithm, which is widely used for encrypting messages and protecting confidentiality. Additionally, it covers various types of attacks on RSA and the use of Optimal Asymmetric Encryption Padding (OAEP) for enhanced security.
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.
Elgamal & schnorr digital signature scheme copy
Elgamal & schnorr digital signature scheme copyNorth Cap University (NCU) Formely ITM University Digital signatures provide authentication of digital messages or documents. There are three main algorithms involved: hashing, signature generation, and signature verification. Common digital signature schemes include ElGamal, Schnorr, and the Digital Signature Standard (DSS). The DSS is based on ElGamal and Schnorr schemes. It uses smaller signatures than ElGamal by employing two moduli, one smaller than the other. Digital signatures are widely used to provide authentication in protocols like IPSec, SSL/TLS, and S/MIME.
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.
CRYPTOGRAPHY & NETWORK SECURITY - unit 1
CRYPTOGRAPHY & NETWORK SECURITY - unit 1RAMESHBABU311293 This document provides information about the CS8792 CRYPTOGRAPHY & NETWORK SECURITY course. It discusses cryptography, the course outcomes, syllabus, and key concepts in cryptography including symmetric encryption, asymmetric encryption, data integrity algorithms, and authentication protocols. It also covers essential network and computer security requirements, legal and ethical issues, security policies, OSI security architecture including security attacks, mechanisms, and services.
Transposition Cipher
Transposition Cipherdaniyalqureshi712 1) The document discusses various transposition ciphers including the rail fence cipher, route cipher, simple columnar transposition, and double transposition cipher. It explains how each cipher works through encrypting and decrypting sample messages.
2) Detection methods for transposition ciphers are also covered, such as frequency analysis and finding anagrams in the ciphertext. Simpler transposition ciphers can be vulnerable to these kinds of cryptanalysis techniques.
3) Genetic algorithms are mentioned as a way for cryptanalysts to find the most likely decryption key through probability calculations.
Cryptography - Block cipher & stream cipher
Cryptography - Block cipher & stream cipherNiloy Biswas The document discusses stream ciphers and block ciphers, highlighting that stream ciphers encrypt data one byte at a time using a key stream, while block ciphers encrypt data in fixed-size blocks. It explains the function of key streams in stream ciphers and contrasts it with the deterministic approach of block ciphers. Additionally, it humorously notes that the author is not available to answer questions.
SHA
SHASubashiniRathinavel The Secure Hash Algorithm (SHA) was developed by NIST and NSA to generate a 160-bit message digest from inputs of less than 264 bits. SHA-1 works by padding the input message, appending the length, dividing into 512-bit blocks, initializing chain variables, and processing each block through 80 iterations involving logical, shift, and addition operations to update the variables. Each iteration uses a constant and the previous output to calculate the next output in order to make it difficult to determine the input from the digest or find colliding messages. Later versions such as SHA-256 increased security by lengthening the digest and number of steps.
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.
More Related Content
What's hot (20)
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.
Hash function
Hash function Salman Memon A hash function compresses input data into a shorter, fixed-length output known as a hash value, often used for file integrity checks, password encryption, and data verification. It serves as a digital fingerprint, making it nearly impossible to alter the original data without changing the hash. Various hash functions exist, including MD5, SHA, and HMAC, each with specific applications and characteristics.
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.
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.
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.
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.
AES-Advanced Encryption Standard
AES-Advanced Encryption StandardPrince Rachit The Advanced Encryption Standard (AES) is a widely accepted encryption algorithm established by NIST to secure classified information and operates on 128-bit blocks. AES uses a series of repeated functions - including substitution, shifting, mixing, and key addition - with the number of rounds varying based on key size (10, 12, or 14 rounds). Despite its robustness, there are advanced attacks like the related key attack which attempt to weaken AES, though these remain impractical with current technology for key sizes of 128 bits and above.
Data Encryption Standard (DES)
Data Encryption Standard (DES)Haris Ahmed - DES (Data Encryption Standard) is a symmetric block cipher algorithm that encrypts data in 64-bit blocks using a 56-bit key. It was the first encryption standard adopted by the U.S. government for protecting sensitive unclassified federal government information.
- DES works by performing 16 rounds of complex substitutions and permutations on each data block, encrypting it using the key. It has various modes of operation like ECB, CBC, CFB, OFB, and CTR that specify how it operates on data.
- In 1998, DES was broken using a brute force attack by the Electronic Frontier Foundation in just 3 days, showing the need for stronger algorithms like AES which replaced DES as the encryption standard
Web Security
Web SecurityDr.Florence Dayana The document discusses web security, focusing on threats and security protocols such as SSL, TLS, and SET for secure communications over the internet. It covers the architecture of SSL, key management, data integrity, and the security features of TLS, as well as the operational details of secure electronic transactions. Additionally, it explains the processes involved in payment authorization using SET and the significance of dual signatures in securing transaction information.
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.
Symmetric and Asymmetric Encryption.ppt
Symmetric and Asymmetric Encryption.pptHassanAli980906 Symmetric and asymmetric encryption methods are compared. Symmetric encryption uses a single shared key for encryption and decryption while asymmetric encryption uses two separate keys: a public key for encryption and a private key for decryption. The main advantages of symmetric encryption are that it is simple and fast but key distribution is insecure. Asymmetric encryption is more secure for key distribution since users only need to share public keys, but it is more complex computationally.
Block Ciphers and the Data Encryption Standard
Block Ciphers and the Data Encryption StandardDr.Florence Dayana 1. The document discusses network security and provides details about stream ciphers and block ciphers. It explains how each type of cipher works and provides examples of each.
2. Details are given about the Feistel cipher structure and how it provides diffusion and confusion through repeated rounds. The Data Encryption Standard (DES) algorithm is described as a prominent example of a Feistel cipher.
3. Principles of block cipher design are outlined, emphasizing the importance of number of rounds, design of the round function F, and the key schedule algorithm in providing security.
RC4&RC5
RC4&RC5Mohamed El-Serngawy RC4 is a symmetric key stream cipher algorithm invented in 1987. It operates by combining a pseudo-random keystream with plaintext using XOR operations. The keystream is generated from an initial random permutation of bytes. RC4 has been used to encrypt network traffic but weaknesses have been found, including biases in the early output bytes that allow recovery of encryption keys. While simple and fast, RC4 is no longer considered secure for many applications.
2. public key cryptography and RSA
2. public key cryptography and RSADr.Florence Dayana Public Key Cryptography (PKC) is an encryption method utilizing a pair of public and private keys for secure communications. The document explains the principles, requirements, and applications of PKC, including the RSA algorithm, which is widely used for encrypting messages and protecting confidentiality. Additionally, it covers various types of attacks on RSA and the use of Optimal Asymmetric Encryption Padding (OAEP) for enhanced security.
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.
Elgamal & schnorr digital signature scheme copy
Elgamal & schnorr digital signature scheme copyNorth Cap University (NCU) Formely ITM University Digital signatures provide authentication of digital messages or documents. There are three main algorithms involved: hashing, signature generation, and signature verification. Common digital signature schemes include ElGamal, Schnorr, and the Digital Signature Standard (DSS). The DSS is based on ElGamal and Schnorr schemes. It uses smaller signatures than ElGamal by employing two moduli, one smaller than the other. Digital signatures are widely used to provide authentication in protocols like IPSec, SSL/TLS, and S/MIME.
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.
CRYPTOGRAPHY & NETWORK SECURITY - unit 1
CRYPTOGRAPHY & NETWORK SECURITY - unit 1RAMESHBABU311293 This document provides information about the CS8792 CRYPTOGRAPHY & NETWORK SECURITY course. It discusses cryptography, the course outcomes, syllabus, and key concepts in cryptography including symmetric encryption, asymmetric encryption, data integrity algorithms, and authentication protocols. It also covers essential network and computer security requirements, legal and ethical issues, security policies, OSI security architecture including security attacks, mechanisms, and services.
Transposition Cipher
Transposition Cipherdaniyalqureshi712 1) The document discusses various transposition ciphers including the rail fence cipher, route cipher, simple columnar transposition, and double transposition cipher. It explains how each cipher works through encrypting and decrypting sample messages.
2) Detection methods for transposition ciphers are also covered, such as frequency analysis and finding anagrams in the ciphertext. Simpler transposition ciphers can be vulnerable to these kinds of cryptanalysis techniques.
3) Genetic algorithms are mentioned as a way for cryptanalysts to find the most likely decryption key through probability calculations.
Cryptography - Block cipher & stream cipher
Cryptography - Block cipher & stream cipherNiloy Biswas The document discusses stream ciphers and block ciphers, highlighting that stream ciphers encrypt data one byte at a time using a key stream, while block ciphers encrypt data in fixed-size blocks. It explains the function of key streams in stream ciphers and contrasts it with the deterministic approach of block ciphers. Additionally, it humorously notes that the author is not available to answer questions.
Elgamal & schnorr digital signature scheme copy
Elgamal & schnorr digital signature scheme copyNorth Cap University (NCU) Formely ITM University
Similar to SHA- Secure hashing algorithm (20)
SHA
SHASubashiniRathinavel The Secure Hash Algorithm (SHA) was developed by NIST and NSA to generate a 160-bit message digest from inputs of less than 264 bits. SHA-1 works by padding the input message, appending the length, dividing into 512-bit blocks, initializing chain variables, and processing each block through 80 iterations involving logical, shift, and addition operations to update the variables. Each iteration uses a constant and the previous output to calculate the next output in order to make it difficult to determine the input from the digest or find colliding messages. Later versions such as SHA-256 increased security by lengthening the digest and number of steps.
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 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.
Unit 3_Secure Hash Algorithm_SHA_Working.pdf
Unit 3_Secure Hash Algorithm_SHA_Working.pdfKanchanPatil34 Secure Hash Algorithm, SHA, SHA-1, SHA Purpose, SHA Applications,
Working of SHA
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.
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.
SHA 1 Algorithm.ppt
SHA 1 Algorithm.pptRajapriya82 The SHA-1 algorithm is a cryptographic hash function that takes an input and produces a 160-bit hash value. It works by padding the input message, appending the length, and then processing the message in 512-bit blocks through 80 processing steps using functions and constants to calculate new hash values. The final hash value after all blocks are processed represents the message digest.
A Comparative Analysis between SHA and MD5 algorithms
A Comparative Analysis between SHA and MD5 algorithms Er Piyush Gupta IN ⊞⌘ This paper analyzes the performance of the MD5 and SHA algorithms in cryptography, focusing on their hash generation time and data integrity capabilities. MD5 operates with a 128-bit message digest, while SHA provides a 160-bit output, making SHA generally more secure than MD5. The study includes a detailed comparison of both algorithms' processes, parameters, and execution results, highlighting their similarities and differences.
Bitcoin Addresses
Bitcoin Addressesashmoran 1) Bitcoin addresses are generated from public keys through a multi-step process involving hashing, encoding, and adding checksums.
2) Specifically, the public key is hashed using SHA256 and RIPEMD160, then encoded in base58 format.
3) A version byte and checksum are added to the encoded hash to create the final Bitcoin address.
AES.pptx
AES.pptxRizwanBasha12 The document describes the Advanced Encryption Standard (AES) algorithm. AES is a symmetric block cipher that encrypts data blocks of 128 bits using a key of 128, 192, or 256 bits. It operates on a 4x4 matrix through a series of transformations including byte substitution, shifting rows, mixing columns, and adding a round key. The algorithm consists of 10, 12, or 14 rounds depending on the key size. AES provides security, efficiency, and flexibility for encryption.
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.
Basic explanation to md5 implementation in C
Basic explanation to md5 implementation in CSourav Punoriyar MD5 is a hashing algorithm that takes an input of arbitrary length and produces a 128-bit hash value. It works by processing the input message in 512-bit blocks, padding the last block as needed, and performing transformations using auxiliary functions to update the hash value after each block. The implementation in C uses a state buffer to store the running hash value, along with functions for initialization, updating the hash with new data blocks, finalization including padding, and transforming blocks.
Hash mac algorithms
Hash mac algorithmsYoung Alista The document discusses hash and MAC algorithms, focusing on Secure Hash Algorithms (SHA) and HMAC. It details the steps involved in SHA operations, particularly SHA-512, emphasizing the addition of padding, length, and the processing of message blocks using compression functions. HMAC is introduced as a method for constructing message authentication codes using existing hash functions, outlining its design objectives and security considerations.
Hash mac algorithms
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 algorithms
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 algorithms
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 algorithms
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 algorithms
Hash mac algorithmsLuis Goldster 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 algorithms
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.
Ad
More from Ruchi Maurya (7)
Computer graphics - bresenham line drawing algorithm
Computer graphics - bresenham line drawing algorithmRuchi Maurya The document discusses Bresenham’s line drawing algorithm, which efficiently generates raster lines using incremental integer calculations. It includes an explanation of the algorithm's derivation, examples, advantages such as fast execution and accuracy, and disadvantages like potential drift from the line path. References for further reading are also provided.
Java- Datagram Socket class & Datagram Packet class
Java- Datagram Socket class & Datagram Packet classRuchi Maurya The document provides an overview of the Datagram Socket and Datagram Packet classes in Java, which are used for communication over the UDP protocol. It describes the characteristics of these classes, including constructors for creating Datagram Sockets and Packets, as well as examples of how to send and receive datagrams. Key points include the connection-less nature of the sockets and the lack of delivery guarantees for the packets.
Nams- Roots of equations by numerical methods
Nams- Roots of equations by numerical methodsRuchi Maurya The document discusses numerical methods for finding roots of equations, focusing on three techniques: the Bisection method, Regula-Falsi method, and Secant method. Each method is detailed with algorithms, step-by-step procedures, and examples. The document emphasizes the importance of initial guesses and accuracy in the root-finding process.
Types of Addressing modes- COA
Types of Addressing modes- COARuchi Maurya The document provides an overview of computer organization and architecture, focusing on stack organizations, instruction formats, and addressing modes. It explains stack operations such as push and pop, details various types of instruction formats, and describes multiple addressing modes used to access operands during program execution. Key examples include the differentiation between immediate, register, and direct addressing modes, along with their respective operations.
Social networking
Social networkingRuchi Maurya The document outlines the evolution and significance of social networking, starting from its inception in 1978 to major platforms like Facebook, Twitter, Google+, and YouTube. It highlights the features, user registration, and age requirements for each platform, emphasizing the benefits of connectivity and business promotion while also addressing potential risks such as identity theft and negative health impacts on users. Social networking is portrayed as a powerful tool for communication and relationship building, albeit with inherent dangers.
Random access memory
Random access memoryRuchi Maurya This document provides an overview of random access memory (RAM). It discusses that RAM is a type of volatile memory used to store running programs and data. The document outlines the history, technologies, components, types (SRAM and DRAM), capacities, manufacturers, and advantages/disadvantages of RAM. It also includes diagrams of a RAM block and the positioning and structure of RAM modules.
open system interconnection
open system interconnectionRuchi Maurya The document outlines the OSI (Open System Interconnection) model, developed by ISO in 1984, as a conceptual framework for network communication. It consists of seven layers: Application, Presentation, Session, Transport, Network, Data Link, and Physical, each with specific functions related to data handling and transmission. The summary includes details on the roles and functionalities of each layer, such as data translation, session management, error checking, and addressing.
Ad
Recently uploaded (20)
Proposal for folders structure division in projects.pdf
Proposal for folders structure division in projects.pdfMohamed Ahmed Proposal for folders structure division in projects
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.
Complete guidance book of Asp.Net Web API
Complete guidance book of Asp.Net Web APIShabista Imam Unlock the full potential of modern web development with the Complete Guidance Book of ASP.NET Web API—your all-in-one resource for mastering RESTful services using Microsoft’s powerful ASP.NET Core framework. This book takes you on a step-by-step journey from beginner to expert, covering everything from routing and controllers to security, performance optimization, and real-world architecture.
CST413 KTU S7 CSE Machine Learning Clustering K Means Hierarchical Agglomerat...
CST413 KTU S7 CSE Machine Learning Clustering K Means Hierarchical Agglomerat...resming1 This covers CST413 KTU S7 CSE Machine Learning Module 4 topics - Clustering, K Means clustering, Hierarchical Agglomerative clustering, Principal Component Analysis, and Expectation Maximization.
تقرير عن التحليل الديناميكي لتدفق الهواء حول جناح.pdf
تقرير عن التحليل الديناميكي لتدفق الهواء حول جناح.pdfمحمد قصص فتوتة تقرير عن التحليل الديناميكي لتدفق الهواء حول جناح مروحه ريحيه
Abraham Silberschatz-Operating System Concepts (9th,2012.12).pdf
Abraham Silberschatz-Operating System Concepts (9th,2012.12).pdfShabista Imam Complete book of operating system edition 9
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.
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.
Data Structures Module 3 Binary Trees Binary Search Trees Tree Traversals AVL...
Data Structures Module 3 Binary Trees Binary Search Trees Tree Traversals AVL...resming1 This covers binary trees, binary search trees, BST insertion, deletion, tree traversals - inorder, preorder, postorder, AVL trees, AVL tree insertion, deletion, BTrees - insertion, deletion, hash tables etc.
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 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.
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
Cadastral Maps
Cadastral MapsGoogle Preparation of cadastral maps based by Engineer Dungo Tizazu from Dire Dawa University
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.
SHA- Secure hashing algorithm
- 1. Internet Network Security Created by: Ruchi Maurya
- 4. Developed by NIST along with NSA In 1993, SHA was published as a Federal Information Processing Standard It has following versions- SHA-0 SHA-1 SHA-224 SHA-256 SHA-512 introduction
- 5. It works for any input message that is less than 264 bits. The output of SHA is a message digest of 160 bits in length. This is designed to be computationally infeasible to: Obtain the original message , given its message digest. Find two messages producing the same message digest SHA-1
- 6. How SHA-1 works.? Step 1: Padding of Bits Step 2: Append Length Step 3: Divide the input into 512-bit blocks
- 7. How SHA-1 works.? Step 4: Initialize chaining variables Step 5: Process Blocks- Now the actual algorithm begins…. Chaining Variables Hex values A 01 23 45 67 B 89 AB CD EF C FE DC BA 98 D 76 54 32 10 E C3 D2 E1 F0
- 8. How SHA-1 works.? Step 5.1 : Copy chaining variables A-E into variables a-e. Step 5.2 : Divide current 512-bit block into 16 sub- blocks of 32-bits. Step 5.3 : SHA has 4 rounds, each consisting of 20 steps. Each round takes 3 inputs- 512-bit block, The register abcde A constant K[t] (where t= 0 to 79)
- 9. How SHA-1 works.? Step 5.4 : SHA has a total of 80 iterations (4 rounds X 20 - iterations). Each iteration consists of following operations:- abcde = ( e +Process P + S5(a) + W[t] + K[t] ), a, S30(b) , c , d Where, abcde = The register made up of 5 variables a, b, c, d, e. Process P = The logic operation. St = Circular-left shift of 32-bit sub-block by t bits. W[t[ = A 32-bit derived from the current 32-bit sub-block. K[t] = One of the five additive constants.
- 10. How SHA-1 works.? Process P in each SHA round Round Process P 1 (b AND c) OR (( NOT b) AND (d)) 2 b XOR c XOR d 3 (b AND c ) OR (b AND d) OR (c AND d) 4 b XOR c XOR d
- 11. How SHA-1 works.? Single SHA-1 iteration
- 12. How SHA-1 works.? The values of W[t] are calculated as follows : For the first 16 words of W (i.e. t=0 to 15) , the contents of the input message sub-block M[t] become the contents of W[t]. For the remaining 64 values of W are derived using the equation W[t] = s1 ( W[t-16] XOR W[t-14] XOR W[t-8] XOR W[t-3])
- 13. Comparison
- 14. Application Secure password hashing Secure Socket Layer (SSL) security protocol Digital signature
- 15. https://brilliant.org/wiki/secure-hashing- algorithms/ https://www.tutorialspoint.com/cryptography/c ryptography_hash_functions.htm https://www.asd.gov.au/publications/protect/S HA-1_Deprecated.pdf References
- 16. Thank You !!