Asymmetric Ciphers

Duration: 2 min

This video lesson is available to enrolled students.

Return to /learn/RSSB-INFORMATICS-ASSISTANT/cyber-security/physical-security-and-cryptography-basics/cryptography-fundamentals-and-cryptosystems/asset-asymmetric-ciphers after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. Numerical Ability & Problem Solving: Speed Mathematics and Basic Mathematics, Arithmetic, Number System, HCF LCM, Divisibility Rules, Percentage, Ratio and Proportion (Ratios), Average, Profit and Loss, Simple Interest and Compound Interest, Mixture and Alligation, Time and Work, Pipe and Cistern, Speed Time and Distance, Age Problems, Partnership, Data Interpretation, Mental Ability, Sequence and Series (Series), Powers and Exponents (Surds and Indices), Algebra, Statistics, Logarithm, Mensuration and Geometry, Permutation and Combination, Probability, Sequences and Series, Powers, Surds and Logarithms, Subject-Verb Agreement, Sentence Completion, Geometry, Sentence Structure and Correction, Data Sufficiency, Trigonometry, Measurement and Quantity Take-Off, Signal Space and Optimum Detection, Probability, Statistics, Algebra, Time and Work, Speed, Time and Distance, Data Interpretation, Combinatorics
  2. Logical Reasoning: Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Data Sufficiency, Syllogisms, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Seating Arrangements, Blood Relations, Directions (Direction Test), Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Analytical Reasoning (Counting Figures Reasoning), Puzzle Solving (Puzzles), Calendar, Clock, Cubes & Dices, Logical Sequence Of Words, Venn Diagram, Data Arrangement, Inequality, Analogy, Ranking, Order and Sequence, Selection Decision Table (Decision Making), 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, Direction Sense, Logical Deduction and Induction, Syllogisms and Venn Diagrams, Critical Reasoning, Order, Ranking and Sequence, Reading Comprehension, Profit, Loss and Discount, Constraint Puzzles, Traverse Surveying, Ratio and Proportion, Mensuration, Permutations and Combinations, Clocks and Calendars, Assembling and Grouping of Shapes, Transformation of Shapes, Three-Dimensional Patterns and Visualization, Cubes and Dice, Vocabulary, Blood Relations
  3. General Knowledge & Current Affairs (India + Rajasthan): History, Geography, Polity, Indian Economy, Static General Knowledge, State Wise GK, GK- Current Affairs, Environment, Physics
  4. Computer Fundamentals & Operating Systems: Basics of COA, Floating Point Rep, Digital Systems & Boolean Basics, Number Representation, Number System, Introduction to OS, File Management, Windows OS, Unix OS, Linux OS, Register Transfer and Microoperations, Virtual Memory
  5. Computer Networks: Introduction to CN, Data Communication, DLL: Error Control, DLL: Access Control, Data Link Layer - Ethernet, Net Layer: IPv4 & Proto, Application Layer, Hardware Basics, Network Security
  6. Cyber 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, Intrusion Detection Systems (IDS), Cyber Safety and Security, Ethical Hacking
  7. Programming (C & OOP): C Fundamentals, Control Flow, Arrays & Pointers, Functions, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling, OOPS with C++, Operators & Expressions, Sorting Algorithms, Java Fundamentals, Java
  8. MS Office & Data Processing: MS Office Applications, Basics of DBMS
  9. Internet & Web Technology: Society, Law & Ethics, Terms & Abbreviations, Keyboard Shortcuts, Emerging Tech Trends, Artificial Intelligence, Emerging Technologies, Internet Fundamentals, Website, Browser & Services, Web Design & Development, Protocols & Services, Web Publishing & Hosting, Server Side & Security
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

This lecture segment introduces Asymmetric Ciphers, also known as Public-Key Cryptography, defining the fundamental concept of using a key pair for encryption and decryption. The instructor details the RSA algorithm as the most widely used system, deriving its mathematical basis involving prime numbers and Euler's totient function. The lesson covers various other cryptographic standards including ECC, DSA, Diffie-Hellman, and ElGamal, distinguishing their specific applications such as digital signatures and key exchange. The session concludes with a transition to a multiple-choice question designed to test the student's ability to differentiate between symmetric and asymmetric encryption methods.

Chapters

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

    The instructor begins by defining asymmetric ciphers as systems using a public key for encryption and a private key for decryption. She focuses heavily on RSA (Rivest-Shamir-Adleman), underlining its status as the first and most widely used public-key cryptosystem. On the digital whiteboard, she writes out the mathematical parameters for RSA key generation: selecting primes p and q, calculating n as p times q, and determining phi(n) as (p-1)(q-1). She further writes the relationship d times e equals 1 modulo phi(n). The instructor underlines the text 'encryption and digital signatures' to emphasize RSA's dual utility. She briefly introduces ECC (Elliptic Curve Cryptography), noting its strong security with smaller key sizes, and DSA (Digital Signature Algorithm), linking it to the Digital Signature Standard. Finally, she highlights Diffie-Hellman as a key exchange algorithm and ElGamal as an encryption system based on discrete logarithms.

  2. 2:00 – 2:07 02:00-02:07

    The view scrolls down to reveal a multiple-choice question asking which option is NOT an example of symmetric key encryption. The visible options include (a) Digital encryption standard (DES) and (b) Triple-DES (3DES). The instructor begins annotating the question, writing '64 bit' and '56 bit' near the options, likely referring to block sizes or key lengths associated with these symmetric algorithms to help distinguish them from the asymmetric topics previously discussed.

The lecture provides a comprehensive overview of public-key cryptography, starting with the core definition of key pairs. It establishes RSA as the foundational example, providing a step-by-step mathematical derivation of its parameters on the screen to illustrate the complexity of factoring large integers. The instructor then broadens the scope to include other critical algorithms like ECC and Diffie-Hellman, clearly categorizing them by their specific functions such as key exchange or digital signatures. This theoretical foundation is immediately followed by a practical assessment question, shifting the focus to symmetric encryption standards like DES, thereby reinforcing the distinction between the two major cryptographic paradigms.

Loading lesson…