Scribd
Upload
3 views121 pages

MCS Unit1

The document outlines a course on Mathematics for Cyber Security, focusing on Number Theory and Elliptic Curves. It covers topics such as primality testing, elliptic curve equations, and the application of Elliptic Curve Cryptography (ECC) for secure data encryption. The document also explains the Diffie-Hellman Key Exchange method using elliptic curves to establish a shared secret between two parties.

Uploaded by

hemanthgangavarapu17
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
3 views121 pages

MCS Unit1

The document outlines a course on Mathematics for Cyber Security, focusing on Number Theory and Elliptic Curves. It covers topics such as primality testing, elliptic curve equations, and the application of Elliptic Curve Cryptography (ECC) for secure data encryption. The document also explains the Diffie-Hellman Key Exchange method using elliptic curves to establish a shared secret between two parties.

Uploaded by

hemanthgangavarapu17
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/ 121

MATHEMATICS FOR CYBER SECURITY

Course Code: MAT304


Semester: IV

UNIT-I 15 Periods
Number Theory and Elliptic Curves
Number Theory: Divisibility, Basic and Extended Euclidean Algorithms, Congruence’s Chinese Reminder
theorem and applications.
Primality testing algorithms, Properties of prime numbers, Pseudo Random number generation, basic
logarithms, functions (m(n),s(n),t(n),j(n),s(n)and p(x)).

Elliptic Curves: Equations and Arithmetic operations on the points of Elliptic curve.

By: Kannan, T sir


1
2
3
4
5
6
Elliptic curve

An elliptic curve E is the graph of an equation of the form y2 = x3 + ax + b, where a and b are
constants. This will be referred to as the Weierstrass equation for an elliptic curve.

1
Elliptic Curve Cryptography (ECC) is a key-based technique for encrypting
data. ECC focuses on pairs of public and private keys for decryption
and encryption of web traffic. ECC is frequently discussed in the context of the
Rivest–Shamir–Adleman (RSA) cryptographic algorithm.

ECC, is a powerful cryptography approach. It generates security between


key pairs for public key encryption by using the mathematics of elliptic curves.

Using ECC, you can achieve the same security level using smaller keys. In a
world where mobile devices must do more and more cryptography with less
computational power, ECC offers high security with faster, shorter keys
compared to RSA. (https://avinetworks.com/glossary/elliptic-curve-cryptography)

2
Elliptical curve cryptography uses these curves over finite fields to create a secret that only the
private key holder is able to unlock.
Diffie-Hellman Key Exchange Encryption
⇒ Person A and Person B want to agree on a common key in order to exchange their message using symmetric encryption
method.
⇒ Assume that person A and person B have no prior contact and the only communication channels between them are public.
⇒ Finding a private key, we use Diffie-Hellman Key Exchange, explained as the following: (using multiplicative groups over a
finite field!)
1) Person A and Person B agree on an elliptic curve E over a finite field Fq such that the discrete logarithm problem is in E(Fq).
They also agree on a point P contained in E(Fq) such that the subgroup generated by P has a large order (usually, the curve and
point are chosen so that the order is a large prime number).
2) Person a chooses a secret number a, computes Pa = aP, and sends Pa to Person B.
3) Person B chooses a secret number b, computes Pb = bP, and send Pb to Person A.
4) Person A computes aPb = abP.
5) Person B computes bPa = baP.
6) Person A and Person B use some publicly agreed on method to compute a key from abP.

3
What information does our eavesdropper, Person C, know? The only information that Person C knows is the
curve E, the finite field Fq, and the points P, aP, bP.
⇒ In order for Person C to get the message that is being transmitted form Person A to Person B, he/she
must compute abP when give P, aP, bP in E(Fq).
This is possible if Person C can solve for discrete logs in E(Fq). Once this happens, he/she can use P and aP
to find the value for a. Then, they can compute a(bP) to get abP.
The only problem is that we don‟t know if there is some way to get abP without first solving for a discrete
log problem. (http://www.umsl.edu/~siegelj/information_theory/projects/EllipticCurveEncyiption)

4
5
6
7
8
9
10

You might also like