Types of cryptography

Duration: 8 min

This video lesson is available to enrolled students.

Return to /learn/SSC-CGL-TIER-2/computer-basics-section-iii-paper-i/security-in-mobile-and-wireless-computing/cryptography-and-digital-security-technologies/asset-types-of-cryptography after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. Paper-I | Mathematical Abilities: Ratio and Proportion (Ratios), Divisibility Rules, Data Interpretation, Mixture and Alligation, Number System, Speed Time and Distance, Arithmetic, Percentage, Average, Simple Interest and Compound Interest, Profit and Loss, Partnership, Time and Work, Algebra, Mensuration and Geometry, Trigonometry, Linear Algebra
  2. Paper-I | Reasoning & General Intelligence: Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Data Sufficiency, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Syllogisms, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Seating Arrangements, Blood Relations, Directions (Direction Test), Analytical Reasoning (Counting Figures Reasoning), Puzzle Solving (Puzzles), Calendar, Clock, Cubes & Dices, Selection Decision Table (Decision Making), Logical Sequence Of Words, Crypt Arithmetic, Venn Diagram, Data Arrangement, Inequality, Analogy, Ranking, Order and Sequence, Clerical Aptitude, Verbal Classification
  3. Paper-I | English Language & Comprehension: Vocabulary, Noun, Subject Verb Agreement (Verb Noun Agreement), Adjectives, Tenses, Pronoun, Preposition, Articles, Direct and Indirect Speech, Conjunction, Modals, Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Sentence Correction (Error Correction), Sentence Completion (Fill in the blanks), Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Cloze Test (Cloze Passage), Verbal Analogy (Word Based Analogy), Sentence Construction, Active Passive Voice (Voice), Determiner, Facts, Inference and Judgements
  4. Paper-I | General Awareness: Polity, Physics, Biology, Chemistry, Environment, GK- Current Affairs, Static General Knowledge, History, Geography, Indian Economy
  5. Paper-I | Computer Knowledge/Proficiency): Basics of COA, Transport Layer Services, Keyboard Shortcuts, MS Office Applications, MS Office by Yash Sir, Emerging Tech Trends, Society, Law & Ethics, Website, Browser & Services, Internet Fundamentals, Web Design & Development, Introduction to CN, Hardware basics, Network Security, Application Layer, Cyber and Info Security, Cyber Threats and Malware Attacks, Cyber Safety and Security, Role of Internet and Web Services, Security in Mobile and Wireless Computing
  6. Paper-II | Statistics: Statistics, Probability, Research Process Steps
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

The lecture provides a comprehensive overview of cryptographic systems, starting with the basic definition of symmetric-key cryptography where a single shared secret key is used for both encryption and decryption. The instructor effectively demonstrates the scalability issue of symmetric systems by calculating the number of keys required for n users using the formula n(n-1)/2. This leads naturally into the introduction of asymmetric-key cryptography, which utilizes a pair of keys: a public key for encryption and a private key for decryption. The RSA algorithm is cited as a prominent example. The lecture further explores the application of asymmetric keys in digital signatures, where a sender signs a message with their private key to ensure integrity, authentication, and non-repudiation. This progression highlights the evolution from simple shared secrets to more secure public-key infrastructure. The visual aids, including the tree diagrams and flowcharts, clearly illustrate the flow of data and keys in both systems. The instructor's handwritten notes on the slides, such as the formula and the list of security properties, serve as key takeaways for students.

Chapters

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

    The video begins with a slide titled 'Symmetric-key cryptography' featuring a diagram of Alice and Bob connected by a 'Shared secret key'. The instructor then transitions to a slide titled 'Categories of cryptography', drawing a tree structure that splits 'Cryptography' into 'Symmetric-key' (labeled Secret-key) and 'Asymmetric-key' (labeled Public-key). She writes a list of letters A through Y and crosses them out, then poses the question '10 users how many symmetric'. To answer this, she writes the formula n(n-1)/2. She illustrates this with a diagram of four users (A, B, C, D) connected by keys K1, K2, K3, K4. She also writes 'RSA' and '2 -> public private' and mentions 'email' and 'password' as examples of where keys are used.

  2. 2:00 – 5:00 02:00-05:00

    The instructor returns to the 'Symmetric-key cryptography' slide, showing a flowchart where Plaintext goes into Encryption, becomes Ciphertext, goes into Decryption, and becomes Plaintext again, all using a 'Shared secret key'. She writes 'key = 3' and demonstrates a simple substitution cipher by writing '+ 3' for encryption and '- 3' for decryption. The slide then switches to 'Asymmetric-key cryptography', displaying a similar flowchart but with distinct keys: 'Bob's public key' (marked 'To the public') and 'Bob's private key'. She writes 'RSA' and 'K=3'. She explains the encryption process as 'Sender -> Receiver public key + message' and introduces 'Digital signature' using the 'Sender private key'.

  3. 5:00 – 7:36 05:00-07:36

    The lecture continues on the 'Asymmetric-key cryptography' slide. The instructor writes 'Receiver public key + message' and lists the security properties: 'Integrity, Authentication, Non-repudiation'. She also writes 'Sender public key' to contrast with the private key usage. This section reinforces the security benefits of asymmetric cryptography, specifically how it solves the key distribution problem and provides authentication through digital signatures. The instructor emphasizes that the public key is available to everyone, while the private key is kept secret. The visual progression from symmetric to asymmetric systems is clearly marked by the changing slide titles and the evolution of the diagrams.

The lecture provides a comprehensive overview of cryptographic systems, starting with the basic definition of symmetric-key cryptography where a single shared secret key is used for both encryption and decryption. The instructor effectively demonstrates the scalability issue of symmetric systems by calculating the number of keys required for n users using the formula n(n-1)/2. This leads naturally into the introduction of asymmetric-key cryptography, which utilizes a pair of keys: a public key for encryption and a private key for decryption. The RSA algorithm is cited as a prominent example. The lecture further explores the application of asymmetric keys in digital signatures, where a sender signs a message with their private key to ensure integrity, authentication, and non-repudiation. This progression highlights the evolution from simple shared secrets to more secure public-key infrastructure. The visual aids, including the tree diagrams and flowcharts, clearly illustrate the flow of data and keys in both systems. The instructor's handwritten notes on the slides, such as the formula and the list of security properties, serve as key takeaways for students.

Loading lesson…