21CY41 Dayananda Sagar University • Cyber Security (Semester 4)

Number Theory and Cryptography Foundations

💡 DSU Exam Strategy & Guidance

Modular Arithmetic, Euclidean Algorithm & Extended Euclidean, Fermat’s Little Theorem, Euler’s Totient Function, and Chinese Remainder Theorem.

High-Yield Passing Strategy: Solve modular inverse using Extended Euclidean algorithm and Chinese Remainder Theorem systems of congruences.
Most Repeated Question Topics:
Extended Euclidean Algorithm for Modular InverseEuler’s Totient Function & Euler’s TheoremChinese Remainder Theorem Numerical SolutionDiscrete Logarithm Problem in Cryptography

📄 Previous Year Question Papers (1)

END_SEM • 2024

End Semester Exam 2024

View PDF ↗

Turn 21CY41 Notes into AI Flashcards

Upload your Number Theory and Cryptography Foundations lecture slides to generate spaced repetition study cards in seconds.

Start Free →