SHA

Duration: 6 min

This video lesson is available to enrolled students.

Return to /learn/COAL-INDIA-MANAGEMENT-TRAINEE/computer-networks-security/network-security/hash-mac/asset-sha after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. About Course: About the Course
  2. Paper-2 | Programming & Data Structures: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling, Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing
  3. Paper-2 | Databases / DBMS & SQL: 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
  4. Paper-2 | Algorithms: Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos
  5. Paper-2 | Computer Networks & Security: 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 Access Technologies, Network Security
  6. Paper-2 | Digital Logic: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation, Floating Point Rep, Registers and Counters, Boolean Algebra and Logic Gates, Microprocessors and Microcontrollers, Logic Families and CMOS Logic, Microprocessors, Logic Gates and Boolean Algebra, Number Systems and Codes, Minimization of Boolean Functions, Timing, Hazards and Testing, Logic Families, Combinational Logic Design, Arithmetic Circuits, Waveform Generators and Timer Circuits, Semiconductor Memories and Programmable Logic Devices, Combinational Logic Circuits, Sequential Circuits and State Machines, Latches and Flip-Flops, Finite State Machines, Minimization of Boolean Functions, Arithmetic Circuits, Registers and Counters, Latches and Flip-Flops, Number Systems and Codes
  7. Paper-2 | Operating System: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Threads & Process Creation, Deadlock, Memory Management, Virtual Memory, Disc Scheduling, File Management
  8. Paper-2 | Theory of Computation: Introduction to TOC, Deterministic FA (DFA), Non-Deterministic FA, Regular Expressions, Grammar, Regular Language Properties, Moore & Mealy Machines, Pushdown Automata & CFG, Turing Machines
  9. Paper-2 | Computer Organization & Architecture: Basics of COA, Cache Memory Organization, Input Output Organisation, Pipelining, Instr Formats & Modes, Control Unit Design, Programming the Basic Computer, Semiconductor Memories and Programmable Logic, Processor Organization and Instructions, Memory Hierarchy and Input/Output
  10. 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
  11. Paper-1 | General Awareness: Polity, Physics, Biology, Chemistry, Static General Knowledge, GK- Current Affairs, History, Geography, Indian Economy, Environment
  12. Paper-1 | Logical Reasoning: Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Data Interpretation, Blood Relations, Syllogisms, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Selection Decision Table (Decision Making), Clock, Calendar, Cubes & Dices, Directions (Direction Test), Analogy, Seating Arrangements, Analytical Reasoning (Counting Figures Reasoning), Alphabet and Word Tests, Numerical Reasoning, Number System, Averages, Mixtures and Alligation, Percentages, Series Completion, Analogy and Classification, Patterns in Two-Dimensional Figures, Coding and Decoding, Mathematical Operations, Data Sufficiency, Direction Sense, Assembling and Grouping of Shapes, Transformation of Shapes, Three-Dimensional Patterns and Visualization, Cubes and Dice, Vocabulary, Statistics, Algebra, Geometry, Permutations and Combinations, Logical Deduction and Induction, Syllogisms and Venn Diagrams, Critical Reasoning, Order, Ranking and Sequence, Reading Comprehension, Speed, Time and Distance, Narrative Sequencing, Project Monitoring, Resources and Safety, Profit, Loss and Discount, Constraint Puzzles, Clocks and Calendars, Traverse Surveying, Simplification and Approximation, Blood Relations, Data Interpretation, Venn Diagram
  13. Paper-1 | Quantitative Aptitude: Ratio and Proportion (Ratios), Mixture and Alligation, Permutation and Combination, Number System, HCF LCM, Speed Time and Distance, Average, Age Problems, Percentage, Profit and Loss, Pipe and Cistern, Simple Interest and Compound Interest, Powers and Exponents (Surds and Indices), Mensuration and Geometry, Probability, Statistics, Arithmetic, Algebra, Ratio and Proportion, Subject-Verb Agreement, Sentence Completion, Powers, Surds and Logarithms, Data Interpretation, Sequences and Series, Trigonometry, Mensuration, Measurement and Quantity Take-Off, Signal Space and Optimum Detection, Time and Work, Probability, Algebra, Speed, Time and Distance, Statistics, Sequence and Series (Series), Combinatorics
  14. Paper-1 | English: Vocabulary, Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Sentence Correction (Error Correction), Cloze Test (Cloze Passage), Prepositions and Conjunctions, Idioms and Phrases, Verb Forms and Verb Patterns, Sentence Structure and Correction, Modals, Conditionals and Subjunctive, Tenses, Adjectives and Adverbs, Sentence Basics, Nouns and Pronouns, Voice and Reported Speech, Articles and Determiners, Vocabulary
  15. Coal India Previous Year Paper:
  16. Engineering Mathematics: Set Theory, Relations, Functions, Graph Theory, Group Theory, Propositional and Predicate Logic, Linear Algebra, Calculus
  17. Coal India 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…