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.
Easy Math Editor
This discussion board is a place to discuss our Daily Challenges and the math and science related to those challenges. Explanations are more than just a solution — they should explain the steps and thinking strategies that you used to obtain the solution. Comments should further the discussion of math and science.
When posting on Brilliant:
*italics*
or_italics_
**bold**
or__bold__
paragraph 1
paragraph 2
[example link](https://brilliant.org)
> This is a quote
\(
...\)
or\[
...\]
to ensure proper formatting.2 \times 3
2^{34}
a_{i-1}
\frac{2}{3}
\sqrt{2}
\sum_{i=1}^3
\sin \theta
\boxed{123}
Comments
I do not remember these terms that well. @Sharky Kesa @Pi Han Goh any idea?
Log in to reply
Nope. No idea.
I got no idea at all. Cryptography is not really my forte.