SHA- Secure hashing algorithm
Download as pptx, pdf12 likes14,255 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 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.
Transport Layer Security (TLS)
Transport Layer Security (TLS)Arun Shukla Transport Layer Security (TLS) is a protocol that ensures privacy and security between communicating applications on the internet, succeeding the older Secure Sockets Layer (SSL). The TLS protocol consists of a handshake mechanism for authentication and key exchange, and a record protocol for securing application data. It allows for encrypted communication by negotiating cipher suites and generating session keys, thereby preventing eavesdropping and tampering.
Cryptography
Cryptographysubodh pawar Cryptography is a method used for securely storing and transmitting data, ensuring that only intended recipients can access it. The document explores the history, types (symmetric and asymmetric), and techniques of cryptography, including classical and modern methods, along with algorithms like DES and AES. It emphasizes the importance of cryptography in maintaining data confidentiality, integrity, and secure communication across various applications.
Principles of public key cryptography and its Uses
Principles of public key cryptography and its UsesMohsin Ali This document discusses the principles of public key cryptography. It begins by defining asymmetric encryption and how it uses a public key and private key instead of a single shared key. It then discusses key concepts like digital certificates and public key infrastructure. The document also provides examples of how public key cryptography can be used, including the RSA algorithm and key distribution methods like public key directories and certificates. It explains how public key cryptography solves the key distribution problem present in symmetric encryption.
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.
MAC-Message Authentication Codes
MAC-Message Authentication CodesDarshanPatil82 The document outlines the requirements and functions of message authentication codes (MACs) and their role in verifying message integrity and authenticity. It details various potential attacks on message integrity, such as disclosure, masquerade, and timing modifications, and introduces digital signatures as a countermeasure. Additionally, it covers the construction and security of MACs, including brute-force attacks and cryptanalysis, while presenting HMAC as a standard for implementing MAC with existing hash functions.
Public Key Cryptosystem
Public Key CryptosystemDevakumar Kp Public-key cryptosystems emerged to address issues in symmetric encryption, specifically key distribution and digital signatures. Users generate a pair of keys, with one public and one private, enabling secure message encryption, decryption, and authentication. Requirements for effective public-key cryptography include easy key generation, efficient encryption and decryption processes, and strong resistance against adversaries attempting to derive private keys or original messages.
Hash function
Hash functionHarry Potter 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.
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
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.
key distribution in network security
key distribution in network securitybabak danyal Symmetric encryption uses the same key to encrypt and decrypt data, providing confidentiality. Keys must be distributed securely between parties. Common approaches involve using a key distribution center (KDC) that shares secret keys with parties and can provide temporary session keys. Link encryption protects data as it travels over each network link, while end-to-end encryption protects data for its entire journey but leaves some header data unencrypted. Key distribution, storage, renewal and replacement are important aspects of maintaining security when using symmetric encryption.
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.
Double DES & Triple DES
Double DES & Triple DESHemant Sharma The document provides an overview of Data Encryption Standard (DES), including its variations like Double DES and Triple DES. Double DES uses two encryption keys but is vulnerable to meet-in-the-middle attacks, while Triple DES enhances security by using three stages of DES with either two or three keys. Triple DES is considered stronger than Double DES, though both involve complex key management and potential vulnerabilities.
Cryptography
CryptographySidharth Mohapatra The document provides an overview of cryptography, defining key concepts such as encryption, decryption, and cryptanalysis. It discusses the two main types of cryptography: symmetric and asymmetric, along with various techniques used for securing data transmission. Additionally, it highlights the importance of cryptography in network security to protect sensitive information from unauthorized access.
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.
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.
Secure Socket Layer (SSL)
Secure Socket Layer (SSL)Samip jain SSL (Secure Socket Layer) is an internet protocol ensuring secure communication between web browsers and servers, providing authentication and confidentiality. Developed by Netscape in 1994, it consists of multiple protocols including the handshake, record, change cipher, and alert protocols, facilitating secure data exchange. The latest version, TLS, evolved from SSL 3.0, incorporating enhancements for secure data transmission.
Symmetric and asymmetric key
Symmetric and asymmetric keyTriad Square InfoSec Symmetric encryption uses a shared secret key between the sender and receiver to encrypt and decrypt messages. It is faster than asymmetric encryption but requires secure key exchange. Asymmetric encryption uses separate public and private keys, where the public key is used to encrypt and the private key decrypts, allowing secure communication without pre-shared keys. Common symmetric algorithms are AES and DES, while asymmetric algorithms include RSA, Diffie-Hellman, and ECDSA.
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 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.
Transport Layer Security (TLS)
Transport Layer Security (TLS)Arun Shukla Transport Layer Security (TLS) is a protocol that ensures privacy and security between communicating applications on the internet, succeeding the older Secure Sockets Layer (SSL). The TLS protocol consists of a handshake mechanism for authentication and key exchange, and a record protocol for securing application data. It allows for encrypted communication by negotiating cipher suites and generating session keys, thereby preventing eavesdropping and tampering.
Cryptography
Cryptographysubodh pawar Cryptography is a method used for securely storing and transmitting data, ensuring that only intended recipients can access it. The document explores the history, types (symmetric and asymmetric), and techniques of cryptography, including classical and modern methods, along with algorithms like DES and AES. It emphasizes the importance of cryptography in maintaining data confidentiality, integrity, and secure communication across various applications.
Principles of public key cryptography and its Uses
Principles of public key cryptography and its UsesMohsin Ali This document discusses the principles of public key cryptography. It begins by defining asymmetric encryption and how it uses a public key and private key instead of a single shared key. It then discusses key concepts like digital certificates and public key infrastructure. The document also provides examples of how public key cryptography can be used, including the RSA algorithm and key distribution methods like public key directories and certificates. It explains how public key cryptography solves the key distribution problem present in symmetric encryption.
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.
MAC-Message Authentication Codes
MAC-Message Authentication CodesDarshanPatil82 The document outlines the requirements and functions of message authentication codes (MACs) and their role in verifying message integrity and authenticity. It details various potential attacks on message integrity, such as disclosure, masquerade, and timing modifications, and introduces digital signatures as a countermeasure. Additionally, it covers the construction and security of MACs, including brute-force attacks and cryptanalysis, while presenting HMAC as a standard for implementing MAC with existing hash functions.
Public Key Cryptosystem
Public Key CryptosystemDevakumar Kp Public-key cryptosystems emerged to address issues in symmetric encryption, specifically key distribution and digital signatures. Users generate a pair of keys, with one public and one private, enabling secure message encryption, decryption, and authentication. Requirements for effective public-key cryptography include easy key generation, efficient encryption and decryption processes, and strong resistance against adversaries attempting to derive private keys or original messages.
Hash function
Hash functionHarry Potter 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.
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
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.
key distribution in network security
key distribution in network securitybabak danyal Symmetric encryption uses the same key to encrypt and decrypt data, providing confidentiality. Keys must be distributed securely between parties. Common approaches involve using a key distribution center (KDC) that shares secret keys with parties and can provide temporary session keys. Link encryption protects data as it travels over each network link, while end-to-end encryption protects data for its entire journey but leaves some header data unencrypted. Key distribution, storage, renewal and replacement are important aspects of maintaining security when using symmetric encryption.
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.
Double DES & Triple DES
Double DES & Triple DESHemant Sharma The document provides an overview of Data Encryption Standard (DES), including its variations like Double DES and Triple DES. Double DES uses two encryption keys but is vulnerable to meet-in-the-middle attacks, while Triple DES enhances security by using three stages of DES with either two or three keys. Triple DES is considered stronger than Double DES, though both involve complex key management and potential vulnerabilities.
Cryptography
CryptographySidharth Mohapatra The document provides an overview of cryptography, defining key concepts such as encryption, decryption, and cryptanalysis. It discusses the two main types of cryptography: symmetric and asymmetric, along with various techniques used for securing data transmission. Additionally, it highlights the importance of cryptography in network security to protect sensitive information from unauthorized access.
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.
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.
Secure Socket Layer (SSL)
Secure Socket Layer (SSL)Samip jain SSL (Secure Socket Layer) is an internet protocol ensuring secure communication between web browsers and servers, providing authentication and confidentiality. Developed by Netscape in 1994, it consists of multiple protocols including the handshake, record, change cipher, and alert protocols, facilitating secure data exchange. The latest version, TLS, evolved from SSL 3.0, incorporating enhancements for secure data transmission.
Symmetric and asymmetric key
Symmetric and asymmetric keyTriad Square InfoSec Symmetric encryption uses a shared secret key between the sender and receiver to encrypt and decrypt messages. It is faster than asymmetric encryption but requires secure key exchange. Asymmetric encryption uses separate public and private keys, where the public key is used to encrypt and the private key decrypts, allowing secure communication without pre-shared keys. Common symmetric algorithms are AES and DES, while asymmetric algorithms include RSA, Diffie-Hellman, and ECDSA.
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.
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.
GOLDSTRIKETM 1: COINTERRA’S FIRST GENERATION CRYPTO-CURRENCY PROCESSOR FOR BI...
GOLDSTRIKETM 1: COINTERRA’S FIRST GENERATION CRYPTO-CURRENCY PROCESSOR FOR BI...Javed Barkatullah The document discusses Cointerra's first-generation cryptocurrency processor, GoldstrikeTM 1, designed for Bitcoin mining, detailing the architecture, development timeline, and various technical specifications such as hash engine structure and heat dissipation solutions. It highlights the challenges faced in ASIC design, including power density, heat management, and the tight development schedule. The document concludes with a focus on the demand for higher performance and energy-efficient mining solutions to sustain Cointerra's leadership in the Bitcoin mining industry.
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)
SEW make Brake BE05 – BE30 Brake – Repair Kit
SEW make Brake BE05 – BE30 Brake – Repair Kitprojectultramechanix A SEW-EURODRIVE brake repair kit is needed for maintenance and repair of specific SEW-EURODRIVE brake models, like the BE series. It includes all necessary parts for preventative maintenance and repairs. This ensures proper brake functionality and extends the lifespan of the brake system
22PCOAM16 _ML_Unit 3 Notes & Question bank
22PCOAM16 _ML_Unit 3 Notes & Question bankGuru Nanak Technical Institutions 22PCOAM16 _ML_Unit 3 Notes & Question bank
Impurities of Water and their Significance.pptx
Impurities of Water and their Significance.pptxdhanashree78 Impart Taste, Odour, Colour, and Turbidity to water.
Presence of organic matter or industrial wastes or microorganisms (algae) imparts taste and odour to water.
Presence of suspended and colloidal matter imparts turbidity to water.
IntroSlides-June-GDG-Cloud-Munich community [email protected]
IntroSlides-June-GDG-Cloud-Munich community [email protected]Luiz Carneiro Introduction slides for starting the June GDG Cloud Munich community gathering in Munich, Germany.
WIRELESS COMMUNICATION SECURITY AND IT’S PROTECTION METHODS
WIRELESS COMMUNICATION SECURITY AND IT’S PROTECTION METHODSsamueljackson3773 In this paper, the author discusses the concerns of using various wireless communications and how to use
them safely. The author also discusses the future of the wireless industry, wireless communication
security, protection methods, and techniques that could help organizations establish a secure wireless
connection with their employees. The author also discusses other essential factors to learn and note when
manufacturing, selling, or using wireless networks and wireless communication systems.
Blood bank management system project report.pdf
Blood bank management system project report.pdfKamal Acharya The main objective of the “Blood Bank management System” all the details in the Blood
Bank’sprocess. This project has some tasks to maintain the Blood Bank through computerization.
Using this blood bank system people can search blood group available which they are needed.
They check it on using our blood bank management website. If in case blood group is not available
in blood bank they can also contact numbers of the persons who has the same blood group he is
need. And he can request the person to done the blood for saving someone life.
The Project describes the smart Blood Bank management system. This report will help you
to know in deep the actual work that has been done as a team work. The main objective of this
application is to automate the complete operations of the blood bank. They need to maintain
hundreds of thousands of records. Also searching should be very faster, so they can find required
details instantly. Main objective is to create a system which helps them to complete their work
faster in simple way by using computer not the oldest way which is used paper. Also our project
contains updated information and many things else.
The project consists of a central repository containing various blood deposits available
along with associated details. These details include blood type, storage area and date of storage.
These details help in maintaining and monitoring the blood deposits. The project is an online
system that allows checking weather required blood deposits of a particular group are available in
the blood bank. Moreover the system also has added features such as patient name and contacts,
blood booking and even need for certain blood group is posted on the website to find available
donors for a blood emergency. This online system is developed on PHP platform and supported
by an MYSQL database to store blood and user specific details.
Understanding Amplitude Modulation : A Guide
Understanding Amplitude Modulation : A GuideCircuitDigest Discover how amplitude modulation works through a detailed guide covering its principles, waveform behavior, and hands-on AM circuit demo using simple electronic components. Great for students and RF beginners.
Read more : https://circuitdigest.com/electronic-circuits/what-is-amplitude-modulation-complete-guide-formula-circuit-diagram-practical-demonstration
社内勉強会資料_Chain of Thought .
社内勉強会資料_Chain of Thought .NABLAS株式会社 本資料「To CoT or not to CoT?」では、大規模言語モデルにおけるChain of Thought（CoT）プロンプトの効果について詳しく解説しています。
CoTはあらゆるタスクに効く万能な手法ではなく、特に数学的・論理的・アルゴリズム的な推論を伴う課題で高い効果を発揮することが実験から示されています。
一方で、常識や一般知識を問う問題に対しては効果が限定的であることも明らかになりました。
複雑な問題を段階的に分解・実行する「計画と実行」のプロセスにおいて、CoTの強みが活かされる点も注目ポイントです。
This presentation explores when Chain of Thought (CoT) prompting is truly effective in large language models.
The findings show that CoT significantly improves performance on tasks involving mathematical or logical reasoning, while its impact is limited on general knowledge or commonsense tasks.
Engineering Mechanics Introduction and its Application
Engineering Mechanics Introduction and its ApplicationSakthivel M Engineering Mechanics Introduction
Week 6- PC HARDWARE AND MAINTENANCE-THEORY.pptx
Week 6- PC HARDWARE AND MAINTENANCE-THEORY.pptxdayananda54 Basics of computer hardware for beginners
TEA2016AAT 160 W TV application design example
TEA2016AAT 160 W TV application design examplessuser1be9ce TEA2016AAT 160 W TV application design example (UM11553)
NALCO Green Anode Plant,Compositions of CPC,Pitch
NALCO Green Anode Plant,Compositions of CPC,Pitcharpitprachi123 Its a pdf about all the process involving in the green anode production
Universal Human Values and professional ethics Quantum AKTU BVE401
Universal Human Values and professional ethics Quantum AKTU BVE401Unknown Lastest Quantum
Year 2024-25
For semester 3 and 4
A Comprehensive Investigation into the Accuracy of Soft Computing Tools for D...
A Comprehensive Investigation into the Accuracy of Soft Computing Tools for D...Journal of Soft Computing in Civil Engineering This study will provide the audience with an understanding of the capabilities of soft tools such as Artificial Neural Networks (ANN), Support Vector Regression (SVR), Model Trees (MT), and Multi-Gene Genetic Programming (MGGP) as a statistical downscaling tool. Many projects are underway around the world to downscale the data from Global Climate Models (GCM). The majority of the statistical tools have a lengthy downscaling pipeline to follow. To improve its accuracy, the GCM data is re-gridded according to the grid points of the observed data, standardized, and, sometimes, bias-removal is required. The current work suggests that future precipitation can be predicted by using precipitation data from the nearest four grid points as input to soft tools and observed precipitation as output. This research aims to estimate precipitation trends in the near future (2021-2050), using 5 GCMs, for Pune, in the state of Maharashtra, India. The findings indicate that each one of the soft tools can model the precipitation with excellent accuracy as compared to the traditional method of Distribution Based Scaling (DBS). The results show that ANN models appear to give the best results, followed by MT, then MGGP, and finally SVR. This work is one of a kind in that it provides insights into the changing monsoon season in Pune. The anticipated average precipitation levels depict a rise of 300–500% in January, along with increases of 200-300% in February and March, and a 100-150% increase for April and December. In contrast, rainfall appears to be decreasing by 20-30% between June and September.
A Comprehensive Investigation into the Accuracy of Soft Computing Tools for D...
A Comprehensive Investigation into the Accuracy of Soft Computing Tools for D...Journal of Soft Computing in Civil Engineering
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 !!