Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It's 100% free, no registration required.

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'm working on implementing Order Preserving Encryption for Numeric Data, and part of the algorithm includes approximating density of the distribution as a linear density function $f(p) = qp+r$ where $p$ exists in the distribution.

From the article:

If a distribution over $[0,ph)$ has the density function $qp + r$, where $p \in [0,ph)$, then for any constant $z > 0$, the mapping function $M(p) = z(\frac{q}{2r}p^2 + p)$ will yield a uniformly distributed set of values.

The algorithm splits up the distribution into a set of "buckets", and a unique density function is needed for each bucket.

If I'm working with a normal distribution over $[0,100)$ with $\mu=65$ and $\sigma=10$, split into buckets $[0,40)$, $[40, 65)$, $[65, 80)$, and $[80,100)$, how can I produce a density function for each bucket?

share|cite|improve this question

Your Answer


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

Browse other questions tagged or ask your own question.