Post by kf on Jul 20, 2022 5:59:02 GMT -5
1) Just how short can the keytext of a book cipher be without risking quick decryption?
2) Also, assuming for the sake of argument that the two undeciphered ciphers in the Beale Papers are genuine, will it be possible for a quantum computer to crack them both? Simon Singh in 'The Code Book' mentions that the one-time pad will be the only form of encryption to remain proof against quantum computing - the inference being that this unbreakability doesn't apply to book ciphers. Unfortunately Mr Singh doesn't go on to explain why book ciphers would succumb to this form of quantum-based cryptoanalysis, which is the central question for me.
Many thanks
KF