Hash Function

Duration: 12 min

This video lesson is available to enrolled students.

Return to /learn/RSSB-SENIOR-COMPUTER-INSTRUCTOR/paper-2-data-communication-and-network-security/network-security/hash-mac/asset-hash-function after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. About the Course: About the Course
  2. Paper-1 & 2 | Basic Numeracy: Ratio and Proportion (Ratios), Divisibility Rules, Mixture and Alligation, Permutation and Combination, Logarithm, Number System, HCF LCM, Sequence and Series (Series), Speed Time and Distance, Percentage, Average, Mensuration and Geometry, Age Problems, Arithmetic, Statistics, Probability, Profit and Loss, Simple Interest and Compound Interest, Partnership, Speed Mathematics and Basic Mathematics, Algebra, Powers and Exponents (Surds and Indices), Time and Work, Pipe and Cistern, RSSB Specific Videos - Basic Numeracy
  3. Paper-1 & 2 | Data Interpretation: Data Interpretation
  4. Paper-1 & 2 | General Mental Ability: Mental Ability, RSSB Specific Videos - Mental Ability
  5. Paper-1 & 2 | Logical Reasoning and Analytical Ability: Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Data Sufficiency, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Syllogisms, Seating Arrangements, Blood Relations, Directions (Direction Test), Analytical Reasoning (Counting Figures Reasoning), Puzzle Solving (Puzzles), Calendar, Clock, Cubes & Dices, Venn Diagram, Analogy, Ranking, Order and Sequence, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Data Arrangement, Logical Sequence Of Words, Crypt Arithmetic
  6. Paper-1 & 2 | Decision Making and Problem Solving: Selection Decision Table (Decision Making)
  7. Paper-1 | General Science: Physics, Biology, Chemistry, RSSB Specific Videos
  8. Paper-1 | General Awareness: State Wise GK, GK- Current Affairs
  9. Paper-2 | Fundamentals of Computer: Basics of COA, Number System, Floating Point Rep, Number Representation
  10. Paper - 2 | Digital Logic Systems: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits
  11. Paper-2 | Operating Systems: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Deadlock, Threads & Process Creation, Memory Management, Virtual Memory, Disc Scheduling, File Management, Linux OS, Distributed Systems
  12. Paper-2 | Database Management System: Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, Relational Algebra, SQL, Relational Calculus, File Organization & Indexing, Transaction Management, Concurrency Control
  13. Paper-2 | Data Structures: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing
  14. Paper-2 | C Programming: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling
  15. Paper 2 | Oops, C++, Java: Language Design, OOPS with C++, Java, .Net Programming, Java Fundamentals
  16. Paper 2 | Python: Introduction to Python, Tokens, Variables, Data Types, I/O, Operators & Expressions, Control Flow & Looping, Collections & Strings, Functions & Modules, File Handling & Data Analysis
  17. Paper 2 | Emerging Trends and AI: Emerging Tech Trends, Artificial Intelligence
  18. Paper-2 | Algorithms: Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Advanced Algorithms
  19. Paper 2 | Data Communication and Network Security: Introduction to CN, Data Communication, DLL: Access Control, DLL: Flow Control, DLL: Error Control, 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, Ethical Hacking
  20. Paper-2 I Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
  21. Paper-2 | Computer Organization and Architecture: Cache Memory Organization, Input Output Organisation, Instr Formats & Modes, Control Unit Design, Register Transfer and Microoperations
  22. Paper-2 | Web Development: JavaScript-Basics, HTML Basics, CSS, XML
  23. Pedagogy: Child Development, Concept of Pedagogy, Psychology, Theories, Inclusive Education, Experiential Pedagogy, Curriculum Framework & Reforms, National Education Policy (NEP) 2020
  24. Live Sessions: RSSB Live Sessions
  25. RSSB Paper 1 - Full Mock Tests:
  26. RSSB Paper 2 - Full Mock Tests:
  27. SCI Previous Year Papers:
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

This lecture introduces hash functions as mathematical algorithms that convert input messages of any length into fixed-length values. The instructor defines the core concept using a diagram showing 'Message (Any length)' flowing through a 'HASH FUNCTION' to produce a 'Hash Value.' Key characteristics include being a one-way function, irreversible process, and utility for data integrity verification. The lesson progresses to explain the working mechanism using SHA-256, demonstrating how 'Hello World' transforms into a 256-bit hash string. Critical properties like determinism and the avalanche effect are highlighted, showing how minor input changes yield vastly different outputs. Finally, the instructor outlines eight practical applications including password storage, data integrity verification, and digital signatures.

Chapters

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

    The session opens with the instructor introducing hash functions via a slide titled 'Hash Function.' The screen displays a definition stating it is a mathematical algorithm converting input messages into fixed-length values. A diagram illustrates the flow from 'Message (Any length)' through a 'HASH FUNCTION' to a 'Hash Value.' The instructor writes '10G+G' beneath the message icon and circles '(Any length)' to emphasize input flexibility. Text on screen lists characteristics such as being a one-way function and examples like MD5, SHA-256.

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

    The instructor elaborates on hash function characteristics, emphasizing the conversion of variable-length input into fixed-length output. He highlights that it is an irreversible process used for data integrity verification and does not require decryption. The lesson transitions to a new slide detailing the working steps of a hash function, showing how an input message like 'Hello World' is processed through SHA-256 to generate a fixed-length hash value. The slide lists examples including MD5, SHA-256, and SHA-3.

  3. 5:00 – 10:00 05:00-10:00

    The lecture focuses on the properties of a good hash function, specifically fixed-length output and determinism. The instructor illustrates the 'Avalanche Effect' by showing how a tiny change in an input message results in a completely different hash value. He writes 'Password' and 'Raw' on the screen to provide examples of hashing inputs. The slide lists characteristics such as one-way function, fast computation, and collision resistance.

  4. 10:00 – 11:35 10:00-11:35

    The instructor transitions to practical applications, highlighting specific properties like fixed-length output and the avalanche effect using visual examples of SHA-256 hashing. The lesson moves to a slide detailing eight distinct applications, including password storage, data integrity verification, and digital signatures. The instructor writes '#816' and 'Digital Signatures' on the slide while pointing to application boxes like Blockchain.

The lecture systematically builds understanding of hash functions from definition to application. It begins by establishing the fundamental concept: a mathematical algorithm that maps variable-length inputs to fixed-length outputs. The instructor uses visual aids like diagrams and on-screen text to clarify that this process is one-way and irreversible, distinguishing it from encryption. Key properties such as determinism (same input always yields same output) and the avalanche effect (minor changes cause major output differences) are explained with concrete examples like 'Hello World' versus 'Hello WorlD'. The progression moves from theoretical characteristics to practical utility, culminating in a detailed list of eight applications including password storage and digital signatures. This structure ensures students grasp both the mechanics and real-world relevance of hash functions in cybersecurity.

Loading lesson…