Scribd
Upload
360 views76 pages

Mod3-Ds Final SST

Module 3 of the BEC613B course covers data security, focusing on prime numbers and their importance in RSA encryption. It includes definitions and examples of prime factorization, the RSA algorithm, and the Diffie-Hellman key exchange algorithm. Students are encouraged to refer to class notes and textbooks for proofs and additional problems.

Uploaded by

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

Mod3-Ds Final SST

Module 3 of the BEC613B course covers data security, focusing on prime numbers and their importance in RSA encryption. It includes definitions and examples of prime factorization, the RSA algorithm, and the Diffie-Hellman key exchange algorithm. Students are encouraged to refer to class notes and textbooks for proofs and additional problems.

Uploaded by

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

Module 3—Data Security

Course Code: BEC613B


Dr.Saleem S Tevaramani
[email protected]
Prime Numbers

🔹 Definition: A prime number has only two factors:


1 and itself.
🔹 Examples: 2, 3, 5, 7, 11, 13, …
🔹 Why Important?
Used in RSA encryption for secure communication.
Prime Factorization
Definition: Prime factorization is breaking a number into a product of prime numbers.

🔹 Example: N = 91 → 7 × 13 (prime factors).

Example N = 143, find prime factors: 11 × 13


If N is small, attackers can factorize it and break encryption.
Proof of theorem : Refer Class
notes/Textbook
Proof of theorem : Refer Class
notes/Textbook
RSA ALGORITHM
Dr.Saleem S Tevaramani
RSA ALGORITHM-Type 1
RSA ALGORITHM-Type 2
RSA ALGORITHM-Type 3
PROBLEM 1
PROBLEM 2
Problem 3
Problem 4
Problem 5
Diffie-Hellman Key Exchange Algorithm
Diffie-Hellman Key Exchange Algorithm
Problem 1
Problem 2
Problem 3
Problem on Primitive Roots
Problem 1 on Primitive Roots
Problem2 on Primitive Roots of n=13
Discrete Logarithm
Public Key cryptography
Diffie Hellman- ECC algorithm:
Public Key Encryption using ECC
Note 1: Refer to class notes/textbook and VTU QP.
Note 2: Do not refer to the PPT if there are any confusions in it.
Note 3: Solve more problems (only few problems are listed here.)

THANK YOU

You might also like