2026/27 · Official catalogue edition
The effective term printed in this PDF is Semester A 2026/27。
Offering record for 2026/27：Semester A 2026/27 · Catalogue source ↗
The offering term is subject to change without prior notice.
What you will study
- Course overview
- This course introduces the mathematical foundations of information engineering and cryptography. Topics include sets, functions, relations, number theory, group theory, and linear algebra, together with their applications to cryptographic systems and error-correcting codes. Students will develop analytical and problem-solving skills through the application of mathematical methods to information engineering problems.
Official PDF, page 2 · Abstract
- Course content
- Discrete Mathematical Foundations Basic properties of sets; functions, injective, surjective, and bijective functions; inverse functions and composition of functions; relation on sets; equivalence relations, equivalence classes, and congruence modulo n; countable and uncountable sets (optional); examples from information engineering and cryptography. Number Theory and Cryptography Prime numbers, divisibility, unique factorization, greatest common divisor, Euclidean algorithm, modular arithmetic, Chinese Remainder Theorem, applications to cryptography, RSA cryptosystem, and the use of mathematics software systems (e.g. SageMath). Group Theory and Cryptography Definition of groups, subgroups, cyclic groups, generators, and Diffie-Hellman key exchange. Linear Algebra and Information Engineering Vector spaces, linear mapping, linear error-correcting codes, minimum distance, encoding and decoding methods. Selected Topics (optional) Advanced topics in information engineering and cryptography, such as Reed-Solomon codes, post-quantum cryptography, or related contemporary developments.
Official PDF, page 4 · Keyword Syllabus
- Intended learning outcomes
View official learning outcomes and conditions
CILOs Weighting (if DEC-A1 DEC-A2 DEC-A3 app.) 1 Explain the concepts of sets, relations, and x x functions. 2 Apply number-theoretic techniques to x x cryptographic systems. 3 Apply linear algebra concepts to error- x x correcting codes. 4 Solve information engineering and x x cryptographic problems using appropriate mathematical methods. A1: Attitude Develop an attitude of discovery/innovation/creativity, as demonstrated by students possessing a strong sense of curiosity, asking questions actively, challenging assumptions or engaging in inquiry together with teachers. A2: Ability Develop the ability/skill needed to discover/innovate/create, as demonstrated by students possessing critical thinking skills to assess ideas, acquiring research skills, synthesizing knowledge across disciplines or applying academic knowledge to real-life problems. A3: Accomplishments Demonstrate accomplishment of discovery/innovation/creativity through producing /constructing creative works/new artefacts, effective solutions to real-life problems or new processes.Official PDF, page 2 · Course Intended Learning Outcomes (CILOs)
Before you take this course
Check prerequisites, precursors and corequisites separately, together with equivalence and exclusion conditions. “and” means conditions must be met together; “or” marks alternatives. Read combined conditions in the groupings shown in the original text below.
- Prerequisites
- Nil
Official PDF, page 1 · Prerequisites
- Precursors
- EE1001 Foundations of Digital Techniques and EE1004 Foundations of Information Systems and Data Analysis and (MA1201 Calculus and Basic Linear Algebra II or MA1301 Enhanced Calculus and Linear Algebra II)
Official PDF, page 1 · Precursors
- Corequisites
- This edition of the official syllabus does not state this item.
- Additional course requirements
- Complete official information for this field is not available.
- Equivalent courses and conditions
- Nil
Official PDF, page 1 · Equivalent Courses
- Exclusive courses and conditions
- Nil
Official PDF, page 1 · Exclusive Courses
Assessment and passing the course
- Assessment
- Continuous assessment: 30%; Examination: 70%; Examination duration: 2 hours
Assessment breakdown
Assessment task Weight Generative AI Remarks and restrictions Tests 20% Not stated in source Not stated in source row Assignments 10% Not stated in source Not stated in source row View the original assessment table and instructions
Assessment Tasks / Activities (ATs) ATs CILO No. Weighting (%) Remarks Allow Use of GenAI? 1 Tests (min.: 2) 1, 2, 3, 4 20 - No 2 #Assignments 1, 2, 3, 4 10 - Yes (min.: 3) Continuous Assessment (%) 30 Examination (%) 70 Examination Duration (Hours) 2 Minimum Continuous Assessment Passing Requirement (%) 30 Minimum Examination Passing Requirement (%) 30 Additional Information for ATs Remark: To pass the course, student are required to achieve at least 30% in the coursework and 30% of the examination. # may include homework, tutorial exercise, project/mini-project, presentation - Passing requirements
- To pass the course, student are required to achieve at least 30% in the coursework and 30% of the examination.
Official PDF, page 3 · Additional Information for ATs
Credits, duration and edition details
- Title in this edition
- Foundations of Information Engineering and Cryptography
- Credits in this edition
- 3
- Course duration
- One Semester
- Syllabus effective term
- Semester A 2026/27
- Levels printed in the syllabus
- B1, B2, B3, B4 - Bachelor's Degree
Check the official document
Read or download this edition through the university link below. EE2302 · Open the original university PDF ↗
Source · University course information ↗ · Checked 2026-10-19T06:31:38Z