Skip to main content
B.Sc. DegreeFaculty of Faculty of Computing & Information TechnologyCyber Security

CYS 103: Discrete Mathematics & Logic for Cybersecurity

Rigorous formal mathematical foundations essential for cryptographic protocols, access control matrices, program verification, and security analytics. Covers propositional logic, first-order predicate calculus, truth tables, logical equivalence, proo...

Instructor
Created by PAMCET Learning Team
beginner1 - 2 weeksEnglish

Course Overview

Rigorous formal mathematical foundations essential for cryptographic protocols, access control matrices, program verification, and security analytics. Covers propositional logic, first-order predicate calculus, truth tables, logical equivalence, proo... Curriculum Structure &...

What You'll Learn

  • Construct and verify formal propositional and predicate logic proofs for security specifications.
  • Formulate mathematical relations and lattice structures modeling mandatory access control (MAC) and Bell-LaPadula policies.
  • Compute modular inverses, greatest common divisors, and modular exponentiations fundamental to public-key cryptography.
  • Model network topologies, firewall rule dependency chains, and attack graphs using discrete graph theory.
  • Apply combinatorics to quantify keyspace search complexities and password entropy bounds.

Requirements

  • Foundational academic standing in computing, mathematics, or science.

Degree Programme Curriculum Context

This course is a curriculum unit of the B.Sc. Cyber Security degree framework in Nigeria.

Earn Your Certificate

Showcase your skills with a certificate! Complete the course, submit your project, and earn your certificate. Here's a sample of what you'll receive to show off your accomplishments.

course-certificate
Lecture Board & Syllabus

Course Curriculum

Browse complete theoretical foundations, worked calculations, laboratory protocols, and board assessment questions under each topic.

Launch Course Reader →
8 Chapters
•
16 Lecture
•
12h
Subtopic 1Document LectureOpen Access~29 min read

Lecture 1: Propositional Logic: Truth Values, Logical Operators, and Equivalence Laws

CYS 103 • Chapter 1 • Lecture 1 CCMAS: CCMAS-CYS-103 Propositional Logic: Truth Values, Logical Operators, and Equivalence Laws Module: Propositional Logic, Logical Connectives & Formal Truth Tables • Theoretical Foundations & Formal Models Level: 100L Credits: 3 CU Discipline: Mathematical Foundations Thread: Mathematics & Formal Foundations Study Time: 45 Mins 1. Pedagogical A...

Module 1 • Subtopic 1•24,622 characters of authentic academic content
Subtopic 2Document Lecture

Lecture 2: Normal Forms: Conjunctive Normal Form (CNF) and Disjunctive Normal Form (DNF)

CYS 103 • Chapter 1 • Lecture 2 CCMAS: CCMAS-CYS-103 Normal Forms: Conjunctive Normal Form (CNF) and Disjunctive Normal Form (DNF) Module: Propositional Logic, Logical Connectives & Formal Truth Tables • Worked Technical Scenarios & Lab Protocols Level: 100L Credits: 3 CU Discipline: Mathematical Foundations Thread: Mathematics & Formal Foundations Study Time: 45 Mins 1. Pedagog...

Module 1 • Subtopic 2
Formative Assessment10 Points • 15 Mins

Formative Assessment: Propositional Logic, Logical Connectives & Formal Truth Tables

Assessment Protocol:10 Total Points•70% Passing Threshold•15 Mins Time Limit•Bloom's Taxonomy: Analyze & Evaluate

Formative knowledge check evaluating core concepts, security invariants, and analytical skills for Propositional Logic, Logical Connectives & Formal Truth Tables.

Module 1 • Formative Assessment
Subtopic 1Document Lecture

Lecture 1: Predicate Logic: Universal and Existential Quantifiers in Security Invariants

CYS 103 • Chapter 2 • Lecture 1 CCMAS: CCMAS-CYS-103 Predicate Logic: Universal and Existential Quantifiers in Security Invariants Module: Predicate Calculus, Quantifiers & Rigorous Proof Techniques • Theoretical Foundations & Formal Models Level: 100L Credits: 3 CU Discipline: Mathematical Foundations Thread: Mathematics & Formal Foundations Study Time: 45 Mins 1. Pedagogical A...

Module 2 • Subtopic 1
Subtopic 2Document Lecture

Lecture 2: Proof Methodologies: Direct Proof, Proof by Contradiction, and Mathematical Induction

CYS 103 • Chapter 2 • Lecture 2 CCMAS: CCMAS-CYS-103 Proof Methodologies: Direct Proof, Proof by Contradiction, and Mathematical Induction Module: Predicate Calculus, Quantifiers & Rigorous Proof Techniques • Worked Technical Scenarios & Lab Protocols Level: 100L Credits: 3 CU Discipline: Mathematical Foundations Thread: Mathematics & Formal Foundations Study Time: 45 Mins 1. Pe...

Module 2 • Subtopic 2
Formative Assessment10 Points • 15 Mins

Formative Assessment: Predicate Calculus, Quantifiers & Rigorous Proof Techniques

Assessment Protocol:10 Total Points•70% Passing Threshold•15 Mins Time Limit•Bloom's Taxonomy: Analyze & Evaluate

Formative knowledge check evaluating core concepts, security invariants, and analytical skills for Predicate Calculus, Quantifiers & Rigorous Proof Techniques.

Module 2 • Formative Assessment
Subtopic 1Document Lecture

Lecture 1: Sets, Subsets, Power Sets, and Cartesian Products in Security Domains

CYS 103 • Chapter 3 • Lecture 1 CCMAS: CCMAS-CYS-103 Sets, Subsets, Power Sets, and Cartesian Products in Security Domains Module: Set Theory, Relations, Equivalence Classes & Lattice Structures • Theoretical Foundations & Formal Models Level: 100L Credits: 3 CU Discipline: Mathematical Foundations Thread: Mathematics & Formal Foundations Study Time: 45 Mins 1. Pedagogical Abstr...

Module 3 • Subtopic 1
Subtopic 2Document Lecture

Lecture 2: Binary Relations, Equivalence Relations, and Access Control Matrix Modeling

CYS 103 • Chapter 3 • Lecture 2 CCMAS: CCMAS-CYS-103 Binary Relations, Equivalence Relations, and Access Control Matrix Modeling Module: Set Theory, Relations, Equivalence Classes & Lattice Structures • Worked Technical Scenarios & Lab Protocols Level: 100L Credits: 3 CU Discipline: Mathematical Foundations Thread: Mathematics & Formal Foundations Study Time: 45 Mins 1. Pedagogi...

Module 3 • Subtopic 2
Formative Assessment10 Points • 15 Mins

Formative Assessment: Set Theory, Relations, Equivalence Classes & Lattice Structures

Assessment Protocol:10 Total Points•70% Passing Threshold•15 Mins Time Limit•Bloom's Taxonomy: Analyze & Evaluate

Formative knowledge check evaluating core concepts, security invariants, and analytical skills for Set Theory, Relations, Equivalence Classes & Lattice Structures.

Module 3 • Formative Assessment
Subtopic 1Document Lecture

Lecture 1: Boolean Functions, Canonical Forms, and Karnaugh Map Minimization

CYS 103 • Chapter 4 • Lecture 1 CCMAS: CCMAS-CYS-103 Boolean Functions, Canonical Forms, and Karnaugh Map Minimization Module: Boolean Algebra, Logic Gates & Function Minimization • Theoretical Foundations & Formal Models Level: 100L Credits: 3 CU Discipline: Mathematical Foundations Thread: Mathematics & Formal Foundations Study Time: 45 Mins 1. Pedagogical Abstract & Learn...

Module 4 • Subtopic 1
Subtopic 2Document Lecture

Lecture 2: Logic Circuit Design: NAND/NOR Completeness and Cryptographic S-Boxes

CYS 103 • Chapter 4 • Lecture 2 CCMAS: CCMAS-CYS-103 Logic Circuit Design: NAND/NOR Completeness and Cryptographic S-Boxes Module: Boolean Algebra, Logic Gates & Function Minimization • Worked Technical Scenarios & Lab Protocols Level: 100L Credits: 3 CU Discipline: Mathematical Foundations Thread: Mathematics & Formal Foundations Study Time: 45 Mins 1. Pedagogical Abstract &amp...

Module 4 • Subtopic 2
Formative Assessment10 Points • 15 Mins

Formative Assessment: Boolean Algebra, Logic Gates & Function Minimization

Assessment Protocol:10 Total Points•70% Passing Threshold•15 Mins Time Limit•Bloom's Taxonomy: Analyze & Evaluate

Formative knowledge check evaluating core concepts, security invariants, and analytical skills for Boolean Algebra, Logic Gates & Function Minimization.

Module 4 • Formative Assessment
Subtopic 1Document Lecture

Lecture 1: Prime Factorization, Fundamental Theorem of Arithmetic, and Sieve of Eratosthenes

CYS 103 • Chapter 5 • Lecture 1 CCMAS: CCMAS-CYS-103 Prime Factorization, Fundamental Theorem of Arithmetic, and Sieve of Eratosthenes Module: Number Theory: Divisibility, Prime Numbers & The Euclidean Algorithm • Theoretical Foundations & Formal Models Level: 100L Credits: 3 CU Discipline: Mathematical Foundations Thread: Mathematics & Formal Foundations Study Time: 45 Mins 1....

Module 5 • Subtopic 1
Subtopic 2Document Lecture

Lecture 2: Euclidean and Extended Euclidean Algorithm for Greatest Common Divisor

CYS 103 • Chapter 5 • Lecture 2 CCMAS: CCMAS-CYS-103 Euclidean and Extended Euclidean Algorithm for Greatest Common Divisor Module: Number Theory: Divisibility, Prime Numbers & The Euclidean Algorithm • Worked Technical Scenarios & Lab Protocols Level: 100L Credits: 3 CU Discipline: Mathematical Foundations Thread: Mathematics & Formal Foundations Study Time: 45 Mins 1. Pedagogi...

Module 5 • Subtopic 2
Formative Assessment10 Points • 15 Mins

Formative Assessment: Number Theory: Divisibility, Prime Numbers & The Euclidean Algorithm

Assessment Protocol:10 Total Points•70% Passing Threshold•15 Mins Time Limit•Bloom's Taxonomy: Analyze & Evaluate

Formative knowledge check evaluating core concepts, security invariants, and analytical skills for Number Theory: Divisibility, Prime Numbers & The Euclidean Algorithm.

Module 5 • Formative Assessment
Subtopic 1Document Lecture

Lecture 1: Modular Congruence Arithmetic: Properties, Rings of Residue Classes Z/nZ

CYS 103 • Chapter 6 • Lecture 1 CCMAS: CCMAS-CYS-103 Modular Congruence Arithmetic: Properties, Rings of Residue Classes Z/nZ Module: Modular Arithmetic, Congruences & Modular Inverses • Theoretical Foundations & Formal Models Level: 100L Credits: 3 CU Discipline: Mathematical Foundations Thread: Mathematics & Formal Foundations Study Time: 45 Mins 1. Pedagogical Abstract &...

Module 6 • Subtopic 1
Subtopic 2Document Lecture

Lecture 2: Modular Inverses and Fermat's Little Theorem in Asymmetric Cryptography

CYS 103 • Chapter 6 • Lecture 2 CCMAS: CCMAS-CYS-103 Modular Inverses and Fermat's Little Theorem in Asymmetric Cryptography Module: Modular Arithmetic, Congruences & Modular Inverses • Worked Technical Scenarios & Lab Protocols Level: 100L Credits: 3 CU Discipline: Mathematical Foundations Thread: Mathematics & Formal Foundations Study Time: 45 Mins 1. Pedagogical Abstract &amp...

Module 6 • Subtopic 2
Formative Assessment10 Points • 15 Mins

Formative Assessment: Modular Arithmetic, Congruences & Modular Inverses

Assessment Protocol:10 Total Points•70% Passing Threshold•15 Mins Time Limit•Bloom's Taxonomy: Analyze & Evaluate

Formative knowledge check evaluating core concepts, security invariants, and analytical skills for Modular Arithmetic, Congruences & Modular Inverses.

Module 6 • Formative Assessment
Subtopic 1Document Lecture

Lecture 1: Counting Principles, Permutations, Combinations, and Pigeonhole Principle

CYS 103 • Chapter 7 • Lecture 1 CCMAS: CCMAS-CYS-103 Counting Principles, Permutations, Combinations, and Pigeonhole Principle Module: Combinatorics, Permutations & Password Entropy Calculation • Theoretical Foundations & Formal Models Level: 100L Credits: 3 CU Discipline: Mathematical Foundations Thread: Mathematics & Formal Foundations Study Time: 45 Mins 1. Pedagogical Abstra...

Module 7 • Subtopic 1
Subtopic 2Document Lecture

Lecture 2: Entropy Modeling: Claude Shannon's Information Entropy and Keyspace Sizing

CYS 103 • Chapter 7 • Lecture 2 CCMAS: CCMAS-CYS-103 Entropy Modeling: Claude Shannon's Information Entropy and Keyspace Sizing Module: Combinatorics, Permutations & Password Entropy Calculation • Worked Technical Scenarios & Lab Protocols Level: 100L Credits: 3 CU Discipline: Mathematical Foundations Thread: Mathematics & Formal Foundations Study Time: 45 Mins 1. Pedagogical Ab...

Module 7 • Subtopic 2
Formative Assessment10 Points • 15 Mins

Formative Assessment: Combinatorics, Permutations & Password Entropy Calculation

Assessment Protocol:10 Total Points•70% Passing Threshold•15 Mins Time Limit•Bloom's Taxonomy: Analyze & Evaluate

Formative knowledge check evaluating core concepts, security invariants, and analytical skills for Combinatorics, Permutations & Password Entropy Calculation.

Module 7 • Formative Assessment
Subtopic 1Document Lecture

Lecture 1: Graph Theory Basics: Vertices, Edges, Adjacency Matrices, and Shortest Path Algorithms

CYS 103 • Chapter 8 • Lecture 1 CCMAS: CCMAS-CYS-103 Graph Theory Basics: Vertices, Edges, Adjacency Matrices, and Shortest Path Algorithms Module: Graph Theory, Trees, Attack Graphs & Finite State Machines • Theoretical Foundations & Formal Models Level: 100L Credits: 3 CU Discipline: Mathematical Foundations Thread: Mathematics & Formal Foundations Study Time: 45 Mins 1. Pedag...

Module 8 • Subtopic 1
Subtopic 2Document Lecture

Lecture 2: Directed Acyclic Graphs (DAGs) in Threat Modeling, Attack Trees, and Automata

CYS 103 • Chapter 8 • Lecture 2 CCMAS: CCMAS-CYS-103 Directed Acyclic Graphs (DAGs) in Threat Modeling, Attack Trees, and Automata Module: Graph Theory, Trees, Attack Graphs & Finite State Machines • Worked Technical Scenarios & Lab Protocols Level: 100L Credits: 3 CU Discipline: Mathematical Foundations Thread: Mathematics & Formal Foundations Study Time: 45 Mins 1. Pedagogical...

Module 8 • Subtopic 2
Formative Assessment10 Points • 15 Mins

Formative Assessment: Graph Theory, Trees, Attack Graphs & Finite State Machines

Assessment Protocol:10 Total Points•70% Passing Threshold•15 Mins Time Limit•Bloom's Taxonomy: Analyze & Evaluate

Formative knowledge check evaluating core concepts, security invariants, and analytical skills for Graph Theory, Trees, Attack Graphs & Finite State Machines.

Module 8 • Formative Assessment

Instructor

PAMCET Learning Team

PAMCET Learning Team

Institutional Course Curation · PAMCET

The PAMCET Learning Team is the institutional curriculum and content group behind course publishing on this platform. PAMCET (Professional and Academic Management Centre for Education and Training) is operated by Digitpen Hub Ltd, a company registered in Lagos, Nigeria. Courses credited to the PAMCET Learning Team are structured, organized, and published centrally by the platform rather than authored by a single named individual instructor — each course's syllabus, learning outcomes, and content are reviewed before publication under this institutional account. For questions about a specific course or to report a content issue, please use the platform's Help & Support or Contact Us pages.

Qualifications:

PAMCET Learning Team — Institutional Course Curation, Digitpen Hub Ltd

My Skills:

  • Curriculum Curation
  • Course Content Review
  • Learning Outcome Design
  • Course Publishing & Quality Assurance
  • Platform Content Operations

Reviews

No reviews available
CYS 103: Discrete Mathematics & Logic for Cybersecurity
Free$24.99100% Off
Certificate available separately for $7 after completion

Course Includes

8 Chapters
16 Lectures
1 - 2 weeks
Skill Level beginner
Taught in English
Lifetime Access
Certification of Completion
Category: University - Cyber Security
Share On

Download Syllabus & Study Guide

Receive the full lecture syllabus, reading list, and milestone schedule for CYS 103: Discrete Mathematics & Logic for Cybersecurity.

By submitting, you agree to receive educational updates. You can unsubscribe anytime. Read our Privacy Policy.