Scribd
Upload
83 views

Lecture 7: Modules 7.1-7.10 Network Security CSE 628/628A: Sandeep K. Shukla Indian Institute of Technology Kanpur

This document summarizes Module 7.2 on public key cryptography from a lecture on network security. It introduces the concepts of public and private keys, where the public key is used to encrypt messages and the private key is used to decrypt them. It then describes how Alice and Bob can use each other's public keys to encrypt messages in order to establish a shared secret without an eavesdropper like Eve accessing the channel and learning the secret. The document provides some simplified examples of how public key cryptography relies on mathematical concepts like modular inverse and asymmetric algorithms.

Uploaded by

Harpreet Singh
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
83 views

Lecture 7: Modules 7.1-7.10 Network Security CSE 628/628A: Sandeep K. Shukla Indian Institute of Technology Kanpur

This document summarizes Module 7.2 on public key cryptography from a lecture on network security. It introduces the concepts of public and private keys, where the public key is used to encrypt messages and the private key is used to decrypt them. It then describes how Alice and Bob can use each other's public keys to encrypt messages in order to establish a shared secret without an eavesdropper like Eve accessing the channel and learning the secret. The document provides some simplified examples of how public key cryptography relies on mathematical concepts like modular inverse and asymmetric algorithms.

Uploaded by

Harpreet Singh
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/ 12

Lecture 7: Modules 7.1-7.

10
Network Security
CSE 628/628A
Sandeep K. Shukla
Indian Institute of Technology Kanpur
Acknowledgements
Dan Boneh (Stanford University)
John C. Mitchell (Stanford University)
Nicolai Zeldovich (MIT)
Jungmin Park (Virginia Tech)
Patrick Schaumont (Virginia Tech)
C. Edward Chow
Arun Hodigere
Mike Freedman, Princeton University
Scott Midkiff, Virginia Tech
Insup Lee, University of Pennsylvania
Web Resources
Lecture 7: Network Security
Total 6 Modules on basic Cryptography and
network security
Module 7.1: Basic Cryptography
Module 7.2: Public Key Crypto
Module 7.3: RSA Public Key Crypto System
Module 7.4: Digital Signatures and Hash Functions
Module 7.5: Public Key Distribution
Module 7.6: Real World Protocols
Module 7.7: Network Security
Module 7.2
Public Key Cryptography
Public Key Cryptography
KR(pub) KR(pri)

M C M
S E D R

KR(pub) is Receivers public key and KR(pri) is Receivers


private key.

5
Establishing Shared Secrete

Internet

6
Problem Statement
Suppose Alice has an channel for communicating with
Bob.
Alice and Bob wish to use this channel to establish a
shared secret.
However, Eve is able to learn everything sent over the
channel.
If Alice and Bob have no other channel to use, can they
establish a shared secret that Eve does not know?

7
Public Key Cryptographic Algorithms
Find a hard math problem, that is easy to
compute in the forward direction, but is
difficult to solve in the reverse direction,
unless you have some special knowledge.

8
Public Key Cryptosystem

4/20/01 EMTM 553 9


General Strategy
A public key is used to encrypt a message that can be
decrypted only by the matching private key.
Bob can use Alices public key to encrypt messages. Only
Alice can decrypt the message.
Similarly, Alice can also use Bobs public key.
Alice and Bob exchange information, each keeping a secret
to themselves.
The secrets that they keep allow them to compute a shared
secret.
Since Eve lacks either of these secrets she is unable to
compute the shared secret.
10
Simplified Math Tricks
Public key cryptography is based on the mathematical
concept of multiplicative inverse.
Multiplicative inverses are two numbers that when
multiplied equals one (e.g., 7 x 1/7 = 1)
In modular mathematics, two whole numbers are inverses
if they multiply to 1 (e.g., 3 x 7 mod 10 = 1)
Use modular inverse pairs to create public and private
keys.
Example
Message is 4
To scramble it, use 4 X 3 mod 10 = 2
To recover it, use 2 x 7 mod 10 = 4
The security of public key systems depends on the 11
Asymmetric Algorithms
Also called public-key algorithms.
Encryption key is different from decryption key.
Furthermore, one cannot be calculated from other.
Encryption key is often called the public key and
decryption key is often called the private key.
Advantages: better key management.
Disadvantages: slower, more complex.
Both techniques are complementary.
Examples: RSA, Diffie-Hellman, El Gamal, etc.
12

You might also like