Score:0

Explaining: The probability of breaking an encryption scheme

in flag

I was reading intro to modern cryptography and didn't understand how did they calculate the probability:

Say we have a cryptographic scheme in which an honest parties run for $10^6 \cdot n^2$ cycles and for which an adversary running for $10^8 \cdot n^4$ cycles can succeed in breaking the scheme with probability at least $2^{-n/2}$.

Score:1
cn flag

They didn't. They made up some numbers as an example, likely to be used in the following text.

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.