Asymmetric Key Encryption

Duration: 3 min

This video lesson is available to enrolled students.

Return to /learn/UP-LT-GRADE-ASSISTANT-TEACHER-2025/cs-12-information-security-and-cyber-laws/physical-security-and-cryptography-basics/cryptography-fundamentals-and-cryptosystems/asset-asymmetric-key-encryption after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. About Course: About the Course
  2. CS | 01 | Digital Logic and Circuits and Discrete Mathematical Structures: Digital Systems & Boolean Basics, Number System, Number Representation, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Set Theory, Relations, Functions, Graph Theory, Group Theory, Propositional and Predicate Logic, Permutation and Combination
  3. CS | 02 | Computer Organization and Architecture: Basics of COA, Cache Memory Organization, Input Output Organisation, Pipelining, Instr Formats & Modes, Control Unit Design, Multiprocessors
  4. CS | 03 | Data Structures and Algorithm: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing, Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos, Complexity Theory, Advanced Algorithms
  5. CS | 04 | Problem Solving through C Programming: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling
  6. CS | 05 | Object Oriented Techniques: Object Oriented Technology, Java
  7. CS | 06 | Operating System: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Threads & Process Creation, Deadlock, Memory Management, Virtual Memory, Disc Scheduling, File Management, Windows OS, Unix OS
  8. CS | 07 | Database Management Systems: Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, Relational Algebra, SQL, Relational Calculus, Transaction Management, Concurrency Control, Database Recovery, Database Security & Authorization, Query Processing & Optimization, File Organization & Indexing
  9. CS | 08 | 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
  10. CS | 09 | Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
  11. CS | 10 | Internet Technology, Web Design and Web Technology: Internet Fundamentals, Web Design & Development, Protocols & Services, Web Publishing & Hosting, Server Side & Security, Emerging Technologies, JavaScript-Basics, HTML Basics
  12. CS | 11 | System Analysis And Design: Fundamentals of Systems and Information Systems, SDLC and Development Approaches, Software Documentation and Software Requirements Specification (SRS), SDD and Quality Assurance, Security, Risk Management & Maintenance
  13. CS | 12 | Information Security and Cyber Laws: Cyber Threats and Malware Attacks, Role of Internet and Web Services, Security in Mobile and Wireless Computing, Electronic Data Interchange and E-Commerce, Physical Security and Cryptography Basics, Intrusion Detection Systems (IDS), Cyber Safety and Security
  14. CS | 13 | Computer Graphics: Basics of Computer Graphics, 2-D Geometrical Transforms and Viewing, 3-D Object Representation, Geometric Transformations and Viewing
  15. GS Paper | 01 | Indian and World Geography: Geography
  16. GS Paper | 02 | History: History
  17. GS Paper | 03 | Indian Economy & Social Development: Indian Economy
  18. GS Paper | 04 | General Science: Biology, Chemistry, वैज्ञानिक उपलब्धियाँ और अनुसंधान / Scientific Achievements and Research
  19. GS Paper | 05 | Elementary Maths: संख्या पद्धति / Number System, Divisibility Rules, महत्तम समापवर्तक और लघुत्तम समापवर्त्य / HCF and LCM, प्रतिशत / Percentage, लाभ, हानि और बट्टा / Profit, Loss and Discount, साधारण और चक्रवृद्धि ब्याज / Simple and Compound Interest, अनुपात और समानुपात / Ratio and Proportion, औसत / Average, समय और कार्य / Time and Work, समय, चाल और दूरी / Time, Speed and Distance, Algebra, घन क्षेत्रमिति / Solid Mensuration, आँकड़ा निर्वचन / Data Interpretation, Arithmetic, Statistics, Probability, Sequence and Series (Series), मिश्रण और एलिगेशन / Mixture and Alligation, Calculus, Trigonometry, Vectors, संख्या पद्धति और संख्या सिद्धांत / Number Systems and Number Theory, यूक्लिडीय ज्यामिति और क्षेत्रमिति / Euclidean Geometry and Mensuration, सांख्यिकी और प्रायिकता / Statistics and Probability, निर्देशांक ज्यामिति, सदिश और त्रिविमीय ज्यामिति / Coordinate Geometry, Vectors and 3D Geometry, बहुपद, समीकरण और सम्मिश्र संख्याएँ / Polynomials, Equations and Complex Numbers, समतल क्षेत्रमिति / Plane Mensuration, सरलीकरण, घातांक और करणी / Simplification, Indices and Surds, समुच्चय, संबंध, फलन और विविक्त गणित / Sets, Relations, Functions and Discrete Mathematics
  20. GS Paper | 06 | Indian Polity and Governance: Polity
  21. GS Paper | 07 | Current Events: समसामयिकी / Current Affairs
  22. UPLT Live Classes Notes: UPLT Live Classes
  23. UPLT Full Mock Tests Tier 1:
  24. UPLT Full Mock Tests Tier 2:
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

The lecture begins by analyzing the drawbacks of symmetric key encryption, specifically highlighting that keys must be changed regularly, which makes the mechanism expensive and cumbersome. It presents a mathematical formula for the number of keys required in a group of n people to enable two-party communication, calculated as n times n minus one divided by two. The instructor then lists the advantages of symmetric encryption, noting that key length is smaller, making the encryption and decryption process faster and requiring less processing power. The session transitions to Asymmetric Key Encryption, defined as a process where different keys are used for encrypting and decrypting information. Although the keys are different, they are mathematically related, allowing the plaintext to be retrieved by decrypting the ciphertext. The lecture concludes by illustrating this process with a diagram involving a repository of public keys and private keys held by the sender and receiver.

Chapters

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

    The video starts with a slide discussing the limitations of symmetric encryption. The text states that as keys are required to be changed regularly, this mechanism becomes expensive and cumbersome. A key formula is highlighted: 'In a group of n people, to enable two-party communication between any two persons, the number of keys required for group is n x n - 1/2.' This emphasizes the scalability issue. The slide then lists advantages: 'Length of Key numberofbits in this encryption is smaller and hence, process of encryption decryption is faster than asymmetric key encryption.' It also notes that the 'Processing power of computer system required to run symmetric algorithm is less.' The section ends with the introduction of 'Asymmetric Key Encryption,' defined as a process where different keys are used for encrypting and decrypting the information.

  2. 2:00 – 2:35 02:00-02:35

    The instructor explains the Asymmetric Key Encryption process using a diagram. The diagram shows a 'Repository' containing 'Public Key (Host 1)' and 'Public Key (Host 2).' 'Host 1 (Sender)' possesses a 'Private Key (Host 1)' and 'Public Key (Host 2).' 'Host 2 (Receiver)' possesses a 'Private key (Host 2).' The flow shows 'plain text' entering an 'Encrypt' box, using the receiver's public key, sending ciphertext through a 'Reliable Distribution Channel,' and entering a 'Decrypt' box using the receiver's private key to output 'plain text.' The instructor writes handwritten notes on the right side, illustrating the concept with names: 'Anarkali -> Salim,' 'Encrypt -> Anarkali pub,' and 'Decrypt -> Anarkali Private,' demonstrating how one encrypts with the other's public key.

The lecture effectively contrasts symmetric and asymmetric encryption. Symmetric encryption is fast and efficient but suffers from a key management problem where the number of keys grows quadratically with the number of users (n(n-1)/2). Asymmetric encryption solves this by using a pair of mathematically related keys: a public key for encryption and a private key for decryption. This allows secure communication without the need for a pre-shared secret key, as demonstrated by the sender encrypting data with the receiver's public key, which only the receiver can decrypt with their private key.

Loading lesson…