Block & Stream Cipher
Duration: 8 min
This video lesson is available to enrolled students.
Inside: a video lesson and guided study material.
Module outline
- About Course: About the Course
- 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
- 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
- Paper-2 | Algorithms: Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos
- 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
- 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
- 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
- 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
- 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
- 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
- Paper-1 | General Awareness: Polity, Physics, Biology, Chemistry, Static General Knowledge, GK- Current Affairs, History, Geography, Indian Economy, Environment
- 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
- 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
- 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
- Coal India Previous Year Paper:
- Engineering Mathematics: Set Theory, Relations, Functions, Graph Theory, Group Theory, Propositional and Predicate Logic, Linear Algebra, Calculus
- Coal India Mock Test:
AI summary & chapters
AI Summary
An AI-generated summary of this video lecture.
This lecture segment introduces the fundamental classification of encryption algorithms within Symmetric Key Cryptography, distinguishing between Block Ciphers and Stream Ciphers based on their plaintext processing methods. The instructor systematically explains that Block Ciphers operate by dividing plaintext into fixed-size blocks, encrypting each block independently or through specific modes of operation such as ECB and CBC. Key examples provided include DES with a 64-bit block size, 3DES also using 64 bits, and AES utilizing a larger 128-bit block size. The lecture highlights that padding may be necessary if the final plaintext block is smaller than the required fixed size. Conversely, Stream Ciphers are described as encrypting data continuously one bit or byte at a time by generating a keystream and combining it with the plaintext, typically using an XOR operation. Visual aids throughout the presentation reinforce these concepts by displaying hierarchical diagrams of encryption types, flowcharts showing plaintext to ciphertext transformation, and specific mathematical annotations regarding data size calculations.
Chapters
0:00 – 2:00 00:00-02:00
The instructor begins by introducing the classification of encryption algorithms under Symmetric Key Cryptography, visually displaying a hierarchy that branches into Block Cipher and Stream Cipher. On-screen text explicitly states 'Encryption algorithms are classified into two types based on how they process plaintext,' establishing the core topic. The instructor underlines key text to emphasize this distinction, while a diagram illustrates the split between Block Cipher and Stream Cipher. Specific examples of block sizes are introduced on the slide, listing DES (64-bit), 3DES (64-bit), and AES (128-bit) under the Block Cipher category. The instructor writes 'Data Size = 16' on the screen to illustrate a specific block size example and annotates plaintext blocks with '4 b' or '4 bytes,' indicating the size of individual units within those blocks. This section establishes the foundational definitions and visual structure for understanding how different ciphers handle data input.
2:00 – 5:00 02:00-05:00
The lecture transitions into a detailed explanation of Block Cipher mechanics, demonstrating how plaintext is divided into fixed-size blocks for encryption. The instructor underlines 'Plaintext' and draws a large circle around the top row of blocks, visually separating input from output. A clear flow is shown where Plaintext (Block 1, Block 2, etc.) undergoes encryption to produce Ciphertext (Cipher1, Cipher2, etc.). The instructor emphasizes that each block is encrypted independently or using specific modes of operation like ECB, CBC, CFB, OFB, and CTR. Calculations for data size and block size are written on the left side of the screen, reinforcing the relationship between total data and fixed block units. The instructor circles the 'Ciphertext' section at the bottom to show the final output result, highlighting that Block Ciphers encrypt one fixed-size block at a time. This segment solidifies the concept of independent block processing and introduces the necessity of padding if the last block is smaller than the required size.
5:00 – 7:45 05:00-07:45
The final segment covers the characteristics and examples of Block Ciphers before transitioning to Stream Ciphers. The instructor discusses padding requirements for the last block and mentions suitability for file and database encryption, listing DES, 3DES, and AES as primary examples. The lecture then shifts to Stream Ciphers, explaining that they encrypt data continuously one bit or byte at a time using a keystream combined with plaintext via XOR. Visual aids illustrate the XOR process for stream ciphers, showing Plaintext (P1, P2, P3...) combined with Keystream (K1, K2, K3...) to produce Ciphertext (C1, C2, C3...). The instructor writes mathematical examples for XOR operations on the board and circles key terms like 'Plaintext', 'Keystream', and 'Ciphertext' to distinguish them from block processing. This section concludes by contrasting bit-by-bit encryption in Stream Ciphers with the fixed-size block encryption of Block Ciphers, highlighting differences in security levels and processing methods.
The lecture provides a structured comparison of Symmetric Key Cryptography types, focusing on the operational differences between Block and Stream Ciphers. Block Ciphers are defined by their fixed-size processing, where data is segmented into uniform blocks (e.g., 64-bit for DES/AES) that are encrypted independently or in modes like ECB and CBC. This method often requires padding for incomplete final blocks, making it suitable for structured data like files and databases. In contrast, Stream Ciphers process data continuously at the bit or byte level using a generated keystream and XOR operations, offering a different approach to encryption that does not rely on fixed block segmentation. The visual hierarchy and mathematical annotations reinforce these distinctions, providing students with clear examples of algorithm specifications such as DES (64-bit), 3DES (64-bit), and AES (128-bit). The progression from classification to specific mechanics ensures a comprehensive understanding of how plaintext is transformed into ciphertext through these two primary methods.

