Score:1

Security proof about RFC 6979

se flag

In the paper: "The Random Oracle Model: a Twenty-Year Retrospective", section 7.3 by Koblitz & Menezes,the authors tried to prove the security of ECDSA+.

But after looking at the entire proof, I didn’t find that they considered the probability that both forgers would choose the same $M$ and $R'$ for the $j$-th time.

In my cognition, after considering the probability of simultaneously selecting $M$ and $R'$, the probability of an attacker successfully breaking the elliptic curve discrete logarithm problem may become negligible.

Does this proof need not consider the probability of $M$ and $R'$? Or am I misunderstanding the proof?

mangohost

Post an answer

Most people don’t grasp that asking a lot of questions unlocks learning and improves interpersonal bonding. In Alison’s studies, for example, though people could accurately recall how many questions had been asked in their conversations, they didn’t intuit the link between questions and liking. Across four studies, in which participants were engaged in conversations themselves or read transcripts of others’ conversations, people tended not to realize that question asking would influence—or had influenced—the level of amity between the conversationalists.