Password Cracking Techniques-2
Duration: 19 min
This video lesson is available to enrolled students.
Inside: a video lesson and guided study material.
Module outline
- About Course: About the Course
- English Language: Vocabulary, Noun, Adjectives, Tenses, Pronoun, Adverb, Preposition, Conjunction, Active Passive Voice (Voice), Articles, Direct and Indirect Speech, Sentence Correction (Error Correction), Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Sentence Completion (Fill in the blanks), Cloze Test (Cloze Passage)
- Quantitative Aptitude & Numerical Ability: Ratio and Proportion (Ratios), Data Interpretation, Mixture and Alligation, Permutation and Combination, Number System, Sequence and Series (Series), Speed Time and Distance, Algebra, Speed Mathematics and Basic Mathematics, Percentage, Average, Time and Work, Simple Interest and Compound Interest, Profit and Loss, Age Problems, Partnership, Mensuration and Geometry, Probability, IBPS Specific Videos
- Reasoning: Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Data Sufficiency, Puzzle Solving (Puzzles), Seating Arrangements, Blood Relations, Syllogisms, Inequality, Directions (Direction Test), Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Clock, Calendar, Analytical Reasoning (Counting Figures Reasoning), Selection Decision Table (Decision Making), Cubes & Dices, Machine Input-Output
- Data Structures- Professional Knowledge: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing
- Algorithms- Professional Knowledge: Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos
- Python- Professional Knowledge: Python for Placements by Yash Sir, Collections & Strings, Functions & Modules, File Handling & Data Analysis, Python Basics
- Operating System- Professional Knowledge: Introduction to OS, Process Management, Process Synchronization, CPU Scheduling, Deadlock, Threads & Process Creation, Memory Management, Virtual Memory, Disc Scheduling, File Management, Unix OS, Linux OS, Windows OS
- DBMS + SQL- Professional Knowledge: Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), File Organization & Indexing, SQL, Transaction Management, Concurrency Control, Relational Algebra, Relational Calculus, NoSQL, Data Warehousing & Mining
- Computer Networks- Professional Knowledge: Introduction to CN, Data Communication, Net Layer: IP Addressing, Net Layer: IPv4 & Proto, Application Layer, Hardware basics, Network Security, Transport Layer Services, DLL: Flow Control, Cloud Computing
- Software Engineering- Professional Knowledge: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
- Computer Organization & Microprocessor- Professional Knowledge: Basics of COA, Cache Memory Organization, Programming the Basic Computer, Instr Formats & Modes
- Digital Logic Design- Professional Knowledge: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation
- Theory of Computation- Professional Knowledge: Introduction to TOC, Deterministic FA (DFA), Non-Deterministic FA, Regular Expressions, Regular Language Properties, Pushdown Automata & CFG, Turing Machines
- Compiler Design- Professional Knowledge: Intro to Compilers, Lexical Analysis, Grammar & CFG, Syntax Analysis: Top-Down, Intermediate Code Gen, Code Optimization
- Programming Languages- Professional Knowledge: C Programming by Yash Sir, Language Design, DMA, Macros, Scoping & File Handling, Object Oriented Programming (OOPS), Programming in C++, Java, HTML, C Language Core
- Emerging Tech- Professional Knowledge: Emerging Tech Trends, MS Office Applications
- Artificial Intelligence: Artificial Intelligence
- Image Processing: Digital Image Fundamentals
- Internet & Web Technology: Website, Browser & Services, Internet Fundamentals, Server Side & Security, 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, Cyber Safety and Security, Ethical Hacking
- Descriptive Paper: English Writing Ability
- Mains - Unit Tests:
- Mains - Full Mock Tests:
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
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: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.
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.
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.
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.

