SHA

Duration: 6 min

This video lesson is available to enrolled students.

Return to /learn/HPSC-PGT-COMPUTER-SCIENCE/computer-networks/network-security/hash-mac/asset-sha after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. HPSC Interview Preparation: Interview Preparation
  2. Python Language: Introduction to Python, Tokens, Variables, Data Types, I/O, Operators & Expressions, Control Flow & Looping, Collections & Strings, Functions & Modules, File Handling & Data Analysis, DSA using Python
  3. Data Structure & Algorithms: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing, Algorithm Analysis, Sorting Algorithms, Minimum Spanning Trees, Time Complexity Analysis, Graph Theory, Shortest Path Algos
  4. Computer Networks: Introduction to CN, Data Communication, DLL: Access Control, DLL: Flow Control, Data Link Layer - Ethernet, Net Layer: IPv4 & Proto, Net Layer: IP Addressing, Transport Layer Services, TL: Congestion & UDP, Application Layer, Hardware basics, Network Security
  5. Computer System & Organisation: Basics of COA, Cache Memory Organization, Input Output Organisation, Pipelining, Instr Formats & Modes, Control Unit Design, Programming the Basic Computer
  6. Database Management System: Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, SQL, File Organization & Indexing, Transaction Management, Concurrency Control
  7. Operating Systems: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Deadlock, Threads & Process Creation, Memory Management, Virtual Memory, Disc Scheduling
  8. Digital Logic & Circuits: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation
  9. Theory Of Computation: Introduction to TOC, Deterministic FA (DFA), Non-Deterministic FA, Regular Expressions, Grammar, Regular Language Properties, Pushdown Automata & CFG, Turing Machines, Moore & Mealy Machines
  10. Compiler Design: Intro to Compilers, Lexical Analysis, Grammar & CFG, Syntax Analysis: Top-Down, Syntax Analysis: Bottom-Up, Semantic Analysis & SDT, Intermediate Code Gen, Code Optimization, Run Time Environment
  11. Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management, Data Warehousing & Mining
  12. Introduction to Emerging Trends: Emerging Tech Trends
  13. Digital Society & Cyber Law: Society, Law & Ethics
  14. HPSC PGT Previous Year Paper:
  15. HPSC Assistant Professor Previous Year Paper:
  16. Live Sessions: HPSC Live Sessions, EMRS TGT/PGT Live Class
  17. Full Mock Test:
  18. HPSC PGT - MOCK Test Series:
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

This lecture introduces the Secure Hash Algorithm (SHA) family, developed by NIST to provide stronger security than MD5. The instructor defines SHA as a set of cryptographic hash functions characterized by collision resistance, one-way functionality, and fixed-length output. The presentation systematically covers the evolution of SHA variants from SHA-0 to SHA-3, detailing their output sizes and security status. A comparative analysis between MD5 and SHA highlights the transition from insecure legacy systems to modern cryptographic standards, emphasizing why SHA is preferred for digital signatures and blockchain applications.

Chapters

  1. 0:00 – 2:00 00:00-02:00

    The instructor introduces the Secure Hash Algorithm (SHA) as a family of cryptographic hash functions developed by NIST. The slide outlines the SHA family variants, their respective output sizes in bits, and key characteristics such as collision resistance and fixed-length output. The instructor highlights the definition of SHA on the slide, emphasizing its role in providing stronger security than MD5. On-screen text explicitly states 'SHA is a family of cryptographic hash functions developed by NIST' and lists algorithms like SHA-1, SHA-256, SHA-384, and SHA-512 with output sizes ranging from 160 bits to variable lengths.

  2. 2:00 – 5:00 02:00-05:00

    The lesson transitions to a detailed hierarchical diagram classifying SHA algorithms based on development years and security status. The instructor points out that SHA-0 (1993) and SHA-1 (1995) are marked as 'No longer used (Insecure)' due to vulnerabilities, while SHA-2 (2001) and SHA-3 (2015) are 'Currently Used and Secure'. The instructor highlights specific technical specifications including output sizes, message block sizes, and notes that SHA-3 is based on the Keccak sponge function. The slide text confirms SHAKE (2015) as an Extendable-Output Function (XOF), distinguishing it from fixed-length variants.

  3. 5:00 – 6:23 05:00-06:23

    The instructor concludes with a comparative table contrasting MD5 and SHA hash functions. The table lists features such as developer, year of creation, output size, security level, and collision resistance. The instructor emphasizes that MD5 was developed by Ron Rivest in 1992 with a 128-bit output and low security, whereas SHA was developed by NIST in 1993 with outputs from 160 to 512 bits and high security. The visual evidence shows circling of 'Collision Resistance' marked as Weak for MD5 and Strong for SHA, reinforcing the trade-off between speed and security in cryptographic design.

The lecture effectively structures the learning progression from definition to classification and finally to comparative analysis. The instructor establishes SHA as a NIST-developed standard superior to MD5, using visual aids like flowcharts and tables to clarify complex cryptographic concepts. Key takeaways include the obsolescence of SHA-1 due to security flaws and the adoption of SHA-2 and SHA-3 for modern applications. The comparison table serves as a critical revision tool, summarizing the evolution from 128-bit MD5 to variable-length SHA outputs. Students should note that while SHA-3 offers flexibility through the Keccak sponge function, SHA-2 remains widely used for its balance of security and performance. The emphasis on collision resistance underscores the primary goal of cryptographic hash functions in ensuring data integrity.

Loading lesson…