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.

No vote yet

1 vote

×

Problem Loading...

Note Loading...

Set Loading...

Easy Math Editor

`*italics*`

or`_italics_`

italics`**bold**`

or`__bold__`

boldNote: you must add a full line of space before and after lists for them to show up correctlyparagraph 1

paragraph 2

`[example link](https://brilliant.org)`

`> This is a quote`

Remember to wrap math in \( ... \) 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

Sort by:

TopNewestI do not remember these terms that well. @Sharky Kesa @Pi Han Goh any idea?

Log in to reply

I got no idea at all. Cryptography is not really my forte.

Log in to reply

Nope. No idea.

Log in to reply