Types of cryptography

Duration: 8 min

This video lesson is available to enrolled students.

Return to /learn/IBPS-SO-IT-MAINS/internet-web-technology/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. 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 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…