31/03/2025, 14:28 Foundations of Cryptography - - Unit 12 - Week 10 El Gamal Encryption Scheme, RSA Assumption, RSA Public-key Cryptosy…

(https://swayam.gov.in) (https://swayam.gov.in/nc_details/NPTEL)

[email protected] 

NPTEL (https://swayam.gov.in/explorer?ncCode=NPTEL) » Foundations of Cryptography (course)


Click to register
for Certification
exam
Week 10 Assignment 10
(https://examform.nptel.ac.in/2025_01/exam_form/dashboard)
Your last recorded submission was on 2025-03-31, 14:05 Due date: 2025-04-02, 23:59 IST.
IST
If already
registered, click 1) Let c = (c 1 , c 2 ) be a ciphertext, produced by an instance of El Gamal encryptionscheme, 2 points
to check your for some unknown plaintext m and let a PPT adversary possess (c 1 , c 2 ), but not m . The adversary also have
payment status access to the public information like public key, groupdescription, etc. Moreover, let m′ be a plaintext
available with the adversary. Then:

It is possible for the adversary to compute an El Gamal ciphertext of m. m′ from

Course c

outline
It is not possible for the adversary to compute an El Gamal ciphertext of m. m′ from c

About Computing an El Gamal ciphertext of m. m′ from c is equivalent to breaking the CPA-security of the
NPTEL ()
El Gamal encryption scheme

None of the above

How does an
NPTEL
online 2) Consider the following security experiment against the text-book RSA 2 points
course signature:the PPT adversary is given the public verification-key vk and a random message m . (from the
work? () message space) by the verifier.The challenge for the adversary is to then come up with a valid signature on
m , without getting the signing-oracle access at all. Then
Week 1
The adversary can win in the security experiment with probability 1
Course
Overview, If the RSA assumption holds, then the adversary can win the experiment only with a negligible
Symmetric- probability
key The adversary can never win the experiment
Encryption,
Even if the RSA assumption holds, the adversary can win the experiment with a non-negligible
Historical
probability
Ciphers,
Perfect
Security and 3) Which of the following is/are false for the El Gamal encryption scheme? 2 points

If DDH assumption holds then it is CPA-secure

https://onlinecourses.nptel.ac.in/noc25_cs31/unit?unit=77&assessment=197 1/6
31/03/2025, 14:28 Foundations of Cryptography - - Unit 12 - Week 10 El Gamal Encryption Scheme, RSA Assumption, RSA Public-key Cryptosy…

Its If CDH assumption holds then it is CPA-secure

Limitations ()
If DDH assumption holds then it is CCA-secure

Week 2 It is not CCA-secure, since it is malleable

Computation 4) Consider the following modification to the Diffie-Hellman key-exchange protocol,executed 2 points
al Security,
over a cyclic group of order q with generator g : the sender and receiver sends Ks = g
x
and
Semantic
Kr = g
y
to each other, where x, y are randomly selected from Zq and outputs Ks . Kr as the
Security and
final key. Assume DLog, CDH, DDH and all other related assumptions are true in the underlying group and
Pseudorand
this modified protocol is executed in the presence of a semi-honest PPT adversary. Then
om
Generators From the view point of the adversary, the output key will be pseudorandom
(PRGs) ()
From the view point of the adversary, the output key is uniformly random and unknown

Week 3 The adversary will know some part of the output key
Stream
Ciphers, The adversary will completely know the underlying output key
Provably-
secure
Instantiation 5) We want to construct a collision-resistant hash function over a cyclic group based on the 2 points
of PRG,
hardness of Discrete-logarithm and related problems. For this, consider a primeorder cyclic group G of order
Practical
q with a generator g. Then consider the function f : Z
n
→ G , where
Instantiation q

def

of PRG, CPA- f (α 1 , … , α n ) = g
α 1 ⋅α 2 ⋅…⋅α n
. Here, (α1 , … , αn ) ∈ Z
n
q

security and
Pseudo-
Function f is collision-resistant, provided DLog assumption holds in G
random
Functions
Function f is collision-resistant, provided DDH assumption holds in G
(PRFs) ()

Function f is collision-resistant, provided CDH assumption holds in G

Week 4 CPA-
Secure Function f is not collision-resistant
Ciphers from
PRF, Modes You may submit any number of times before the due date. The final submission will be
of considered for grading.
Operations
Submit Answers
of Block
Ciphers,
Theoretical
Construction
s of Block
Ciphers and
Practical
Construction
s of Block
Ciphers ()

Week 5 DES,
AES and
Message
Authenticati
on Codes
(MAC) ()

https://onlinecourses.nptel.ac.in/noc25_cs31/unit?unit=77&assessment=197 2/6
31/03/2025, 14:28 Foundations of Cryptography - - Unit 12 - Week 10 El Gamal Encryption Scheme, RSA Assumption, RSA Public-key Cryptosy…

Week 6
Information-
theoretic
Secure MAC,
Cryptographi
c Hash
Functions,
Ideal-Cipher
Model,
Davies-
Meyer
construction
and Merkle-
Damgård
Paradigm ()

Week 7
Birthday
Attacks on
Cryptographi
c Hash
Functions,
Applications
of Hash
Functions,
Random
Oracle Model
and
Authenticate
d Encryption
()

Week 8
Generic
Construction
s of
Authenticate
d Encryption
Schemes,
Key-
exchange
Problem,
One-way
Trapdoor
Functions
and Cyclic
Groups ()

Week 9
Discrete-
Logarithm
Problem,
Computation

https://onlinecourses.nptel.ac.in/noc25_cs31/unit?unit=77&assessment=197 3/6
31/03/2025, 14:28 Foundations of Cryptography - - Unit 12 - Week 10 El Gamal Encryption Scheme, RSA Assumption, RSA Public-key Cryptosy…

al Diffie-
Hellman
Problem,
Decisional
Diffie-
Hellman
Problem,
Elliptic-
Curve Based
Cryptograph
y and Public-
Key
Encryption ()

Week 10 El
Gamal
Encryption
Scheme,
RSA
Assumption,
RSA Public-
key
Cryptosyste
m, KEM-DEM
Paradigm
and CCA-
security in
the Public-
key Domain
()

El Gamal
Public-key
Encryption
Scheme (unit?
unit=77&lesso
n=78)

RSA
Assumption
(unit?
unit=77&lesso
n=79)

RSA Public-
key
Cryptosystem
(unit?
unit=77&lesso
n=80)

Hybrid Public-
key
Cryptosystem
(unit?

https://onlinecourses.nptel.ac.in/noc25_cs31/unit?unit=77&assessment=197 4/6
31/03/2025, 14:28 Foundations of Cryptography - - Unit 12 - Week 10 El Gamal Encryption Scheme, RSA Assumption, RSA Public-key Cryptosy…

unit=77&lesso
n=81)

CCA-Secure
Public-key
Ciphers (unit?
unit=77&lesso
n=82)

Feedback
Form (unit?
unit=77&lesso
n=83)

Quiz: Week
10
Assignment
10
(assessment?
name=197)

Week 11
CCA-secure
Public-key
Hybrid
Ciphers
Based on
Diffie-
Hellman
Problems
and RSA-
assumption,
Digital
Signatures,
RSA
Signatures
and Schnorr
Identification
Scheme ()

Video
download ()

Text
Transcripts
()

Live Session
()

Books ()

https://onlinecourses.nptel.ac.in/noc25_cs31/unit?unit=77&assessment=197 5/6
31/03/2025, 14:28 Foundations of Cryptography - - Unit 12 - Week 10 El Gamal Encryption Scheme, RSA Assumption, RSA Public-key Cryptosy…

https://onlinecourses.nptel.ac.in/noc25_cs31/unit?unit=77&assessment=197 6/6