M.Tech Network Security notes

© All Rights Reserved

72 views

M.Tech Network Security notes

© All Rights Reserved

- Encryption Policy for the 21st Century: A Future without Government-Prescribed Key Recovery, Cato Policy Analysis
- Advanced Computer Networks - CS716 Power Point Slides Lecture 40
- Encryption Technique
- lec25-security
- 6th Week - E-Payment
- Security on the E-Commerce Site
- RSA
- RSA-KEM4
- Cryptography and Network Security(r)
- Ciphertext-Policy Attribute-Based Encryption
- Kei45 net
- 10.1.1.116
- joli
- cacr2004-03
- e 124450
- Design and Implementation of Network Security Using Genetic Algorithm
- Network Security Notes
- Ssl
- Jit Dynamic Cryptosystem
- Proposed-Model-of-Encryption-Technique-using-Block-Cipher-Concept-to-Enhance-Avalanche-Effect.pdf

You are on page 1of 18

Unit - II

Uniqueness Number Theory concepts Primality Modular Arithmetic Fermet & Euler Theorem Euclid

Algorithm RSA Elliptic Curve Cryptography Diffie Hellman Key Exchange

Uniqueness

TBD

Divisibility and The Division Algorithm

Divisibility

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 b|a is commonly used to mean b divides a.

If b|a, we say that b is a divisor of a.

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: The remainder r is often referred to as a residue

hcr:innovationcse@gg

Unit - II

Primality

Prime Numbers

An integer p > 1 is prime number, if its divisors are +/- 1 and +/1 p

Any non negative integer a > 1 can be factored in the form as

where p1 < p2 < ... < pt are prime numbers and where each a is a

positive integer.

This is known as the fundamental theorem of arithmetic

Examples: 91 = 7 x 13, 3600 = 24 x 32 x 52

Miller-Rabin Algorithm

also known as Rabin-Miller algorithm, or the Rabin-Miller test, or the Miller-Rabin test

typically used to test a large number for primality

If p is prime and a is a positive integer less than p, then a2 mod p = 1, if and only if either a mod p = 1 or a

mod p = -1 mod p = p 1

Let p be a prime number greater than 2. We can then write p - 1 = 2kq with k > 0, q odd

Algorithm

the CRT says it is possible to reconstruct integers in a certain range from their residues modulo a set of

pairwise relatively prime moduli

Formula

Relatively Prime

Two integers are relatively prime, if their only common positive integer factor is 1

Example: 8, 15 are relatively prime because positive divisors of 8 are 1, 2, 4, 8. Positive divisors of 15 are

1, 3, 5, 15. Common positive factor = 1

hcr:innovationcse@gg

Unit - II

Modular Arithmetic

The Modulus

Properties of Congruences

Examples

MTech CSE (PT, 2011-14) SRM, Ramapuram

hcr:innovationcse@gg

Unit - II

reducing k modulo n.

Finding the smallest nonnegative integer to which k is congruent modulo n

hcr:innovationcse@gg

Unit - II

Fermats Theorem

If p is prime and a is a positive integer not divisible by p, then

Proof:

Multiply each element by a, modulo p to get the set

o X = {a mod p, 2a mod p, ... (p - 1)a mod p}

None of the elements of X is equal to zero because p does not divide a

Therefore, we know that the (p - 1) elements of X are all positive integers with no two elements equal

We can conclude the X consists of the set of integers {1, 2, ..., p - 1} in some order

Multiplying the numbers in both sets (p and X) and taking the result mod p yields

We can cancel the (p -1)! term because it is relatively prime to p, which prooves the theorem

Example:

If p is prime and a is a positive integer, then

Eulers Theorem

Eulers totient function ( (n))

the number of positive integers less than n and relatively prime to n. (1) = 1

for a prime number p, (p) = p - 1

for two prime numbers where p # q,

hcr:innovationcse@gg

Unit - II

Eulers Theorem

alternative form

Proof:

Consider the set of positive integers less thann that are relatively prime to n, labeled as

hcr:innovationcse@gg

Unit - II

Simple procedure for determining the greatest common divisor of two positive integers.

Two integers are relatively prime if their only common positive integer factor is 1

gcd(0, 0) = 0.

1. c is a divisor of a and of b

2. Any divisor of a and b is a divisor of c

Example:

8 and 15 are relatively prime because the positive divisors of 8 are 1, 2, 4, and 8, and the positive divisors of 15

are 1, 3, 5, and 15. So 1 is the only integer on both lists.

Steps

Example

hcr:innovationcse@gg

Unit - II

gcd(a, b) = gcd (b, a mod b)

o Example: gcd(55, 22) = gcd(22, 55 mod 22) = gcd(22, 11) = 11

Recursive function.

Euclid(a,b)

if (b=0) then return a;

else return Euclid(b, a mod b);

The Extended Euclidean Algorithm

calculate the greatest common divisor but also two additional integers and that satisfy the following equation

hcr:innovationcse@gg

Unit - II

Principles of Public-Key Cryptosystems

Public-Key Cryptosystems

Applications for Public-Key Cryptosystems

Requirements for Public-Key Cryptography

Public-Key Cryptanalysis

Public-Key Cryptosystems

Introduction

The concept evolved from an attempt to attack two of the most difficult problems associated with symmetric

encryption

o Key Distribution

o The Digital Signatures

Called as Asymmetric Cryptography

Asymmetric algorithms make use of one key for encryption, another for decryption

It is computationally infeasible to determine the decryption key given only knowledge of the cryptographic

algorithm and the encryption key

Either of the two related keys can be used for encryption, with the other used for decryption

Public-Key Cryptography

Six Ingredients

Plaintext: This is the readable message or data that is fed into the algorithm as input.

Encryption algorithm: The encryption algorithm performs various transformations on the plaintext.

Public and private keys: This is a pair of keys that have been selected so that if one is used for

encryption, the other is used for decryption. The exact transformations performed by the algorithm depend

on the public or private key that is provided as input.

Ciphertext: This is the scrambled message produced as output. It depends on the plaintext and the key.

For a given message, two different keys will produce two different ciphertexts.

Decryption algorithm: This algorithm accepts the ciphertext and the matching key and produces the

original plaintext.

Encryption

hcr:innovationcse@gg

Unit - II

Authentication

Conventional Encryption

Needed to Work

1. The same algorithm with the same key is used for

encryption and decryption.

2. The sender and receiver must share the algorithm

and the key.

Public-Key Encryption

Needed to Work

1. One algorithm is used for encryption and decryption

with a pair of keys, one for encryption and one for

decryption.

2. The sender and receiver must each have one of the

matched pair of keys (not the same one).

decipher a message if no other information is

available.

decipher a message if no other information is available.

ciphertext must be insufficient to determine the key.

samples of ciphertext must be insufficient to determine

the other key.

10

hcr:innovationcse@gg

Unit - II

Encryption/decryption

The sender encrypts a message with the recipient's public key.

Digital signature

The sender "signs" a message with its private key. Signing is achieved by a cryptographic algorithm applied to

the message or to a small block of data that is a function of the message.

Key exchange

Two sides cooperate to exchange a session key. Several different approaches are possible, involving the

private key(s) of one or both parties.

11

hcr:innovationcse@gg

Unit - II

Algorithm

Encryption/Decryption

Digital Signature

Key Exchange

RSA

Yes

Yes

Yes

Elliptic Curve

Yes

Yes

Yes

Diffie-Hellman

No

No

Yes

DSS

No

Yes

No

1. It is computationally easy for a party B to generate a pair (public key PUb, private key PRb).

2. It is computationally easy for a sender A, knowing the public key and the message to be encrypted, M, to

generate the corresponding ciphertext C = E(PUb, M)

3. It is computationally easy for the receiver B to decrypt the resulting ciphertext using the private key to

recover the original message M = D(PRb, C) = D[PRb, E(PUb, M)]

4. It is computationally infeasible for an adversary, knowing the public key, PUb, to determine the private key,

PRb.

5. It is computationally infeasible for an adversary, knowing the public key, PUb, and a ciphertext, C, to

recover the original message, M.

6. The two keys can be applied in either order: M = D[PUb, E(PRb, M)] = D[PRb, E(PUb, M)]

Public-Key Cryptanalysis

Three types of attacks

Brute force

Deducing the private key

Probale message attack

Brute force

countermeasure is to use large keys

Public-key systems depend on the use of some sort of invertible mathematical function

the key size must be large enough to make brute-force attack impractical but small enough for practical

encryption and decryption

find some way to compute the private key given the public key

So far, not been mathematically proven that this is infeasible for a particular public-key algorithm

Not been successful till date

Suppose, for example, that a message were to be sent that consisted solely of a 56-bit DES key.

An adversary could encrypt all possible 56-bit DES keys using the public key and could discover the

encrypted key by matching the transmitted ciphertext.

Thus, no matter how large the key size of the public-key scheme, the attack is reduced to a brute-force

attack on a 56-bit key.

This attack can be thwarted by appending some random bits to such simple messages

12

hcr:innovationcse@gg

Unit - II

block cipher in which the plaintext and ciphertext are integers between 0 and n - 1 for some n.

A typical size for n is 1024 bits, or 309 decimal digits

public-key encryption algorithm with a public key of PU = {e, n} and a private key of PR = {d, n}.

Key Generation

Encryption

Decryption

13

hcr:innovationcse@gg

Unit - II

Encryption

Decryption

Four possible approaches to attacking the RSA algorithm are as follows:

Brute force

The defense is to use a large key space

the larger the number of bits in e and d, the better

the larger the size of the key, the slower the system will run

Mathematical attacks

There are several approaches, all equivalent in effort to factoring the product of two primes.

Timing attacks

These depend on the running time of the decryption algorithm.

Chosen ciphertext attacks

This type of attack exploits properties of the RSA algorithm.

Mathematical Attacks

14

hcr:innovationcse@gg

Unit - II

To avoid values of n that may be factored more easily, the algorithms inventors suggest the following

constraints on p and q.

Timing Attack

o It comes from a completely unexpected direction

o it is a ciphertext-only attack

A timing attack is somewhat analogous to a burglar guessing the combination of a safe by observing how

long it takes for someone to turn the dial from number to number.

We can explain the attack using the modular exponentiation algorithm

modular exponentiation is accomplished bit by bit, with one modular multiplication performed at each

iteration and an additional modular multiplication performed for each 1 bit

Suppose that the first j bits are known

For a given ciphertext, the attacker can complete the first j iterations of the for loop.

The operation of the subsequent step depends on the unknown exponent bit.

if the observed time to execute the decryption algorithm is always slow when this particular iteration is slow

with a 1 bit, then this bit is assumed to be 1.

If a number of observed execution times for the entire algorithm are fast, then this bit is assumed to be 0

Constant exponentiation time

Ensure that all exponentiations take the same amount of time before returning a result.

This is a simple fix but does degrade performance

Random delay

Better performance could be achieved by adding a random delay to the exponentiation algorithm to confuse the

timing attack.

Blinding

This process prevents the attacker from knowing what ciphertext bits are being processed inside the

computer and therefore prevents the bit-by-bit analysis essential to the timing attack

15

hcr:innovationcse@gg

Unit - II

Abelian Groups {G, .}

equations for elliptic curves take the form, known as a Weierstrass equation

single element denoted O and called the point at infinity or the zero point

16

hcr:innovationcse@gg

Unit - II

The purpose of the algorithm is to enable two users to securely exchange a key that can then be used for

subsequent encryption of messages

The Algorithm

Each side keeps the X value private and makes the Y value available publicly to the other side.

User A computes the key as

These two calculations

Proof

The result is that the two sides have exchanged a secret value

Global Public Elements

17

hcr:innovationcse@gg

Unit - II

Example

Key exchange is based on the use of the prime number q = 353 and a primitive root of 353, alpha = 3

A and B select secret keys XA = 97 and XB = 233, respectively. Each computes its public key:

A computes YA = 397 mod 353 = 40; B computes YB = 3233 mod 353 = 248

After they exchange public keys, each can compute the common secret key:

A computes K = (YB)XA mod 353 = 24897 mod 353 =160.

B computes K = (YA)XB mod 353 = 40233 mod 353 = 160.

Man-in-the-Middle Attack

Suppose Alice and Bob wish to exchange keys, and Darth is the adversary.

The attack proceeds as follows:

At this point, Bob and Alice think that they share a secret key, but instead Bob and Darth share secret key

K1 and Alice and Darth share secret key K2.

All future communication between Bob and Alice is compromised in the following way.

Disclaimer

Intended for educational purposes only. Not intended for any sort of commercial use

Purely created to help students with limited preparation time

Text and picture used were taken from the reference items

Reference

Cryptography and Network Security, Fourth Edition William Stallings

Credits

Thanks to my family members who supported me, while I spent considerable amount of time to prepare these notes.

Feedback is always welcome at GHCRajan@gmail.com

18

hcr:innovationcse@gg

- Encryption Policy for the 21st Century: A Future without Government-Prescribed Key Recovery, Cato Policy AnalysisUploaded byCato Institute
- Advanced Computer Networks - CS716 Power Point Slides Lecture 40Uploaded byTaran Aulakh
- Encryption TechniqueUploaded byapi-3706009
- lec25-securityUploaded byapi-3761983
- 6th Week - E-PaymentUploaded byYesi Diah Rosita
- Security on the E-Commerce SiteUploaded byJoel Brown
- RSAUploaded by4gen_7
- RSA-KEM4Uploaded byGaurav Kalya
- Cryptography and Network Security(r)Uploaded byhaidaroracle
- Ciphertext-Policy Attribute-Based EncryptionUploaded byJ_Ramesh
- Kei45 netUploaded byAkaw Tea
- 10.1.1.116Uploaded byAjasudheen Asiet
- joliUploaded byjoolie123456789
- cacr2004-03Uploaded bykiran_tomar87
- e 124450Uploaded bywww.irjes.com
- Design and Implementation of Network Security Using Genetic AlgorithmUploaded byInternational Journal of Research in Engineering and Technology
- Network Security NotesUploaded byTasneem Fathima
- SslUploaded bySkyezine Via Kit Fox
- Jit Dynamic CryptosystemUploaded byInternational Journal of Research in Engineering and Technology
- Proposed-Model-of-Encryption-Technique-using-Block-Cipher-Concept-to-Enhance-Avalanche-Effect.pdfUploaded byeditor_ijcat
- Securing Windows.pdfUploaded byBob
- CS432 Project Spring15Uploaded byNouman Khalid
- mobile voting systemUploaded bysanam
- Key-Aggregate Searchable Encryption (KASE) for Group Data Sharing via Cloud StorageUploaded byMohammed Jeelan
- 1-s2.0-S1877050916001691-mainUploaded byLeonardo Orosco
- [IJETA-V5I1P7]:Kholoud Sweekat, Fatema Zarka, Boushra Maala, Ahmad S. AhmadUploaded byIJETA - EighthSenseGroup
- Privacy Protection and the LawUploaded byMary Grace Ventura
- Acceptable Encryption PolicyUploaded byTejas Jadhav
- Synopsis final.docxUploaded byGaba Studio
- block chain (1).docxUploaded byMohan Atirokic

- ConfIicker - malicious wormUploaded byfrimstar
- gratisexam.com-CompTIA.ActualTests.SY0-401.v2016-02-04.by.AceBoog.751qUploaded byEdison Zapata
- [IJIT-V4I6P1]: Azhar UshmaniUploaded byIJITJournals
- Lecture8_SHA.pptUploaded byAnonymous ezsdI6Ev
- Cse 403p Network Security and CryptographyUploaded bychatty007
- Authentication SecurityUploaded byGanesh
- CSCI_620_lecture10.pptUploaded byPruthvi Royal
- Ethics in Information TechnologyUploaded bycarl_abangan
- Rp Data Breach Digest 2017 Perspective is Reality Xg EnUploaded bysaladfingers8989
- EC301 Chapter 6Uploaded byAyu Wafa
- Final Edit PhishingUploaded bySyamira Nazri
- csit2417Uploaded byrocketraji
- TG05Uploaded byKanwar Pawar
- SSCP Study Questions.pdfUploaded byrvnkrish24
- Automated E-Pin Generator in Banking SectorUploaded bydbpublications
- The Evolution of Cybersecurity_Sandbox QuizUploaded bychhun
- EAP-TLSUploaded byscribdbhanu
- Schedule Pintu Jendela MBCUploaded byIway Prasetya
- Adobe Security BreachUploaded byGaurav Fouzdar
- Site to Site IPsec VPNUploaded bymanaf hasibuan
- Testing for weak SSL ciphers for security auditsUploaded byadmin870
- The Soter Group - 2016 Cyber Security Conference Calendar (May-December)Uploaded byThe Soter Group, LLC
- Public-Key Cryptography thesisUploaded bysharnoby
- MAIN PPTUploaded byAarti Singh
- week1-F2F.pptUploaded byMiltiades Aditya Aditya
- Innovya Traceless Biometrics TechnologyUploaded byMicha.Shafir
- Cryptography.pptUploaded byAayatKhan
- Data Sheet Securitycenter Continuous ViewUploaded byjosu_rc
- MongoDB Security Architecture WPUploaded bysantos alarcon
- BiometricAccessControl TrainingUploaded bywildor01