Types of cryptography

Duration: 8 min

This video lesson is available to enrolled students.

Return to /learn/UP-LT-GRADE-ASSISTANT-TEACHER-2025/cs-12-information-security-and-cyber-laws/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. CS | 01 | Digital Logic and Circuits and Discrete Mathematical Structures: Digital Systems & Boolean Basics, Number System, Number Representation, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Set Theory, Relations, Functions, Graph Theory, Group Theory, Propositional and Predicate Logic, Permutation and Combination
  3. CS | 02 | Computer Organization and Architecture: Basics of COA, Cache Memory Organization, Input Output Organisation, Pipelining, Instr Formats & Modes, Control Unit Design, Multiprocessors
  4. CS | 03 | Data Structures and Algorithm: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing, Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos, Complexity Theory, Advanced Algorithms
  5. CS | 04 | Problem Solving through C Programming: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling
  6. CS | 05 | Object Oriented Techniques: Object Oriented Technology, Java
  7. CS | 06 | Operating System: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Threads & Process Creation, Deadlock, Memory Management, Virtual Memory, Disc Scheduling, File Management, Windows OS, Unix OS
  8. CS | 07 | Database Management Systems: Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, Relational Algebra, SQL, Relational Calculus, Transaction Management, Concurrency Control, Database Recovery, Database Security & Authorization, Query Processing & Optimization, File Organization & Indexing
  9. CS | 08 | Computer Networks: Introduction to CN, Data Communication, DLL: Access Control, DLL: Flow Control, DLL: Error Control, DLL: Framing, Data Link Layer - Ethernet, Net Layer: IPv4 & Proto, Net Layer: IP Addressing, Net Layer:Routing Protocol, Transport Layer Services, TL: Congestion & UDP, Application Layer, Hardware basics
  10. CS | 09 | Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
  11. CS | 10 | Internet Technology, Web Design and Web Technology: Internet Fundamentals, Web Design & Development, Protocols & Services, Web Publishing & Hosting, Server Side & Security, Emerging Technologies, JavaScript-Basics, HTML Basics
  12. CS | 11 | System Analysis And Design: Fundamentals of Systems and Information Systems, SDLC and Development Approaches, Software Documentation and Software Requirements Specification (SRS), SDD and Quality Assurance, Security, Risk Management & Maintenance
  13. CS | 12 | Information Security and Cyber Laws: 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
  14. CS | 13 | Computer Graphics: Basics of Computer Graphics, 2-D Geometrical Transforms and Viewing, 3-D Object Representation, Geometric Transformations and Viewing
  15. GS Paper | 01 | Indian and World Geography: Geography
  16. GS Paper | 02 | History: History
  17. GS Paper | 03 | Indian Economy & Social Development: Indian Economy
  18. GS Paper | 04 | General Science: Biology, Chemistry, वैज्ञानिक उपलब्धियाँ और अनुसंधान / Scientific Achievements and Research
  19. GS Paper | 05 | Elementary Maths: संख्या पद्धति / Number System, Divisibility Rules, महत्तम समापवर्तक और लघुत्तम समापवर्त्य / HCF and LCM, प्रतिशत / Percentage, लाभ, हानि और बट्टा / Profit, Loss and Discount, साधारण और चक्रवृद्धि ब्याज / Simple and Compound Interest, अनुपात और समानुपात / Ratio and Proportion, औसत / Average, समय और कार्य / Time and Work, समय, चाल और दूरी / Time, Speed and Distance, Algebra, घन क्षेत्रमिति / Solid Mensuration, आँकड़ा निर्वचन / Data Interpretation, Arithmetic, Statistics, Probability, Sequence and Series (Series), मिश्रण और एलिगेशन / Mixture and Alligation, Calculus, Trigonometry, Vectors, संख्या पद्धति और संख्या सिद्धांत / Number Systems and Number Theory, यूक्लिडीय ज्यामिति और क्षेत्रमिति / Euclidean Geometry and Mensuration, सांख्यिकी और प्रायिकता / Statistics and Probability, निर्देशांक ज्यामिति, सदिश और त्रिविमीय ज्यामिति / Coordinate Geometry, Vectors and 3D Geometry, बहुपद, समीकरण और सम्मिश्र संख्याएँ / Polynomials, Equations and Complex Numbers, समतल क्षेत्रमिति / Plane Mensuration, सरलीकरण, घातांक और करणी / Simplification, Indices and Surds, समुच्चय, संबंध, फलन और विविक्त गणित / Sets, Relations, Functions and Discrete Mathematics
  20. GS Paper | 06 | Indian Polity and Governance: Polity
  21. GS Paper | 07 | Current Events: समसामयिकी / Current Affairs
  22. UPLT Live Classes Notes: UPLT Live Classes
  23. UPLT Full Mock Tests Tier 1:
  24. UPLT Full Mock Tests Tier 2:
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…