SHA

Duration: 6 min

This video lesson is available to enrolled students.

Return to /learn/UPPSC-POLYTECHNIC-LECTURER-2025-CS/paper-1-computer-networks/network-security/hash-mac/asset-sha after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. About Course: UPPSC Course Overview
  2. Interview Preparation & Guidance: Interview Preparation
  3. Paper 1 | General Hindi: भाषा, लिपि, ध्वनि, वर्ण, अक्षर, स्वर, व्यंजन, मात्रा और संयुक्ताक्षर, वर्तनी, वर्ण-विन्यास, अनुस्वार, अनुनासिक, चंद्रबिंदु और ‘र’ के रूप, शब्द, पद और शब्द-भेद, संज्ञा और सर्वनाम, विशेषण और क्रिया, लिंग, वचन, पुरुष और कारक, काल, वाच्य, वाक्य और वाक्य-भेद, वर्णमाला, समास, संधि, विलोम शब्द, पर्यायवाची शब्द, सामान्य अशुद्धियाँ, अनेक शब्दों के लिए एक शब्द, मुहावरे और लोकोक्तियाँ, अपठित गद्यांश और अपठित पद्यांश, Multi-Topic Content (Cross-Concept Material)
  4. Paper 2 | General Studies: State Wise GK, Polity, Geography, History, GK- Current Affairs
  5. Paper 1 | Programming Language: Language Design, C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling, OOPS with C++
  6. Paper 1 | Database Management Systems: Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, File Organization & Indexing, Relational Algebra, SQL, Relational Calculus, Transaction Management, Concurrency Control, ORDBMS, NoSQL
  7. Paper 1 | Cyber Security: Society, Law & Ethics, Cyber Threats and Malware Attacks, Role of Internet and Web Services, Security in Mobile and Wireless Computing, Electronic Data Interchange and E-Commerce, Physical Security and Cryptography Basics, Intrusion Detection Systems (IDS), Cyber Safety and Security, Ethical Hacking
  8. Paper 1 | Computer Organization and Architecture: Basics of COA, Programming the Basic Computer, Cache Memory Organization, Input Output Organisation, Instr Formats & Modes, Register Transfer and Microoperations, Control Unit Design
  9. Paper 1 | Computer Networks: Introduction to CN, Data Communication, DLL: Access Control, DLL: Flow Control, DLL: Error Control, DLL: Framing, Data Link Layer - Ethernet, Net Layer: IPv4 & Proto, Net Layer: IP Addressing, Net Layer:Routing Protocol, Transport Layer Services, TL: Congestion & UDP, Application Layer, Hardware basics, Network Security
  10. Paper 1 | Design and Analysis of Algorithms: Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos, Advanced Algorithms
  11. Paper 1 | Data Structures: Introduction to DS, Array, Linked List, Stack, Queue, Tree, Graphs, Hashing
  12. Paper 1 | Discrete Structures and Theory of Logic: Permutation and Combination, Set Theory, Relations, Functions, Propositional and Predicate Logic, Graph Theory, Group Theory
  13. Paper 1 | Software Project Management: Software Project Management
  14. Paper 2 | Operating Systems: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Threads & Process Creation, Deadlock, Memory Management, Virtual Memory, Disc Scheduling, File Management, Unix OS, Linux OS, Security
  15. Paper 2 | 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, Introduction to TOC, Deterministic FA (DFA), Non-Deterministic FA, Regular Expressions, Pushdown Automata & CFG, Complexity Theory
  16. Paper 2 | Artificial Intelligence & High Performance Computing: Approaches to AI, Search Algorithms, Game Playing, Knowledge Representation, Planning, Multi Agent Systems, Natural Language Processing, Emerging Tech Trends
  17. Paper 2 | Image Processing: Digital Image Fundamentals, Image Enhancement, Image Restoration, Color Image Processing, Image Compression
  18. Paper 2 | Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
  19. Paper 2 | Computer Graphics: Basics of Computer Graphics, 2-D Geometrical Transforms and Viewing, 3-D Object Representation, Geometric Transformations and Viewing
  20. Paper 2 | Web Technologies: Website, Browser & Services, Internet Fundamentals, Web Design & Development, Protocols & Services, Web Publishing & Hosting, Server Side & Security, Emerging Technologies, HTML Basics, JavaScript-Basics, Java
  21. Paper 2 | Soft Computing: Fuzzy Sets, Artificial Neural Networks, Genetic Algorithms
  22. Paper 2 | Distributed System: Distributed Systems
  23. UPPSC Live Class Recordings: UPPSC Polytechnic Lecturer 2025 (CS)
  24. Previous Year Papers:
  25. Mock Test:
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…