COMP5563 Applied Cryptography for Financial Applications
COMP5563 Overview
- The Hong Kong Polytechnic University
- Semester 1, 2026/27
- Postgraduate course
- Computer Science
- Closed-book final examination
What the course asks you to do
Applied Cryptography for Financial Applications connects formal security definitions to the design choices that protect payment, banking and settlement messages. The captured objectives ask students to explain cryptographic protocols, use them in financial contexts and analyse their security.
- Assessed by Two assignments worth fifteen percent each, a twenty-percent quiz and a fifty-percent closed-book final examination.
- Core method Define the real and ideal worlds, give an efficient adversary, and calculate the probability gap.
- Operational focus Track key reuse, nonce uniqueness, IV unpredictability, message encoding, traffic limits and tag length.
What you get in the full COMP5563 Exam Bible
- 5 chapters, 33 pages — every examinable topic
- 12 original practice questions, each with a model answer in the Final examination format
- 5 worked examples, solved the way COMP5563 marks
- 11 computed figures, redrawn from the course’s own numbers
- Exam-morning plan for the Final examination (50%) — what to revise last, where marks are lost
Free on this page: assessment table, chapter map, one worked example, key terms, FAQ. The rest is in the full exam bible.
How COMP5563 is assessed
| Component | Weight | Format |
|---|---|---|
| Assignment 1 | 15% | Coursework; teamwork allowed |
| Assignment 2 | 15% | Coursework; teamwork allowed |
| Quiz | 20% | No discussion during the quiz |
| Final examination | 50% | Closed book |
The introductory lecture slides publish coursework at 30%, made up of two assignments at 15% each, plus a 20% quiz and a 50% closed-book final examination. Confirm live submission settings on Canvas.
Assessment structure
Segment widths reproduce the published percentage weights and total 100%.
What other students are asking about COMP5563
- Where can I find lecture notes or study guides for COMP5563 at PolyU?
- The COMP5563 study guide in AskSia Library covers Applied Cryptography for Financial Applications in 5 chapters, with the assessment table, a chapter-by-chapter topic map, key terms and a worked example, free to read on this page.
- Is there a final exam in COMP5563, and how much is it worth?
- Yes. In the offering this AskSia Library guide is built from, Final examination carries 50% of the COMP5563 mark; the full split is Assignment 1 15%, Assignment 2 15%, Quiz 20%, Final examination 50%.
- What does COMP5563 cover on stream ciphers and semantic security?
- In AskSia Library's COMP5563 guide, the Stream Ciphers and Semantic Security chapter explains pseudorandom generators · next-bit unpredictability · two-time pads · malleability · left-or-right security experiments.
- What does COMP5563 cover on block cipher design, des and aes?
- In AskSia Library's COMP5563 guide, the Block Cipher Design, DES and AES chapter explains pRFs and PRPs · Feistel networks · DES evidence · meet-in-the-middle · AES · constructions from generators.
- What does COMP5563 cover on secure encryption modes for financial data?
- In AskSia Library's COMP5563 guide, the Secure Encryption Modes for Financial Data chapter explains eCB leakage · CPA security · random IVs and unique nonces · CBC and CTR · deterministic and format-preserving encryption.
Current COMP5563 dates
| Date | Item | Control |
|---|---|---|
| 27 September 2026 | Assignment 1 | The Canvas assignment page lists the due date and a single PDF submission. |
The captured Assignment 1 page supplies the date; confirm the current time and submission settings in Canvas.
What COMP5563 covers
Five chapters follow the captured lecture sequence from perfect secrecy and stream ciphers through block-cipher design and secure modes to message authentication.
Cryptographic Foundations and the One-Time Pad
security goals and attacker models · historical leakage · XOR correctness · perfect secrecy · key reuse and length leakageStart with the property
Cryptography protects several different properties. Confidentiality asks who can read a message, integrity asks who can alter it, and authentication asks who created it.
- Security goals and attacker models
- Historical substitution and transposition leakage
- XOR correctness
- Perfect secrecy as unchanged probability
- Uniform independent single-use keys
- Key reuse and length leakage
Stream Ciphers and Semantic Security
pseudorandom generators · next-bit unpredictability · two-time pads · malleability · left-or-right security experimentsExpand a short secret
A pseudorandom generator deterministically expands a uniform short seed into a longer string that efficient tests cannot distinguish from uniform.
- Pseudorandom generator definition
- Efficient distinguishers and advantage
- Next-bit unpredictability
- Two-time pads and nonce reuse
- Ciphertext malleability
- Semantic security and hybrid reductions
Block Cipher Design, DES and AES
PRFs and PRPs · Feistel networks · DES evidence · meet-in-the-middle · AES · constructions from generatorsMatch evidence to claims
A block cipher is a keyed permutation on a fixed block space. PRP security compares it with a random permutation, while PRF security compares a function with a random function.
- PRF and PRP experiments
- Feistel round inversion
- DES rounds and S-box evidence
- Exhaustive and meet-in-the-middle search
- Linear, implementation and quantum attacks
- AES and GGM construction
Secure Encryption Modes for Financial Data
ECB leakage · CPA security · random IVs and unique nonces · CBC and CTR · deterministic and format-preserving encryptionOne primitive, different operating rules
ECB applies a block cipher independently and leaks repeated-block patterns. CBC chains blocks from an IV, while CTR encrypts nonce-counter inputs and XORs the resulting pad with plaintext.
- ECB equality leakage
- Chosen-plaintext security
- Randomized and nonce-based encryption
- CBC IV requirements and traffic bound
- CTR nonce-counter uniqueness
- Deterministic and format-preserving leakage
Message Authentication and Integrity
MAC experiments · PRF-MAC · tag truncation · CBC-MAC extension · padding · PMAC and Carter-WegmanGenerate, verify, reject
A message authentication code uses a shared key to tag a precisely encoded message and to verify a received pair.
- MAC syntax and correctness
- Chosen-message unforgeability
- PRF-MAC and tag guessing
- Variable-length domain extension
- CBC-MAC forgery and finalisation
- PMAC and Carter-Wegman approaches
That last verb controls the guide: knowing that CBC and CTR are modes is not enough. A strong answer states what an attacker may query, identifies the relation a construction exposes, and quantifies success in the real and ideal experiments.
Foundations and the one-time pad
The opening chapter separates confidentiality, integrity and authentication before treating the one-time pad as a benchmark.
It proves correctness through XOR and perfect secrecy through equal compatible key mass. The operational conditions are strict: uniform independent keys, key material at least as long as the message, single use and a separate treatment of message length.
Stream ciphers and semantic security
A pseudorandom generator replaces the impractically long random pad with output derived from a short seed.
Security becomes computational: every efficient distinguisher must have negligible advantage. The chapter turns next-bit prediction into a distinguishing test, analyses two-time pads and controlled bit flips, and builds the left-or-right experiment used for semantic security.
Block cipher evidence
Block ciphers are keyed permutations, while pseudorandom functions need not be invertible.
The chapter traces a Feistel round, explains what DES key and block lengths do and do not prove, compares exhaustive search with meet-in-the-middle, and treats AES as a concrete substitution-permutation design. It keeps abstract oracle security separate from implementation attacks.
Encryption modes for records
ECB leaks equality because it encrypts blocks deterministically.
CBC and CTR hide repetition only when their initial-value rules are followed. CBC needs an unpredictable IV in the standard randomized design and carries a traffic-dependent collision term. CTR needs unique nonce-counter inputs.
Deterministic and format-preserving encryption retain structure for application compatibility and therefore require explicit leakage analysis.
Message integrity
A MAC authenticates an exact encoded domain under a shared key. PRF-MAC explains the basic reduction, tag truncation prices blind guessing, and CBC-MAC variants show why finalisation, position and length matter for long messages.
The guide ends by tracing verification before business processing and by treating replay protection as separate from unforgeability.
How to use the practice
Every worked example and practice prompt is independently authored. Work from the definition to the algebra before reading the model answer. The captured Assignment 1 provides useful problem categories but no official solution set or meaningful rubric.
Any displayed points are an AskSia study allocation, not a University marking scheme.
Worked example · free
Diagnose a repeated stream-cipher nonce
- 2Write both ciphertext equations and XOR them.
- 2Cancel the repeated keystream.
- 2Use a known first plaintext to recover the second.
Key terms
- Perfect Secrecy
- A guarantee that observing ciphertext does not change the probability assigned to any candidate plaintext.
- One-Time Pad
- XOR encryption using a uniform independent key as long as the message and never reused.
- Pseudorandom Generator
- A deterministic algorithm expanding a short random seed into a longer string indistinguishable from uniform by efficient tests.
- Distinguishing Advantage
- The absolute gap between an adversary's output probabilities in two experiments.
- Semantic Security
- Confidentiality expressed through an efficient adversary's inability to distinguish encryptions of chosen equal-length messages.
- Pseudorandom Function
- A keyed function family computationally indistinguishable from a uniformly chosen random function.
- Pseudorandom Permutation
- An invertible keyed family computationally indistinguishable from a uniformly chosen permutation.
- Feistel Network
- A block-cipher structure that alternates half-block transformation, XOR and swapping to obtain invertibility.
- Initialization Vector
- An initial value used by a mode such as CBC, with a freshness condition determined by the security theorem.
- Nonce
- A value that must not repeat under a key in nonce-based encryption, but need not usually be secret.
- Chosen-Plaintext Attack
- An attack model in which the adversary can obtain encryptions of selected messages.
- Message Authentication Code
- A shared-key generate-and-verify mechanism protecting message integrity and authenticity.
- Tag Truncation
- Sending only part of a full authentication tag, trading bandwidth for a larger guessing probability.
- Extension Forgery
- A forgery that turns a valid tag or chaining state into authentication of a longer new message.
- Format-Preserving Encryption
- Encryption mapping values within a restricted format while necessarily retaining some structural information.
COMP5563 FAQ
How is the course assessed?
The captured introductory slides publish two assignments worth fifteen percent each, a quiz worth twenty percent and a closed-book final examination worth fifty percent. Together the rows total one hundred percent. The live Canvas pages control submission times and any later change.
Why does the guide stop after message integrity?
The captured teaching assets contain five lecture slide sets, ending with Message Integrity 1. The schedule names later topics including key exchange and public-key cryptography, but their lecture materials were not captured. The guide stays narrow instead of inventing those chapters.
Is the one-time pad practical for financial traffic?
It supplies a clean perfect-secrecy benchmark, but requires uniform secret key material as long as every message, secure distribution, exact synchronisation and single use. Modern systems normally replace that storage burden with computationally secure primitives and strict nonce or IV management.
What is the difference between a nonce and an IV?
Both initialise a construction, but the required property comes from the mode. CTR commonly needs a nonce-counter input that is unique under the key. Standard randomized CBC needs a fresh unpredictable IV. Calling both random can hide the actual operational rule.
Does encryption prevent transaction tampering?
Not by itself. Stream encryption and CTR are malleable, and CBC also permits structured modification. A receiver needs authenticated encryption or a proven encryption and MAC composition that covers every business-relevant field and rejects altered data before processing it.
Are the practice points official marks?
No. The captured Assignment 1 states a total of fifty points but provides no official solutions or meaningful rubric. Every problem and model answer in this guide is independently authored, and displayed points are only AskSia study allocations for checking completeness.
What should I memorise for the closed-book final?
Memorise the skeleton of the security games, the conditions on keys, nonces and IVs, and the short algebra behind standard attacks. Practise moving from a violated condition to an efficient strategy and then to a quantified advantage or success probability.
Questions students ask in each COMP5563 chapter
- Why is a huge key space not automatically secure?
- An attacker may use language frequency, structural invariants or other evidence to discard most keys without searching them uniformly. Key-space size measures generic exhaustive search only when no shortcut exploits the construction or the message distribution. Chapter 01 · Cryptographic Foundations and the One-Time Pad
- How can deterministic output be pseudorandom?
- Pseudorandomness compares what an efficient observer can detect, not whether the generation process used fresh randomness for every output bit. The seed is random, and determinism lets both parties reproduce the same keystream. Chapter 02 · Stream Ciphers and Semantic Security
- What is the practical difference between a PRF and PRP?
- A PRP is invertible for every key and maps a block space onto itself, which supports decryption. A PRF need not be invertible. Their oracle games also differ because a random function may collide while a permutation cannot. Chapter 03 · Block Cipher Design, DES and AES
- Why is ECB insecure if the block cipher is strong?
- The primitive can resist inversion while deterministic block-by-block use still preserves equality. An adversary chooses messages with different repetition patterns and reads which pattern the challenge ciphertext contains, without recovering any plaintext block. Chapter 04 · Secure Encryption Modes for Financial Data
- Does a MAC prove who sent a message to a third party?
- Not generally. Every holder of the shared key can generate valid tags, so a recipient cannot use the tag to prove which key holder created it. The MAC supplies shared-key integrity and authentication within the protocol. Chapter 05 · Message Authentication and Integrity
How to study for the exam
Use a three-column revision sheet for every construction. In the first column, write the real and ideal experiments or the correctness equation. In the second, list the operating conditions: key length, nonce uniqueness, IV unpredictability, allowed message lengths, traffic bound and authenticated fields. In the third, write the shortest known attack when one condition fails.
Rebuild the sheet from memory rather than rereading it. For each lecture, complete one definition question, one trace or calculation and one attack explanation. On the next day, compress the answer to five lines: claim, adversary access, chosen input, observable relation and conclusion. Work the original guide practices before reading their answers.
Because the final examination is closed book, aim to reconstruct definitions rather than memorise paragraphs. Keep confidentiality, integrity and replay protection on separate lines. When a proof uses a reduction, name the primitive challenger, show how the simulator answers the construction adversary and identify any bad-event term.
Finally, use financial record examples only after the abstract security claim is correct; the context should test whether all fields and state rules are covered, not replace the theorem.
Your AI Computer Science tutor for COMP5563
Stuck on a hard COMP5563 question? Sia is AskSia’s AI Computer Science tutor — ask any COMP5563 Applied Cryptography for Financial Applications question and get a clear, step-by-step explanation grounded in how the course is actually taught and assessed. Read this whole study guide free, then take your hardest questions to Sia.