# KTU Foundations Of Security In Computing Notes CSL 332

KTU  Foundations Of Security In Computing CSL 332 is an S6 CSE Elective FSC 2019 scheme course. The goal of this course is to raise awareness of the principles of security and number theory among students. Integer & Modular Arithmetic, Primes & Congruences, Discrete Logarithms & Elliptic Curve Arithmetic, and an overview of computer security are all covered in this course. Learners will be able to apply cryptographic algorithms effectively and identify security dangers in computing as a result of the principles covered in this course.

The following is a typical list of what information security analysts do: They keep an eye on their company's networks for security breaches and examine them when they happen. To protect sensitive information, use and maintain technologies such as firewalls and data encryption systems. Examine your computer and network systems for flaws. The Notes for  Foundations Of Security In Computing are easily available on our website (www.keralanotes.com).

 Board KTU Scheme 2019 New Scheme Year Third Year Semester S6 Subject CSL 332 |   Foundations Of Security In Computing Credit 3 Category KTU S6 Computer Science

## KTU S6   Foundations Of Security In Computing | CSL 332 | Notes (2019 Scheme)

Are you looking for study materials for CSL 322  Foundations Of Security In Computing? This course illustrates the operations and properties of algebraic structures, integer arithmetic, and modular arithmetic, Use the concepts of prime numbers and factorization for ensuring security in computing systems and Illustrate the concepts of Linear Congruence, Primitive Roots, Discrete Logarithms,  and Elliptic Curve Arithmetic, Summarize the threats and attacks related to computer and program security, Outline the key aspects of operating system and database security.

### Module 1 - Syllabus

Modular Arithmetic

Integer arithmetic - Integer division, Divisibility, Greatest Common Divisor (GCD), Euclid's algorithm for GCD, Extended Euclid’s algorithm, Linear Diophantine Equations. Modular arithmetic - Operations, Properties. Algebraic structures - Groups, Rings, Fields, Finite fields, GF(p), GF (2n ).

### Module 2 - Syllabus

Prime Numbers and Factorization

Prime numbers - Prime numbers and prime-power factorization, Fermat and Mersenne primes, Fermat’s theorem, Applications, Euler’s theorem, Euler’s totient function, Applications. Primality testing – Deterministic algorithms and Probabilistic algorithms. Factorization - Fermat’s factorization, Pollard p-1 method.

### Module 3 - Syllabus

Linear Congruence, Primitive Roots, and Elliptic Curve Arithmetic

Linear congruence - Simultaneous linear congruence, Chinese Remainder Theorem (CRT). Congruence with a prime - Power modulus, Arithmetic modulo p, Pseudoprimes, and Carmichael numbers, Solving congruence modulo prime powers. Primitive roots - Existence of primitive roots for primes, Discrete logarithms. Elliptic curve arithmetic – Prime curves, Binary curves, Addition of two points, Multiplication of a point by a constant.

### Module 4 - Syllabus

Computer and Program Security

Introduction to computer security – Threats, Vulnerabilities, Controls. Browser attack types, Web attacks targeting users, and Email attack types. Introduction to programming security - Non-malicious programming oversights, Malware.

### Module 5 - Syllabus

Operating System and Database Security

Operating system security – security in the operating system, Security in the design of the operating system. Database security – Security requirements of databases, Reliability, and integrity, Database disclosure.