Score:2

On the security of OAEP

jp flag

I saw theorems stating that RSA-OAEP (or the similar variant OAEP+) is CCA-secure in the random oracle model.

I wonder about the following:

  • Is RSA-OAEP (or even OAEP+) CPA-secure in the plain model? If so, what properties does the hash functions need to hold?
  • Are there any lower bounds for the padding length compared to the plaintext? I remember hearing that one needs to have at least $\Theta(n)$ bits of padding to argue security.
  • Are there any upper bounds for the plaintext length compared to the modulus (when using a single exponentiation)?
Maarten Bodewes avatar
in flag
You can simply put dollar signs around your $\LaTeX$ to get it formatted (SE allows MathJAX on specific sites such as cryptography). Double dollar signs will center a formula and put whitespace around it. No need for all the niceties / fluff, we'll take upvotes, accepts and good responses instead :)
I sit in a Tesla and translated this thread with Ai:

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.