Scribd
Upload
5 views

Lecture #8 Elgamal Encryption Algorithm

The ElGamal encryption algorithm is an asymmetric key encryption system based on the Diffie-Hellman key exchange, providing enhanced security for symmetric message encryption. It utilizes a prime number and a primitive root to generate public/private key pairs, allowing users to encrypt and decrypt messages securely. The system incorporates measures against replay attacks and emphasizes the importance of digital certificates for authenticating public keys.

Uploaded by

sajjalmandana661
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
5 views

Lecture #8 Elgamal Encryption Algorithm

The ElGamal encryption algorithm is an asymmetric key encryption system based on the Diffie-Hellman key exchange, providing enhanced security for symmetric message encryption. It utilizes a prime number and a primitive root to generate public/private key pairs, allowing users to encrypt and decrypt messages securely. The system incorporates measures against replay attacks and emphasizes the importance of digital certificates for authenticating public keys.

Uploaded by

sajjalmandana661
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

ELGAMAL ENCRYPTION

ALGORITHM
2

OBJECTIVES
ElGamal Encryption Scheme
Security of ElGamal Encryption
Differentiate Diffie-Hellman & Elgamal
Click to add picture

ELGAMAL ENCRYPTION
 The ElGamal encryption system is
an asymmetric key encryption
algorithm for public-key cryptography which is
based on the Diffie–Hellman key exchange

 The system provides an additional layer of


security by asymmetrically encrypting keys
previously used for symmetric message
encryption

 As with Diffie-Hellman, the global elements of


Elgamal are a prime number q and a, which is
a primitive root of q.
Click to add picture

PRIMITIVE ROOT
• A primitive root of a prime number p, is an
integer g such that the powers of g modulo p
generate all integers from 1 to p−1.
• In other words, g is a generator of the
multiplicative group of integers modulo p.
5

ELGAMAL ENCRYPTION
 User A generates a private/public key pair as follows:

 Any user B that has access to A’s public key can encrypt a
message as follows:
6

ELGAMAL ENCRYPTION
• User A recovers the key as well as the message as follows

• Let us demonstrate why the ElGamal scheme works. First, we


show how K is recovered by the decryption process
7
ELGAMAL STEPS 8
EXAMPLE 9
10

SECURITY OF ELGAMAL

 Trap-door function:
• s = gn mod p
• Easy: given g, n, & p, solve for s
• Hard: given s, g, & p, solve for n
 Ephemeral key (k):
• A new key k is generated for each message
 Replay Attacks Resistance:
• Unique k values prevent reuse of old ciphertexts
 Man-In-The-Middle (MITM) Attacks:
• Attacker can still intercept and replace the public key
sent on the public channel, just like Diffie-Hellman!
11

WHAT TO DO?

 Digital Certificates

•Use a Public Key Infrastructure (PKI) with digital


certificates to authenticate public keys. Click icon to add picture
•This ensures that the sender's public key is validated as
belonging to the legitimate sender
ANY QUESTIONS?

You might also like