Scribd
Upload
81 views17 pages

Basics in Number Theory

The document discusses the topics covered in the CSE 4003 CYBER SECURITY course. The 7 modules cover: 1) introduction to number theory including finite fields, modular arithmetic, and cryptographic techniques; 2) symmetric and asymmetric key cryptographic techniques; 3) integrity, authentication techniques like hash functions and digital signatures; 4) cybercrimes and offenses; 5) cyber threats, attacks and prevention; 6) cybersecurity policies and practices; and 7) recent trends.

Uploaded by

lilac
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
81 views17 pages

Basics in Number Theory

The document discusses the topics covered in the CSE 4003 CYBER SECURITY course. The 7 modules cover: 1) introduction to number theory including finite fields, modular arithmetic, and cryptographic techniques; 2) symmetric and asymmetric key cryptographic techniques; 3) integrity, authentication techniques like hash functions and digital signatures; 4) cybercrimes and offenses; 5) cyber threats, attacks and prevention; 6) cybersecurity policies and practices; and 7) recent trends.

Uploaded by

lilac
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 17

CSE 4003 CYBER SECURITY

Module:1 Introduction to Number Theory


Finite Fields and Number Theory: Modular arithmetic, Euclidian Algorithm, Primality Testing: Fermats and
Eulers theorem, Chinese Reminder theorem, Discrete Logarithms
Module:2 Cryptographic Techniques
Symmetric key cryptographic techniques: Introduction to Stream cipher, Block cipher: DES, AES,IDEA
Asymmetric key cryptographic techniques: principles,RSA,ElGamal,Elliptic Curve cryptography, Key distribution
and Key exchange protocols.
Module:3 Integrity and Authentication
Hash functions,Secure Hash Algorithm (SHA)Message Authentication, Message Authentication Code (MAC),
Digital Signature Algorithm : RSA ElGamal based
Module:4 Cybercrimes and cyber offenses
Classification of cybercrimes, planning of attacks, social engineering:Human based, Computer based:
Cyberstalking, Cybercafe and Cybercrimes
Module:5 Cyber Threats, Attacks and Prevention
Phishing, Password cracking, Keyloggers and Spywares, DoS and DDoS attacks, SQL Injection Identity Theft (ID) :
Types of identity theft, Techniques of ID theft
Module:6 Cybersecurity Policies and Practices
What security policies are: determining the policy needs, writing security policies, Internet and email security
policies, Compliance and Enforcement of policies, Review
Module:7 Recent Trends
Basics in Number Theory
• Whole Number
• Natural Number
• Factor
• Prime Number
• Composite Number
• Greatest Common Divisor
• Co Prime
Whole Number
• A number without a decimal part and it has no
negatives.
• All Non Negative Integers
• 0,1,2,3,4,5,6,7………
What is a Natural Number
• Natural Number is an integer greater than 0
• It is a member of the set {1,2,3,4….}
• Natural Numbers are also known as counting
numbers.
Factor
• A factor is a number that divides another
number evenly with no reminder
• Factors are numbers you multiply to get other
numbers
Prime Numbers
• They have no other factors except for 1 and
the number itself
• A number that can only be factored as 1 times
itself is called "prime".
• 1 is not a prime number. It doesn’t have two
distinct factors.
• 2, 3, 5, 7, 11, 13, 17, 19, 23 ,29. ...
Composite Number
• Numbers that have more than 2 factors are
called as Composite numbers
• Positive Integers that have more than 2 factors
• Numbers that are divisible by more than two
numbers.
• 4, 6, 8, 9, 10, 12, 14, 15, 16, ...
Greatest Common Divisor
• GCD of two or more integers which are not
zero is the greatest positive integer that
divides each of the integers.
• GCD of two numbers is the greatest number
that divides both the numbers.
• GCD of 12 and 8 is 4
How to find GCD?
GCD by Division Method
• First take two of the given numbers , divide
the greater by the smaller number and then
divide the divisor by the reminder.
• The divisor which does not leave a reminder is
the GCD of the two numbers.
GCD by Division Method - Exercise
• Find the GCD of 30 and 45
• Find the GCD of 442 and 546
• Find the GCD of 442,546,424
Co Prime Number
• Set of numbers that have GCD as 1 are called as Co-Prime
Numbers
• For instance 7 and 8 are co-prime numbers

Properties of Co Prime Numbers


• 1 is coprime with every other number
• Prime numbers are co-prime to each other
• Any two successive numbers are always co-prime
• The sum of any two co-prime numbers is always co-prime with
their product
Identify the co-prime numbers
• 24, 36
• 20, 21
• 542, 446
Modular Arithmetic
Division Algorithm
Given any positive integer n and any
nonnegative integer a, if we divide a by n, we
get an integer quotient q and an integer
remainder r that obey the following relationship
a=qn+r 0<=r<n q=a/n
Example: 5&3
Divisor
• We say that a nonzero b divides a if a = mb for
some m, where a, b, and m are integers.
• That is, b divides a if there is no remainder on
division.
• The notation is commonly used to mean b
divides a. Also, if b|a, we say that b is a divisor
of a.
Properties of Divisor
• The following relations hold:
• If a|1, then a = ±1.
• Any b ≠ 0 divides 0.
• If b|g and b|h, then b|(mg + nh) for arbitrary
integers m and n.

You might also like