Score:0

Breaking vigenere cypher using the one-time pad flaw when used for a second time

cn flag

I got an idea which may be wrong because I may have missed some important factor but for the moment I don't know if I really did. Let BM be the method used to break a reused one-time pad cipher (which is explained here : Taking advantage of one-time pad key reuse? ). I was wondering if we can use the same BM on a vigenere cipher text after determining the key lenght (N for example), and that would be by dividing the encrypted text to many sub-texts with lenghts equal to N. This way we will have many one-time pad cipher texts encrypted using the same key (which is more useful in the BM use) and at this point we can apply BM to recover the key knowing that the texts will be smaller than a normal one-time pad encrypted text which will make it even easier to break.
I hope I could clarify the idea for you and that you'll tell me if there's anything that would make it non practical. Thanks

mangohost

Post an answer

Most people don’t grasp that asking a lot of questions unlocks learning and improves interpersonal bonding. In Alison’s studies, for example, though people could accurately recall how many questions had been asked in their conversations, they didn’t intuit the link between questions and liking. Across four studies, in which participants were engaged in conversations themselves or read transcripts of others’ conversations, people tended not to realize that question asking would influence—or had influenced—the level of amity between the conversationalists.