Cryptography Stack Exchange is a question and answer site for software developers, mathematicians and others interested in cryptography. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

I have a simple question about the use of random variables for encryption schemes, to make sure my intuition is correct.

We say $P(K = k)$ to represent the probability that a particular key $k$ is chosen by the probabilistic algorithm Gen. Formally, $K$ is a random variable that denotes the value of the key.

So the expression $K = k$ denotes an event: specifically, a subset of the sample space. But all the keys are unique, so is this event really a set of size one? And is it then just an elementary event?

Then, why can't we just say $P(k)$ to denote the probability of $k$ being output? Do we use the random variable to be more explicit and clear?

share|improve this question

We use the random variable to indicate the "by what" part of "the probability of $k$ being output".

share|improve this answer
So, the probability of $k$ being output by $Gen$? – Sam Oct 16 '13 at 12:46
Yes. ${}{}{}\;$ – Ricky Demer Oct 16 '13 at 17:37

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.