Think of RSA Full-Domain Hash **(RSA-FDH)** signature scheme.

How would you - prove that RSA-FDH is Existentially Unforgeable against a Known Message Attack (KMA). - prove that RSA-FDH is Existentially Unforgeable against a Chosen Message Attack (CMA).

In each of the proof, an outline of the proof-idea is enough. Rigorous mathematical proofs are not required but will be appreciated.

## Comments

Sort by:

TopNewestI do not remember these terms that well. @Sharky Kesa @Pi Han Goh any idea? – Agnishom Chattopadhyay · 1 year, 2 months ago

Log in to reply

– Sharky Kesa · 1 year, 2 months ago

I got no idea at all. Cryptography is not really my forte.Log in to reply

– Pi Han Goh · 1 year, 2 months ago

Nope. No idea.Log in to reply