Asymmetric Key Encryption

Duration: 3 min

This video lesson is available to enrolled students.

Return to /learn/IBPS-SO-IT-MAINS/internet-web-technology/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. English Language: Vocabulary, Noun, Adjectives, Tenses, Pronoun, Adverb, Preposition, Conjunction, Active Passive Voice (Voice), Articles, Direct and Indirect Speech, Sentence Correction (Error Correction), Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Sentence Completion (Fill in the blanks), Cloze Test (Cloze Passage)
  3. Quantitative Aptitude & Numerical Ability: Ratio and Proportion (Ratios), Data Interpretation, Mixture and Alligation, Permutation and Combination, Number System, Sequence and Series (Series), Speed Time and Distance, Algebra, Speed Mathematics and Basic Mathematics, Percentage, Average, Time and Work, Simple Interest and Compound Interest, Profit and Loss, Age Problems, Partnership, Mensuration and Geometry, Probability, IBPS Specific Videos
  4. Reasoning: Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Data Sufficiency, Puzzle Solving (Puzzles), Seating Arrangements, Blood Relations, Syllogisms, Inequality, Directions (Direction Test), Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Clock, Calendar, Analytical Reasoning (Counting Figures Reasoning), Selection Decision Table (Decision Making), Cubes & Dices, Machine Input-Output
  5. Data Structures- Professional Knowledge: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing
  6. Algorithms- Professional Knowledge: Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos
  7. Python- Professional Knowledge: Python for Placements by Yash Sir, Collections & Strings, Functions & Modules, File Handling & Data Analysis, Python Basics
  8. Operating System- Professional Knowledge: Introduction to OS, Process Management, Process Synchronization, CPU Scheduling, Deadlock, Threads & Process Creation, Memory Management, Virtual Memory, Disc Scheduling, File Management, Unix OS, Linux OS, Windows OS
  9. DBMS + SQL- Professional Knowledge: Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), File Organization & Indexing, SQL, Transaction Management, Concurrency Control, Relational Algebra, Relational Calculus, NoSQL, Data Warehousing & Mining
  10. Computer Networks- Professional Knowledge: Introduction to CN, Data Communication, Net Layer: IP Addressing, Net Layer: IPv4 & Proto, Application Layer, Hardware basics, Network Security, Transport Layer Services, DLL: Flow Control, Cloud Computing
  11. Software Engineering- Professional Knowledge: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
  12. Computer Organization & Microprocessor- Professional Knowledge: Basics of COA, Cache Memory Organization, Programming the Basic Computer, Instr Formats & Modes
  13. Digital Logic Design- Professional Knowledge: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation
  14. Theory of Computation- Professional Knowledge: Introduction to TOC, Deterministic FA (DFA), Non-Deterministic FA, Regular Expressions, Regular Language Properties, Pushdown Automata & CFG, Turing Machines
  15. Compiler Design- Professional Knowledge: Intro to Compilers, Lexical Analysis, Grammar & CFG, Syntax Analysis: Top-Down, Intermediate Code Gen, Code Optimization
  16. Programming Languages- Professional Knowledge: C Programming by Yash Sir, Language Design, DMA, Macros, Scoping & File Handling, Object Oriented Programming (OOPS), Programming in C++, Java, HTML, C Language Core
  17. Emerging Tech- Professional Knowledge: Emerging Tech Trends, MS Office Applications
  18. Artificial Intelligence: Artificial Intelligence
  19. Image Processing: Digital Image Fundamentals
  20. Internet & Web Technology: Website, Browser & Services, Internet Fundamentals, Server Side & Security, 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, Cyber Safety and Security, Ethical Hacking
  21. Descriptive Paper: English Writing Ability
  22. Mains - Unit Tests:
  23. Mains - 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…