Cryptography

Duration: 12 min

This video lesson is available to enrolled students.

Return to /learn/COGNIZANT-PREPARATION/computer-networks/network-security/cryptography/asset-cryptography after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. Communication Round: Vocabulary, Subject Verb Agreement (Verb Noun Agreement), Tenses, Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Cloze Test (Cloze Passage), Sentence Correction (Error Correction), Sentence Completion (Fill in the blanks), Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Direct and Indirect Speech, Active Passive Voice (Voice), Verbal Analogy (Word Based Analogy), Articles, Preposition, Conjunction, Sentence Construction, English Writing Ability, Communication Assessment
  2. Quantitative Aptitude: Ratio and Proportion (Ratios), Divisibility Rules, Data Interpretation, Mixture and Alligation, Permutation and Combination, Logarithm, Number System, HCF LCM, Speed Time and Distance, Percentage, Average, Powers and Exponents (Surds and Indices), Time and Work, Mensuration and Geometry, Age Problems, Pipe and Cistern, Probability, Profit and Loss, Simple Interest and Compound Interest, Algebra
  3. Analytical and Logical Reasoning: Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Data Sufficiency, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Directions (Direction Test), Ranking, Order and Sequence, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Selection Decision Table (Decision Making), Logical Sequence Of Words, Puzzle Solving (Puzzles), Syllogisms, Seating Arrangements, Calendar, Clock, Blood Relations, Cubes & Dices, Venn Diagram, Analytical Reasoning (Counting Figures Reasoning)
  4. Cognizant Gaming Aptitude: Gamified / Game Based Aptitude
  5. Java (Cluster 1): Java
  6. ANSI SQL MySQL (Cluster 1,2,3): SQL
  7. HTML, CSS, JavaScript (Cluster 1,3): HTML, CSS, JavaScript
  8. Python (Cluster 2): Python for Placements by Yash Sir
  9. Cloud Fundamentals (Cluster 2): Emerging Tech Trends
  10. C# (Cluster 3): C#
  11. OOPs: Object Oriented Programming (OOPS)
  12. Technical Assessment (Coding): Coding Questions by Yash Sir, C Programming by Yash Sir, Programming in C++, Pseudo Codes
  13. Data Structures: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing
  14. DBMS: Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, File Organization & Indexing, Relational Algebra, Relational Calculus, Transaction Management, Concurrency Control, Database Recovery, ORDBMS, Database Security & Authorization, Query Processing & Optimization, Enhanced Data Models, Data Warehousing & Mining, Big Data Systems, NoSQL
  15. Operating Systems: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Deadlock, Threads & Process Creation, Memory Management, Virtual Memory, Disc Scheduling, File Management, Windows OS, Linux OS, Security, Distributed Systems, Virtual Machines
  16. Computer Networks: 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 Security, Cloud Computing and IoT, Cyber and Info Security
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…