21CY51 Dayananda Sagar University • Cyber Security (Semester 5)

Applied Cryptography and Network Security

💡 DSU Exam Strategy & Guidance

Symmetric Ciphers (AES, DES), Asymmetric Ciphers (RSA, Diffie-Hellman Key Exchange), Hash Functions (SHA-256), Digital Signatures, and TLS Handshake.

High-Yield Passing Strategy: Master RSA key generation and encryption/decryption with small numerical primes.
Most Repeated Question Topics:
RSA Algorithm Numerical CalculationDiffie-Hellman Key Exchange Man-in-the-Middle VulnerabilityAES Round Transformations (SubBytes, ShiftRows, MixColumns)TLS 1.3 Handshake Protocol

🔥 Most Predictable Exam Questions (1)

Guaranteed Every Year 8 Marks Module 2: Public Key Cryptography

Q1. In RSA cryptosystem, select primes p = 7 and q = 11. Choose encryption key e = 13. (i) Calculate public key and private key d, (ii) Encrypt plaintext M = 9, and (iii) Decrypt ciphertext C to retrieve original message.

Key Points: n = p * q = 77. phi(n) = (p-1)*(q-1) = 6 * 10 = 60. e = 13. Private key d = e^-1 mod phi(n) => (13 * d) mod 60 = 1 => d = 37. Encrypt: C = M^e mod n = 9^13 mod 77 = 4. Decrypt: M = C^d mod n = 4^37 mod 77 = 9.

🎓 Open Source Courses & Video Playlists (2)

Stanford Online

Stanford CS255: Introduction to Cryptography (Prof. Dan Boneh)

Watch Course ↗
MIT OpenCourseWare

MIT 6.857: Network and Computer Security

Watch Course ↗

📄 Previous Year Question Papers (1)

END_SEM • 2024

End Semester Exam 2024

View PDF ↗

Turn 21CY51 Notes into AI Flashcards

Upload your Applied Cryptography and Network Security lecture slides to generate spaced repetition study cards in seconds.

Start Free →
MindFlow
DSU Hub Sign In

Structured Active Recall for Complex Coursework.

Turn your lecture PDFs into flashcards, adaptive quizzes, and spaced repetition reviews in seconds.

Start Free Sprint →