0% found this document useful (0 votes)
3 views39 pages

Public Key Cryptosystem Overview

The document covers public key cryptography, including pseudorandom number generators, RSA algorithm, Diffie-Hellman key exchange, and elliptic curve cryptography. It explains the principles, applications, and security aspects of public key cryptosystems, along with computational details of the RSA algorithm. Additionally, it provides a step-by-step example of solving the RSA algorithm using specific values.

Uploaded by

Savita Nekar
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
0% found this document useful (0 votes)
3 views39 pages

Public Key Cryptosystem Overview

The document covers public key cryptography, including pseudorandom number generators, RSA algorithm, Diffie-Hellman key exchange, and elliptic curve cryptography. It explains the principles, applications, and security aspects of public key cryptosystems, along with computational details of the RSA algorithm. Additionally, it provides a step-by-step example of solving the RSA algorithm using specific values.

Uploaded by

Savita Nekar
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

PUBLIC KEY CRYPTOSYSTEM

MODULE 2
Pseudorandom number Generators: Linear Congruential Generators, Blum Blum Shub
Generator.
Public key cryptography and RSA: Principles of public key cryptosystems-Public key
cryptosystems, Applications for public key cryptosystems, Requirements for public key
cryptography, Public key Cryptanalysis,
The RSA algorithm: Description of the Algorithm, Computational aspects, The Security of RSA.
Diffie-Hellman key exchange: The Algorithm, Key exchange Protocols, Man-in-the-middle
Attack,
Elliptic Curve Cryptography: Analog of Diffie-Hellman key Exchange, Elliptic Curve
Encryption/Decryption, Security of Elliptic Curve Cryptography.

PAGE N0- 1
BABU SAB ,JITD DAVANGERE, CSE DEPT
PUBLIC KEY CRYPTOSYSTEM

PAGE N0- 2
BABU SAB ,JITD DAVANGERE, CSE DEPT
PUBLIC KEY CRYPTOSYSTEM

HINT:

PAGE N0- 3
BABU SAB ,JITD DAVANGERE, CSE DEPT
PUBLIC KEY CRYPTOSYSTEM

PAGE N0- 4
BABU SAB ,JITD DAVANGERE, CSE DEPT
PUBLIC KEY CRYPTOSYSTEM

HINT:

PAGE N0- 5
BABU SAB ,JITD DAVANGERE, CSE DEPT
PUBLIC KEY CRYPTOSYSTEM

PAGE N0- 6
BABU SAB ,JITD DAVANGERE, CSE DEPT
PUBLIC KEY CRYPTOSYSTEM

EXAMPLE: 143135 MOD 2=(143135/2 =71567.5)=(71567.5-(MINUS)71567=0.5, 0.5*2=1


97048 MOD 2=0

PAGE N0- 7
BABU SAB ,JITD DAVANGERE, CSE DEPT
PUBLIC KEY CRYPTOSYSTEM

PAGE N0- 8
BABU SAB ,JITD DAVANGERE, CSE DEPT
PUBLIC KEY CRYPTOSYSTEM

PAGE N0- 9
BABU SAB ,JITD DAVANGERE, CSE DEPT
PUBLIC KEY CRYPTOSYSTEM

PAGE N0- 10
BABU SAB ,JITD DAVANGERE, CSE DEPT
PUBLIC KEY CRYPTOSYSTEM

PAGE N0- 11
BABU SAB ,JITD DAVANGERE, CSE DEPT
PUBLIC KEY CRYPTOSYSTEM

PAGE N0- 12
BABU SAB ,JITD DAVANGERE, CSE DEPT
PUBLIC KEY CRYPTOSYSTEM

PAGE N0- 13
BABU SAB ,JITD DAVANGERE, CSE DEPT
PUBLIC KEY CRYPTOSYSTEM

PAGE N0- 14
BABU SAB ,JITD DAVANGERE, CSE DEPT
PUBLIC KEY CRYPTOSYSTEM

PAGE N0- 15
BABU SAB ,JITD DAVANGERE, CSE DEPT
PUBLIC KEY CRYPTOSYSTEM

PAGE N0- 16
BABU SAB ,JITD DAVANGERE, CSE DEPT
PUBLIC KEY CRYPTOSYSTEM

PAGE N0- 17
BABU SAB ,JITD DAVANGERE, CSE DEPT
PUBLIC KEY CRYPTOSYSTEM

PAGE N0- 18
BABU SAB ,JITD DAVANGERE, CSE DEPT
PUBLIC KEY CRYPTOSYSTEM

PAGE N0- 19
BABU SAB ,JITD DAVANGERE, CSE DEPT
PUBLIC KEY CRYPTOSYSTEM

PAGE N0- 20
BABU SAB ,JITD DAVANGERE, CSE DEPT
PUBLIC KEY CRYPTOSYSTEM

PAGE N0- 21
BABU SAB ,JITD DAVANGERE, CSE DEPT
PUBLIC KEY CRYPTOSYSTEM

PAGE N0- 22
BABU SAB ,JITD DAVANGERE, CSE DEPT
PUBLIC KEY CRYPTOSYSTEM

PAGE N0- 23
BABU SAB ,JITD DAVANGERE, CSE DEPT
PUBLIC KEY CRYPTOSYSTEM

PAGE N0- 24
BABU SAB ,JITD DAVANGERE, CSE DEPT
PUBLIC KEY CRYPTOSYSTEM

PAGE N0- 25
BABU SAB ,JITD DAVANGERE, CSE DEPT
PUBLIC KEY CRYPTOSYSTEM

PAGE N0- 26
BABU SAB ,JITD DAVANGERE, CSE DEPT
PUBLIC KEY CRYPTOSYSTEM

PAGE N0- 27
BABU SAB ,JITD DAVANGERE, CSE DEPT
PUBLIC KEY CRYPTOSYSTEM

PAGE N0- 28
BABU SAB ,JITD DAVANGERE, CSE DEPT
PUBLIC KEY CRYPTOSYSTEM

PAGE N0- 29
BABU SAB ,JITD DAVANGERE, CSE DEPT
PUBLIC KEY CRYPTOSYSTEM

PAGE N0- 30
BABU SAB ,JITD DAVANGERE, CSE DEPT
PUBLIC KEY CRYPTOSYSTEM

PAGE N0- 31
BABU SAB ,JITD DAVANGERE, CSE DEPT
PUBLIC KEY CRYPTOSYSTEM

X axis
Y axis
Infinite
n-finite

PAGE N0- 32
BABU SAB ,JITD DAVANGERE, CSE DEPT
PUBLIC KEY CRYPTOSYSTEM

PAGE N0- 33
BABU SAB ,JITD DAVANGERE, CSE DEPT
PUBLIC KEY CRYPTOSYSTEM

PAGE N0- 34
BABU SAB ,JITD DAVANGERE, CSE DEPT
PUBLIC KEY CRYPTOSYSTEM

PAGE N0- 35
BABU SAB ,JITD DAVANGERE, CSE DEPT
PUBLIC KEY CRYPTOSYSTEM

RSA EXAM PROBLEM:


Let's solve the RSA algorithm step-by-step using the provided values:

 P=17
 Q=11
 M=88(the plaintext message to be encrypted)

✅ Step 1: Compute modulus NNN

N=P×Q=17×11=187
✅ Step 2: Compute Euler’s Totient ϕ(N)

ϕ(N)=(P−1)(Q−1)=(17−1)(11−1)=16×10=160
✅ Step 3: Choose public key exponent eee

 e must be:
o 1<e<ϕ(N)
o gcd(e,ϕ(N))=1

Let’s choose a common public exponent:

e=7 because gcd(7,160)=1)

PAGE N0- 36
BABU SAB ,JITD DAVANGERE, CSE DEPT
PUBLIC KEY CRYPTOSYSTEM

PAGE N0- 37
BABU SAB ,JITD DAVANGERE, CSE DEPT
PUBLIC KEY CRYPTOSYSTEM

PAGE N0- 38
BABU SAB ,JITD DAVANGERE, CSE DEPT
PUBLIC KEY CRYPTOSYSTEM

PAGE N0- 39
BABU SAB ,JITD DAVANGERE, CSE DEPT

You might also like