DES
Duration: 6 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 introduces the Data Encryption Standard (DES), a symmetric-key block cipher developed by IBM and adopted as a standard in 1977. The instructor details the algorithm's structure, emphasizing that DES operates on 64-bit blocks using a 56-bit effective key. A critical distinction is made between the original 64-bit key size and the effective key length, where 8 bits are reserved for parity checks. The lecture explains that DES is built upon a 16-round Feistel Network, which transforms plaintext into ciphertext through iterative rounds of substitution and permutation. The instructor highlights that the small key size makes DES vulnerable to brute-force attacks, leading to its eventual replacement by the Advanced Encryption Standard (AES). The teaching flow moves from general definitions to specific structural components, including Initial Permutation (IP), the core Feistel rounds, and Final Permutation (FP).
Chapters
0:00 – 2:00 00:00-02:00
The instructor introduces the Data Encryption Standard (DES) as a symmetric-key block cipher developed by IBM and adopted in 1977. On-screen text explicitly states 'Data Encryption Standard (DES)' and 'symmetric-key block cipher'. The instructor underlines key characteristics, noting the use of 64-bit blocks and a 56-bit effective key. The lecture mentions that DES is based on a 16-round Feistel Network and points out vulnerabilities due to the small key size, noting its replacement by AES. Visual cues include pointing to text about IBM development and gesturing towards a 'Working of DES' flowchart.
2:00 – 5:00 02:00-05:00
The instructor focuses on the key size details of DES, writing 'Original Key Size = 64' and 'Parity = 8 bits' on the whiteboard to demonstrate how the effective key size is derived. The slide text confirms that while the original key length is 64 bits, only 56 bits are used for encryption because 8 bits serve as parity bits. The instructor circles 'symmetric-key block cipher' and writes calculations to show the reduction from 64 bits to an effective 56-bit key. This section connects the key size reduction directly to vulnerabilities against brute-force attacks, emphasizing that the 8 parity bits are not used for encryption.
5:00 – 6:06 05:00-06:06
The instructor explains the working of DES, focusing on the transformation of a 64-bit plaintext into ciphertext. He points to specific steps in the flowchart, including Initial Permutation (IP), 16 Feistel Rounds, and Final Permutation (FP). Handwritten notes on the screen detail key sizes, parity bits, and binary representations of keys. The visual focus is on the 'Working of DES' diagram showing a 64-bit Plaintext (Input Block) entering the system and producing a 64-bit Ciphertext (Output Block). The instructor highlights the flow from IP through the Feistel rounds to FP, connecting plaintext to ciphertext.
The lecture provides a structured overview of the Data Encryption Standard (DES), moving from high-level definitions to specific operational mechanics. The instructor establishes DES as a symmetric-key block cipher with 64-bit blocks and a 56-bit effective key, derived from an original 64-bit input where 8 bits are parity. The core of the algorithm is identified as a 16-round Feistel Network, which processes data through Initial Permutation (IP), the main rounds, and Final Permutation (FP). The instructor uses handwritten calculations on the whiteboard to clarify the distinction between original and effective key sizes, reinforcing that 8 bits are discarded for parity. The lecture concludes by noting the algorithm's vulnerability to brute-force attacks due to its key size, leading to its replacement by AES. This progression ensures students understand both the theoretical structure and practical limitations of DES.

