New answers tagged

3 votes

Doing OTP two or more times with a biased TRNG: Will this have the same security as if was done with a non-biased TRNG?

Pretty much yes. Many TRNG designs are based entirely on digital circuitry, and do not involve any analogue components [see note]. It makes them simpler to incorporate on silicon. But unfortunately ...
user avatar
  • 13.8k
8 votes

Doing OTP two or more times with a biased TRNG: Will this have the same security as if was done with a non-biased TRNG?

The convergence of your suggested process towards unbiased bits is guided by the Piling Up Lemma. It will be slow. It is more efficient to use unbiasing procedures such as von Neumann unbiasing. See ...
user avatar
  • 16.1k
10 votes
Accepted

Doing OTP two or more times with a biased TRNG: Will this have the same security as if was done with a non-biased TRNG?

Better than using it once, but not as good as an unbiased TRNG. To see this, suppose our TRNG is very biased, producing a zero 10% of the time and an one 90% of the time. If we use the TRNG twice, for ...
user avatar
  • 1,370
0 votes

What is the Work Factor of the one time pad?

The OTP is not quite a cipher per the modern definition of that, which requires ability to encrypt several messages with the same key. Also, Work Factor is defined only for feasible tasks. Thus there'...
user avatar
  • 122k
0 votes

Compute OTP key if set of plain texts and its set of cipher texts are known

Given we have the sets $P$ and $C$, to find $k$, we need only find (one of) the pairs $(p,c)\in P \times C$ s.t. $p \oplus k = c$, as with this pair, $k$ is trivial to compute. First, we can note the ...
user avatar
  • 36

Top 50 recent answers are included