Asymmetric Key Encryption

Duration: 3 min

This video lesson is available to enrolled students.

Return to /learn/UP-POLICE-COMPUTER-OPERATOR/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 the course: About the Course
  2. General Knowledge: Polity, Physics, Biology, State Wise GK, Chemistry, History, Geography, GK- Current Affairs, Indian Economy, Static General Knowledge, Environment, Evolution of Indian Banking (Banking & Financial Awareness)
  3. Mental Aptitude and Reasoning: Ratio and Proportion (Ratios), Divisibility Rules, Data Interpretation, Permutation and Combination, Number System, Sequence and Series (Series), Speed Time and Distance, Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Data Sufficiency, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Vocabulary, Profit and Loss, Arithmetic, Mental Ability, Percentage, Algebra, Mensuration and Geometry, Age Problems, Clock, Calendar, Verbal Analogy (Word Based Analogy), Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Analogy, Analytical Reasoning (Counting Figures Reasoning), Puzzle Solving (Puzzles), Selection Decision Table (Decision Making), Cubes & Dices, Blood Relations, Venn Diagram, Logical Sequence Of Words, Inequality, Directions (Direction Test), Data Arrangement, Facts, Inference and Judgements, Syllogisms, Seating Arrangements, Ranking, Order and Sequence
  4. CS | Computer Fundamentals: Basics of COA, Number System, Number Representation, C Fundamentals, Algorithm Analysis, Input Output Organisation
  5. CS | Database Management System: Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, SQL
  6. CS | Workplace productivity Tools: MS Office Applications, Keyboard Shortcuts
  7. CS | Computer Networks: Introduction to CN, Data Communication, Data Link Layer - Ethernet, Net Layer: IPv4 & Proto, Net Layer: IP Addressing, Transport Layer Services, Application Layer, Hardware Basics, Network Security
  8. CS | The Internet: Website, Browser & Services, Internet Fundamentals, Web Design & Development, Web Publishing & Hosting, Server Side & Security, Emerging Technologies
  9. CS | Emerging Technologies: Artificial Intelligence, Emerging Tech Trends, Introduction to OS, Windows OS, Linux OS, Unix OS, JavaScript-Basics
  10. CS | Boolean algebra: Digital Systems & Boolean Basics, Boolean Expression, Boolean Minimization, Logic Gates & Hardware
  11. CS | Data Structures: Introduction to DS, Array, Stack, Queue
  12. CS | Cryptography: Society, Law & Ethics, 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
  13. UP Police Previous Year Papers:
  14. UP Police Full Mock Tests:
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…