UPSC18 resources
School10 resources
SSC5 resources
JEE4 resources
State PCS3 resources
NEET2 resources
Railway2 resources
General16 resources
What is inside
What is inside this unit
This is a 32-page PDF that covers the second unit of a Cryptography and Network Security course taught in the third year of a computer science engineering degree. The unit is split into two halves: the mathematics that cryptographic systems rest on, and the public key schemes built on top of that mathematics.
The number theory half deals with the following topics:
- Euclidean algorithm and the greatest common divisor, followed by the extended Euclidean algorithm
- Modular arithmetic and the working of residues
- Fermat’s theorem and Euler’s theorem
- Euler’s totient function
- Chinese Remainder Theorem
- Discrete logarithms
The public key half moves to the schemes themselves: the idea of asymmetric encryption, how a public key and a private key pair are used for encryption and decryption, digital signatures, key exchange, the RSA algorithm, Diffie-Hellman key exchange and elliptic curve cryptography. The notes carry algorithms, worked numerical examples, diagrams and step-by-step explanations.
Topic map
| Part | Main ideas |
|---|---|
| Number theory | GCD, modular arithmetic, theorems of Fermat and Euler, CRT, discrete logs |
| Public key principles | Asymmetric encryption, key pairs, signatures |
| Algorithms | RSA, Diffie-Hellman, elliptic curve cryptography |
Who should use it and how
The file suits students of B.Tech CSE or IT who need a compact revision aid before a university examination, and anyone who wants the arithmetic behind RSA explained with sums rather than only theory. A sensible way to work through it is to read the theorems first, redo each numerical example on paper without looking at the solution, and only then move to the key exchange procedures. Questions on RSA key generation and on Diffie-Hellman exchange with small primes are common in semester papers, so practise those by hand until the steps feel automatic.
How it maps to a syllabus
Most university syllabi place number theory and public key cryptography together as one unit, which is how this file is organised. If your syllabus lists the Chinese Remainder Theorem or elliptic curves separately, check the contents above to make sure the topics you need are present before relying on it as your only source. The notes were uploaded for students of one deemed university, so topic order may differ slightly from your own college scheme.
Exam tips for this unit
Questions from this unit usually fall in two families: computation questions, where you must find an inverse, apply the Chinese Remainder Theorem or generate RSA keys with small primes, and descriptive questions asking you to compare symmetric and asymmetric systems. Prepare a short table of the formulas you must remember, since the sums lose marks mainly through small arithmetic slips. Keep the extended Euclidean method practised, because it supports both RSA decryption keys and modular inverses.
Printed material
For long revision sessions many students prefer a printed copy of notes. Competer stocks printed study material for engineering and competitive exams, and you can browse the store for the nearest match.