MH5301: pass the exams, not just read the notes
Your complete guide to Nanyang Technological University's modern cryptography: real-world applications and impact course. See where the marks are, work real practice questions, and study with an AI tutor that knows MH5301.
Sia generates MH5301 practice questions, walks through cryptosystem architecture and stream ciphers step by step, and quizzes you on the material the exam weights most heavily.
Worked example
A developer encrypts each database field with AES in ECB mode, using one key. Every algorithm involved is standard and unbroken. What is wrong?
Separate the cipher from the mode. AES is the block cipher; ECB is the mode deciding how blocks are chained. The cipher being unbroken says nothing about the mode being appropriate.
Note that no key is recovered. An attacker learns structure without breaking anything. This is exactly what ILO5 describes: a primitive not used in its intended way, with the issue arising from the usage rather than the algorithm.
State the fix. A mode providing semantic security, such as CBC with a random initialisation vector or an authenticated mode like GCM, ensures identical plaintexts encrypt differently. Option D is the classic misdirection — key length addresses brute force, which was never the weakness here.
The trap: Option B is the answer that follows from checking the algorithm and stopping, and it is the reason this course exists. The famous illustration is an image encrypted in ECB mode: the pixels are all encrypted with unbroken AES, and the picture is still visible. Correct primitives, wrong usage. classic slip!
One exam decides 25% of your grade. Individual; no make-up test. This whole page is built around that.
Overview
What MH5301 is, and where it sits
MH5301 is unusual among cryptography courses in what it optimises for. the course aims state it introduces you to the world of modern cryptography, and that to help you understand and appreciate how cryptography safeguards digital information, the course looks at how it is used in real-world applications and at case studies of flawed cryptosystems.
That second half — flawed cryptosystems — is the distinguishing feature. The fifth intended learning outcome asks you to interpret the situation when primitives or cryptosystems are not used in their intended way and identify the potential issues. Most of the failures in real cryptography are not broken algorithms but correct algorithms used wrongly, and this course assesses that directly.
NTU publishes a full thirteen-week schedule for this course: introduction, stream ciphers, block ciphers and modes of operation, padding and the birthday paradox, hash functions, message authentication codes and authenticated encryption, lightweight cryptography, public-key encryption and RSA, Diffie-Hellman and elliptic curves, digital signatures and post-quantum cryptography, certificates and transport layer security, random number generators, and a final week of further topics.
Always treat your own course outline and the exam timetable as authoritative.
Difficulty & time commitment
Is MH5301 hard, and how much time does it take?
MH5301 is manageable if you keep a weekly rhythm and treat the back half as the main event. The pattern is consistent: it starts gently and steepens, and the heaviest assessment is the part that separates grades.
The difficulty curve and the assessment weighting point the same way: the back half is harder and worth more. Front-loading effort there is the highest-return decision in the course.
Is this course for you
Who tends to do well, and who tends to struggle
You will likely do well if
- You attend every test. With no make-up tests, presence is worth more here than in any other course we cover.
- You focus on how primitives are used, not only on what they do — ILO5 runs through every test.
- You keep the cipher and the mode conceptually separate, which is where most real failures live.
- You do the mini quizzes as they are released; at 25% they are the only untimed component.
You may struggle if
- You miss a test without documentation, losing 25% outright with no way to recover it.
- You study algorithms in isolation and cannot spot a correct primitive used wrongly.
- You treat the mathematics as the hard part; the case studies of flawed systems are where the marks separate.
- You leave public-key cryptography late — RSA, Diffie-Hellman and elliptic curves all arrive after week 8.
- For every primitive, note what security property it provides and one way it is commonly misused. That pairing is ILO5 in miniature.
- Learn the modes of operation properly. ECB versus CBC versus GCM explains a large share of real-world breaks.
- Track the weekly schedule against the test weeks: test 1 covers through hash functions, test 2 through RSA, test 3 through random number generators.
- Practise the short-answer format specifically — 15 of each test's 25 marks are short answer, not multiple choice.
Syllabus
The 12 topics, topic by topic
The exam-weight marker on each topic shows where the marks concentrate. The amber topics carry the highest exam weight.
T1 · Cryptosystem architecture
ILO1, Week 1How the components fit together before any single one is studied in depth.
T2 · Stream ciphers
Schedule, Week 2Encrypting a continuous stream, and where stream ciphers fail in practice.
T3 · Block ciphers and modes of operation
Schedule, Week 3The cipher itself versus the mode it runs in — a distinction that decides real security.
T4 · Padding and the birthday paradox
Schedule, Week 4Two mechanisms behind a surprising number of practical attacks.
T5 · Hash functions
Schedule, Week 5One-way functions, collision resistance, and what a hash does and does not guarantee.
T6 · Message authentication and authenticated encryption
Schedule, Week 6Integrity alongside confidentiality, and why encryption alone is insufficient.
T7 · Lightweight cryptography
Schedule, Week 7Cryptography under constrained resources, as in embedded and IoT systems.
T8 · Public-key encryption and RSA
Schedule, Week 8Asymmetric cryptography and the number theory it rests on.
T9 · Diffie-Hellman and elliptic curve cryptography
Schedule, Week 9Establishing a shared secret over an open channel, and the modern efficient form.
T10 · Digital signatures and post-quantum cryptography
Schedule, Week 10Origin authentication, and what changes when quantum computers arrive.
T11 · Certificates and transport layer security
Schedule, Week 11How trust is chained in practice, and the protocol securing most internet traffic.
T12 · Random number generators
Schedule, Week 12The component whose failure silently breaks everything built on it.
How it's assessed
Assessment structure
| Component | Weight | Format & timing |
|---|---|---|
| Continuous Assessment: Test 1 | 25% | Individual test in week 5, comprising 10% multiple choice and 15% short answer, supporting ILOs 1, 2, 4 and 5. Week 5. Individual; no make-up test. |
| Continuous Assessment: Test 2 | 25% | Individual test in week 8, same structure, supporting ILOs 1, 2, 4 and 5. Week 8. Individual; no make-up test. |
| Continuous Assessment: Test 3 | 25% | Individual test in week 12, same structure, supporting ILOs 1, 3 and 5. Week 12. Individual; no make-up test. |
| Continuous Assessment: Mini Quizzes | 25% | Mini quizzes released throughout the course for quick feedback, able to be done individually or as a team, supporting all five ILOs. Throughout. Individual or team. |
- The four components sum to 100. NTU publishes an unusually specific absenteeism policy for this course: you must attend at least two of the three tests to complete it, and there are no make-up tests. Missing one test with an approved medical or short leave rescales your total to a base of 100%; missing two or all three with valid reason may make you eligible for an incomplete grade; a missed test without valid reason scores zero.
- There is no final examination. Three tests carry 75% between them, in weeks 5, 8 and 12, each split as 10% multiple choice and 15% short answer. The absenteeism rule is the thing to plan around: with no make-up tests, a single missed week without documentation costs a quarter of the grade outright.
This is an exam-cram course. With the exams at 75% of the grade and the continuous assessment: test 1 alone at 25%, your result is overwhelmingly decided by how well you perform under time pressure. Individual; no make-up test.
Final exam timing: No final examination in this course. Confirm the exact date and venue on your exam timetable.
How to actually pass it
A weekly rhythm, two checklists, and the traps to avoid
The course rewards consistency over cramming, and practice over re-reading. Here is the loop that works, then what to have nailed before each exam.
The weekly loop
Before the mid-semester checklist
- Recognise how cryptographic components form a complete cryptosystem.
- Explain stream ciphers, block ciphers and modes of operation.
- Account for padding and the birthday paradox and their role in attacks.
- Explain hash functions, message authentication codes and authenticated encryption.
Before the final heaviest topics
- Explain public-key encryption, RSA, Diffie-Hellman and elliptic curve cryptography.
- Describe digital signatures and the motivation for post-quantum cryptography.
- Explain certificates and transport layer security.
- Identify issues when primitives or cryptosystems are not used as intended.
The mistakes that cost marks
Cipher confused with mode. AES is unbroken; AES in ECB mode still leaks structure. The mode is a separate decision and often the decisive one.
Key length treated as the answer. Longer keys resist brute force, which is rarely the actual weakness in a deployed system.
Encryption assumed to provide integrity. Confidentiality and integrity are different properties. Authenticated encryption exists because encryption alone does not detect tampering.
Missing a test. Three tests carry 75% and there are no make-up tests. This is a course where attendance is a grading mechanism, not just good practice.
Teaching team
Who teaches MH5301
The bios below are factual. We do not rate lecturers; any star ratings are submitted by students who have taken MH5301.
Teaching team as listed in public course information. AskSia does not rate lecturers; star ratings are submitted by students who have taken MH5301.
Formula & concept sheet
The vocabulary and formulas you must own
- Symmetric cryptography
- Encryption where the same key encrypts and decrypts.
- Asymmetric cryptography
- Encryption using a public and private key pair, removing the need for a pre-shared secret.
- Stream cipher
- A cipher encrypting data continuously, typically by combining it with a keystream.
- Block cipher
- A cipher operating on fixed-size blocks; AES is the standard example.
- Mode of operation
- The scheme chaining block cipher operations together; ECB, CBC and GCM differ sharply in what they protect.
- Semantic security
- The property that ciphertext reveals nothing about plaintext, which ECB mode fails to provide.
- Hash function
- A one-way function producing a fixed-size digest, valued for collision resistance.
- Birthday paradox
- The counter-intuitive result that collisions appear far sooner than expected, bounding hash security.
- Message authentication code
- A tag proving a message came from a key holder and was not altered.
- Authenticated encryption
- A construction providing confidentiality and integrity together, rather than either alone.
- Digital signature
- An asymmetric construction proving origin and integrity to anyone holding the public key.
- Post-quantum cryptography
- Schemes designed to remain secure against an adversary with a large quantum computer.
Common acronyms: AES · AU · CBC · ECB · GCM · ILO · MAC · RSA · TLS.
Where it fits
Prerequisites, related courses & why it matters
Prerequisite published by NTU: AO or H1 level Mathematics or equivalent. The course carries 3 Academic Units and 38 contact hours, and is mutually exclusive with HG5012 and HG8012. NTU states it is suitable for students of various disciplines including mathematics, computer science, engineering and electronic engineering.
Your MH5301 study toolkit
Study the course with Sia, not just read about it
Each tool already knows MH5301: your syllabus, your texts, and where the marks are. Grouped by how you study, from first contact to exam week.
FAQ
Frequently asked questions
Is MH5301 hard?
It rates moderately hard. The mathematics is accessible with only A-level or H1 mathematics assumed, and marking is objective. What raises the risk is the absenteeism policy: three tests carry 75% and there are no make-up tests.
What is the assessment breakdown?
Four components at 25% each: Test 1, Test 2, Test 3, and mini quizzes. Each test is 10% multiple choice and 15% short answer. There is no final examination.
What happens if I miss a test?
NTU publishes this specifically. You must attend at least two of the three tests to complete the course, and there are no make-up tests. Missing one with approved leave rescales your total to a base of 100%. A missed test without valid reason scores zero.
What do I need before taking it?
AO or H1 level Mathematics or equivalent. The course is mutually exclusive with HG5012 and HG8012.
Who wrote the course?
The course author published in the OBTL document is Sim Siang Meng, Division of Mathematical Sciences.
Is it only for mathematics students?
No. NTU states the course is suitable for students of various disciplines, including mathematics, computer science, engineering and electronic engineering.
Study MH5301 with Sia
Work through cryptosystem architecture, stream ciphers, block ciphers and the rest of the course with a tutor that knows it and quizzes you on the topics the assessments weight most heavily.
Start studying with Sia
