Scribd
Upload
3 views25 pages

Number Theory in Cryptography

This document outlines the first module of a course on Cryptography and Network Security, focusing on number theory. Key topics include modular arithmetic, the Euclidean Algorithm, Fermat's theorem, Euler's totient function, and the Chinese Remainder theorem. Additionally, it covers concepts such as discrete logarithms and primality testing.

Uploaded by

lalithaditya1899
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
3 views25 pages

Number Theory in Cryptography

This document outlines the first module of a course on Cryptography and Network Security, focusing on number theory. Key topics include modular arithmetic, the Euclidean Algorithm, Fermat's theorem, Euler's totient function, and the Chinese Remainder theorem. Additionally, it covers concepts such as discrete logarithms and primality testing.

Uploaded by

lalithaditya1899
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

Cryptography and

Network Security
Module 1
Introduction to number theory
Group
Field
Modular arithmetic and Ring of
integers modulo n
Euclidean Algorithm (to calculate the gcd of
two integers)
Extended Euclidean Algorithm
Fermat’s theorem
Euler’s totient function and Euler’s theorem
Fermat’s Primality Testing
Chinese Remainder theorem
Discrete logarithm

You might also like