Waste less time on Facebook — follow Brilliant.
×

Public key Authentication Problem

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.

Note by Raja Metronetizen
5 months, 3 weeks ago

No vote yet
1 vote

Comments

Sort by:

Top Newest

I do not remember these terms that well. @Sharky Kesa @Pi Han Goh any idea? Agnishom Chattopadhyay · 5 months, 3 weeks ago

Log in to reply

@Agnishom Chattopadhyay I got no idea at all. Cryptography is not really my forte. Sharky Kesa · 5 months, 3 weeks ago

Log in to reply

@Agnishom Chattopadhyay Nope. No idea. Pi Han Goh · 5 months, 3 weeks ago

Log in to reply

×

Problem Loading...

Note Loading...

Set Loading...