Cryptography

Duration: 12 min

This video lesson is available to enrolled students.

Return to /learn/COAL-INDIA-MANAGEMENT-TRAINEE/computer-networks-security/network-security/cryptography/asset-cryptography after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. About Course: About the Course
  2. 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
  3. 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
  4. Paper-2 | Algorithms: Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos
  5. 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
  6. 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
  7. 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
  8. 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
  9. 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
  10. 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
  11. Paper-1 | General Awareness: Polity, Physics, Biology, Chemistry, Static General Knowledge, GK- Current Affairs, History, Geography, Indian Economy, Environment
  12. 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
  13. 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
  14. 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
  15. Coal India Previous Year Paper:
  16. Engineering Mathematics: Set Theory, Relations, Functions, Graph Theory, Group Theory, Propositional and Predicate Logic, Linear Algebra, Calculus
  17. Coal India Mock Test:
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

This lecture introduces cryptography as the science of securing information by converting readable data into an unreadable form. The instructor establishes a foundational model involving a sender (S) and receiver (R) communicating over an insecure channel. Key objectives include confidentiality, integrity, authentication, and non-repudiation. The lesson progresses to define core terminology: plaintext (P) as the original readable message, ciphertext (C) as the unreadable encrypted form, and cipher as the mathematical algorithm. The instructor emphasizes Kerckhoffs's Principle, stating that security relies on keeping the key secret even if the algorithm is public. Examples of algorithms like AES, DES, and RSA are provided to illustrate practical applications.

Chapters

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

    The instructor introduces cryptography as the science of securing information by converting readable data into an unreadable form. He illustrates the encryption and decryption process using a diagram where 'HELLO WORLD' is transformed into cipher text. During this explanation, the instructor draws a simple diagram representing a sender (S) and receiver (R) connected by an insecure channel to explain the flow of data. The slide outlines objectives including confidentiality, integrity, and authentication.

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

    The instructor explains the fundamental process of cryptography using a visual diagram that illustrates how plain text is converted into unreadable cipher text and back. He draws a schematic representation of the sender (S) and receiver (R) communicating over an insecure channel, emphasizing the role of encryption keys. The slide outlines objectives like confidentiality and integrity while demonstrating how keys are used for locking and unlocking data.

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

    The lesson progresses through basic cryptographic terminology, defining plaintext as the original readable message and ciphertext as the unreadable encrypted form. The instructor explains encryption as converting plaintext to ciphertext using an algorithm and key, while decryption reverses this process. Finally, the concepts of cipher (the mathematical algorithm) and key (the secret value) are introduced with examples like AES, DES, and RSA.

  4. 10:00 – 11:44 10:00-11:44

    The instructor explains the concepts of Cipher and Key within cryptography. He highlights Kerckhoffs's Principle, emphasizing that a cryptographic system should remain secure even if the algorithm is publicly known, provided the key remains secret. The instructor draws a diagram illustrating the encryption and decryption process using RSA as an example.

The lecture systematically builds a conceptual framework for cryptography, starting with high-level definitions and moving toward specific technical components. The instructor uses a sender-receiver model to contextualize the need for security in communication over insecure channels. By defining plaintext and ciphertext, the lecture establishes the transformation mechanism central to all cryptographic systems. The introduction of Kerckhoffs's Principle is critical, as it shifts the focus from algorithmic secrecy to key management. The inclusion of specific algorithms like AES, DES, and RSA provides concrete examples that ground the theoretical definitions. The visual aids, including diagrams of data flow and handwritten notes on keys, reinforce the distinction between the algorithm (cipher) and the secret value (key). This progression ensures students understand not just what cryptography is, but how it functions in practice to achieve security objectives like confidentiality and integrity.

Loading lesson…