DES

Duration: 6 min

This video lesson is available to enrolled students.

Return to /learn/ZERO-TO-HERO/computer-networks/network-security/encryption-algorithms/asset-des after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. Database Management System: 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
  2. Discrete Mathematics: Set Theory, Relations, Functions, Graph Theory, Group Theory, Propositional and Predicate Logic
  3. Digital Electronics: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation, 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, 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
  4. Computer Architecture: Basics of COA, Floating Point Rep, Cache Memory Organization, Input Output Organisation, Pipelining, Instr Formats & Modes, Control Unit Design, Semiconductor Memories and Programmable Logic, Processor Organization and Instructions, Memory Hierarchy and Input/Output
  5. Operating System: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Deadlock, Virtual Memory, Disc Scheduling, File Management, Memory Management, Threads & Process Creation
  6. Computer Networks: Introduction to CN, 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, Network Security, Hardware Basics
  7. Data Structures: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing
  8. Algorithms: Algorithm Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos, Time Complexity Analysis
  9. 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, Complexity Theory
  10. 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
  11. C language: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums
  12. Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
  13. Emerging Trends & AI: Emerging Tech Trends, Artificial Intelligence, Cloud Computing, Internet of Things
  14. Computer Graphics: Basics of Computer Graphics, 2-D Geometrical Transforms and Viewing
  15. Aptitude: Percentage, Ratio and Proportion (Ratios), Logarithm, HCF LCM, Average, Sequence and Series (Series), Number System, Powers and Exponents (Surds and Indices), Algebra, Permutation and Combination, Probability, Profit and Loss, Simple Interest and Compound Interest, Pipe and Cistern, Speed Time and Distance, Mixture and Alligation, Mensuration and Geometry, Mental Ability, Age Problems, Partnership, Statistics, Data Interpretation, Arithmetic, Linear Algebra, Trigonometry, Percentages, Simplification and Approximation, Number System, Ratio and Proportion, Averages, Mixtures and Alligation, Permutations and Combinations, Profit, Loss and Discount, Sequences and Series, Vocabulary, Subject-Verb Agreement, Sentence Completion, Geometry, Reading Comprehension, Powers, Surds and Logarithms, Mathematical Operations, Alphabet and Word Tests, Transformation of Shapes, Signal Space and Optimum Detection, Constraint Puzzles, Mensuration, Patterns in Two-Dimensional Figures, Measurement and Quantity Take-Off, Three-Dimensional Patterns and Visualization, Numerical Reasoning, Sentence Structure and Correction, Critical Reasoning, Syllogisms and Venn Diagrams, Coding and Decoding, Series Completion, Order, Ranking and Sequence, Data Sufficiency, Differential Calculus, Wireless, Satellite and Optical Communication Systems, Complex Analysis, Vector Analysis, Trigonometry, Probability, Statistics, Differential Calculus, Algebra, Time and Work, Speed, Time and Distance, Data Interpretation, Combinatorics
  16. Reasoning: Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Data Sufficiency, Syllogisms, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Seating Arrangements, Blood Relations, Directions (Direction Test), Analytical Reasoning (Counting Figures Reasoning), Puzzle Solving (Puzzles), Calendar, Clock, Cubes & Dices, Selection Decision Table (Decision Making), Logical Sequence Of Words, Venn Diagram, Data Arrangement, Inequality, Analogy, Ranking, Order and Sequence, TCS NQT Advanced Reasoning Ability, Assembling and Grouping of Shapes, Cubes and Dice, Analogy and Classification, Direction Sense, Algebra, Logical Deduction and Induction, Speed, Time and Distance, Narrative Sequencing, Project Monitoring, Resources and Safety, Traverse Surveying, Time and Work, Clocks and Calendars, Data Interpretation, Blood Relations, Data Sufficiency
  17. English (Verbal Ability): Vocabulary, Noun, Pronoun, Adjectives, Preposition, Articles, Direct and Indirect Speech, Tenses, Conjunction, Subject Verb Agreement (Verb Noun Agreement), Modals, Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Sentence Correction (Error Correction), Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Cloze Test (Cloze Passage), Verbal Analogy (Word Based Analogy), Adverb, Verb, Prepositions and Conjunctions, Idioms and Phrases, Verb Forms and Verb Patterns, Sentence Basics, Nouns and Pronouns, Adjectives and Adverbs, Articles and Determiners, Voice and Reported Speech, Modals, Conditionals and Subjunctive, Blood Relations, Tenses, Vocabulary
  18. Engineering Mathematics: Calculus, Vectors
  19. GATE Live Class Recordings 2026: GATE 2026 Live Class
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

  1. 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. 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.

  3. 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.

Loading lesson…