# CYCS 1310 – Foundations of Cybersecurity The mathematical and logical foundations behind cybersecurity. Each topic introduces a piece of discrete math, then ties it directly to how real security systems use it — firewall rules, authentication, cryptography, and intrusion detection. ## Topics - [[00 - Propositional Logic|00 · Propositional Logic]] — Propositions, conjunctions, disjunctions, and implications as the language of security rules. Covers policy formalization, malware detection signatures, authentication logic, SIEM alert correlation, and firewall rules with contrapositives. - [[10 - Proof Techniques|10 · Proof Techniques]] — Moving from "probably secure" to "provably secure." Direct proofs for cryptographic algorithms, proof by contradiction for protocol verification, and induction for security properties that hold across all inputs. - [[20 - Set Theory|20 · Set Theory]] — Sets, intersections, unions, and complements applied to access control lists, intrusion detection, cryptographic protocols, and threat intelligence correlation.