notes

Unnamed repository; edit this file 'description' to name the repository.
Log | Files | Refs

commit 0d6b7393784a3a0932493960c9a6287159966c75
parent 1a901984e1af00927f18c7a6c1196d3a90d6eb54
Author: AndrewLockVI <andrew@laack.co>
Date:   Mon, 17 Feb 2025 16:36:20 -0600

Added comp. sec notes

Diffstat:
Mdocs/ChineseRemainderTheorem.md | 2--
Mdocs/ComputerSecurity.md | 32+++++++++++++++++---------------
Mdocs/Symmetric.md | 2--
3 files changed, 17 insertions(+), 19 deletions(-)

diff --git a/docs/ChineseRemainderTheorem.md b/docs/ChineseRemainderTheorem.md @@ -4,6 +4,4 @@ **Chapter:** 2.7 - - **Definition:** The Chinese Remainder Theorem states... diff --git a/docs/ComputerSecurity.md b/docs/ComputerSecurity.md @@ -2,11 +2,9 @@ Main index for notes related to CSCI 370, Computer Security - - ## Chapter 1 - Background -##### 1.1 - Cyber, info, network sec +### 1.1 - Cyber, info, network sec - [Cybersecurity](Cybersecurity.md) - [Information Security](InformationSecurity.md) @@ -17,27 +15,27 @@ Main index for notes related to CSCI 370, Computer Security - [Availability](Availability.md) - [Non Repudation](NonRepudation.md) -##### 1.2 - OSI Security Architecture +### 1.2 - OSI Security Architecture - [OSI](OSI.md) -##### 1.3 - Security Attacks +### 1.3 - Security Attacks - [Passive Attacks](PassiveAttacks.md) - [Active Attacks](ActiveAttacks.md) -##### 1.4 - Security Services (ways to support requirements of CIA triad) +### 1.4 - Security Services (ways to support requirements of CIA triad) - [Authentication](Authentication.md) - [Non Repudation](NonRepudation.md) - [Integrity](Integrity.md) - [Availability](Availability.md) -##### 1.5 - Security Mechanisms +### 1.5 - Security Mechanisms - [Integrity](Integrity.md) -##### 1.6 - Cryptography +### 1.6 - Cryptography - [Cryptography](Cryptography.md) - [Keyless](Keyless.md) @@ -45,37 +43,41 @@ Main index for notes related to CSCI 370, Computer Security - [Two Key](TwoKey.md) - [Digital Signature](DigitalSignature.md) -##### 1.8 - Trust +### 1.8 - Trust - [Trust](Trust.md) ## Chapter 2: Introduction to Number Theory -##### 2.1 - Divisibility and The Division Algorithm +### 2.1 - Divisibility and The Division Algorithm - [Division Rules](DivisionRules.md) - [Division Algorithm](DivisionAlgorithm.md) - [Relatively Prime](RelativelyPrime.md) -##### 2.2 - The Euclidean Algorithm +### 2.2 - The Euclidean Algorithm - [Euclidean Algorithm](EuclideanAlgorithm.md) - [GCD](GCD.md) -##### 2.5 - Fermat's and Euler's Theorems +### 2.5 - Fermat's and Euler's Theorems - [Fermats Theorem](FermatsTheorem.md) - [Eulers Totient Function](EulersTotientFunction.md) - [Eulers Theorem](EulersTheorem.md) -##### 2.6 - Primality Tests +### 2.6 - Primality Tests - [Miller Rabin Algorithm](MillerRabinAlgorithm.md) -##### 2.7 - Chinese Remainder Theorem +### 2.7 - Chinese Remainder Theorem - [Chinese Remainder Theorem](ChineseRemainderTheorem.md) -##### 2.8 - Discrete Logarithms +### 2.8 - Discrete Logarithms - [Primitive Roots](PrimitiveRoots.md) + +### 3.1 - Symmetric Cipher Model + +- [Single Key](SingleKey.md) diff --git a/docs/Symmetric.md b/docs/Symmetric.md @@ -2,8 +2,6 @@ Ch 9.1 - - **Definition:** A symmetric relation is a relation such that if xRy then yRx for all (x,y). For a symmetric relation to imply it is reflexive, the domain and the codomain must be the same.