Can I ask this question on Crypto or is it just a waste of good time and brainpower, moderator strain, and down votes to me?
If a one time pad reduced a theoretical plain text to a cipher text to all of the same number, this would be considered unbreakable under what proof? This would obviously only work if the key was secure. The idea is to add a perfect example of indistinguishably of a cipher text is if all the cipher text was a repeated number or series of numbers. Example being: attackthefortatdawn (plain text)