New answers tagged

0

If an attacker knows the ciphertexts, then they can XOR two ciphertexts together to know the result of XORing two plaintexts together. If the plaintexts had predictable content, then the obvious next step for the attacker is to do crib-dragging, but they can't if the plaintexts themselves are purely random. However, that's not the only way this knowledge is ...


6

You've constructed a (somewhat artificial) special case where what you call the "plaintexts" also meet the requisites that one-time pad keys are supposed to meet: Secret Chosen uniformly at random Never reused So we can analyze this by flipping the labels, so that we regard what you label the "key" and the "plaintexts" the other way around, and the ...


Top 50 recent answers are included