Password Cracking Techniques-2

Duration: 19 min

This video lesson is available to enrolled students.

Return to /learn/RSSB-SENIOR-COMPUTER-INSTRUCTOR/paper-2-data-communication-and-network-security/ethical-hacking/password-cracking-techniques/asset-password-cracking-techniques-2 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 provides a comprehensive overview of hash algorithms, their properties, applications, and specific implementations used in cybersecurity. The session begins by defining a Hash Algorithm as a mathematical function that converts variable input data into a fixed-size output known as a hash value. The instructor outlines the hashing process through five distinct steps: Input, Hash Function, Hash Value, Properties, and Use. Key characteristics emphasized include determinism, fixed-length output, fast computation, and the one-way (irreversible) nature of hashing. The lecture further explores practical applications such as password storage, data integrity verification, digital signatures, and blockchain technology. It concludes with a detailed comparison of popular algorithms including MD5, SHA-1, SHA-2 family (SHA-256), and modern standards like bcrypt and Argon2.

Chapters

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

    The video introduces the fundamental concept of a Hash Algorithm as a mathematical function converting input data into a fixed-size hash value. The instructor displays a five-step diagram labeled Input, Hash Function, Hash Value, Properties, and Use. On-screen text defines the algorithm as a one-way process where original data cannot be easily recovered from the hash value. The instructor underlines key terms and highlights properties such as collision resistance and fast computation while explaining the conversion of variable input to fixed-size output.

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

    The lecture details the characteristics of hash algorithms, specifically focusing on Fixed-Length Output and One-Way Function properties. The instructor uses examples like 'A', 'Hello World', and 'Cyber Security' to demonstrate that regardless of input size, the resulting hash value maintains a fixed length. Visual annotations include checkmarks next to example inputs and circles around the list of inputs to group them. The instructor underlines 'input size' and 'fixed length' on the screen while emphasizing that hashing is deterministic, meaning the same input always produces the same output.

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

    This segment explains the Avalanche Effect and Fast Computation properties, followed by practical applications in password storage and data integrity verification. The instructor uses 'HELLO' and 'HELLQ' to illustrate how a tiny change in input causes a huge change in output. On-screen text defines the Avalanche Effect and lists applications including Password Storage, Data Integrity Verification, Digital Signatures, and Blockchain Technology. The instructor draws arrows to show the flow from password to hash to database and circles example passwords like 'admin123' alongside their hashed values.

  4. 10:00 – 15:00 10:00-15:00

    The video covers a comparison of popular hash algorithms including MD5, SHA-1, and the SHA-2 family. A comparison table is displayed showing features like output sizes and use cases for each algorithm. The instructor highlights SHA-256 as the most popular within the SHA-2 family and introduces SHA-3 as the latest standard based on the Keccak algorithm. Text on screen lists MD5 (Message Digest Algorithm 5), SHA-1 (Secure Hash Algorithm 1), and details the output sizes for SHA-256 (256-bit) and SHA-512. The instructor underlines key terms like 'Message Digest Algorithm 5' and circles SHA-2 family members.

  5. 15:00 – 19:09 15:00-19:09

    The final segment covers advanced password hashing algorithms, specifically focusing on bcrypt and Argon2. The instructor highlights key features such as salting in bcrypt and the memory-hard nature of Argon2, which won the Password Hashing Competition. A comparison table lists popular algorithms including MD5, SHA-1, SHA-256, bcrypt, and Scrypt. On-screen text details that bcrypt includes salting to prevent brute-force attacks while Argon2 offers strong resistance due to being memory-hard. The instructor circles 'salting' and underlines terms like 'Fast' and 'Vulnerable to collisions' for MD5.

The lecture systematically builds understanding of hash algorithms from basic definitions to advanced implementations. It begins by establishing the core definition and five-step process, emphasizing that hashing is a one-way mathematical function producing fixed-size outputs. The instructor uses visual aids like diagrams and underlined text to reinforce properties such as determinism, fixed-length output, and the Avalanche Effect. Practical applications are introduced early to contextualize theoretical concepts, showing how hashes secure passwords and verify data integrity. The progression moves from general properties to specific algorithms, comparing MD5 and SHA-1 with modern standards like SHA-256. The session concludes by distinguishing general-purpose hashes from password-specific algorithms, highlighting bcrypt's salting feature and Argon2's memory-hard design as superior choices for security. Throughout, the instructor uses concrete examples like 'HELLO' vs 'HELLQ' and 'admin123' to make abstract concepts tangible for students.

Loading lesson…