Score:0

Protocols of elliptic cryptography, which don't require an indifferentiable hash function (but only a collision-resistant one)?

id flag

Consider an elliptic curve $E$ over a finite field $\mathbb{F}_{\!q}$. Do you know protocols of elliptic cryptography, which require a hash function $H\!: \{0,1\}^* \to E(\mathbb{F}_{\!q})$ such that $H$ is not necessary a random oracle (but only collision-resistant) ?

kelalaka avatar
in flag
ECDH to AES key...
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.