Tag Info

Hot answers tagged

5

The feasibility depends a lot on the length of the corpus. The more statistics, the better guesses an attacker would be able to make. He'll try to use statistical attacks to fit the frequency curve of the tokens to the frequency curve of English words. This will allow him to guess the preimages of more frequent words with high confidence, but will he be ...


4

This sounds like a classic codebook or nomenclator. Even if we assume a perfect random oracle that generates a completely random codeword for each word of English text, I agree with otus that frequency attacks and N-grams would likely be able to decode the most-frequently-used words. Also, a known-plaintext attack (or worse, a chosen-plaintext attack) would ...


2

Provided the text was long enough and used an simple codebook substitution cipher, absolutely. English has common bigrams and trigrams as well as words that are typically positioned in certain places in sentences, like The. Also, if punctuation was tokenized in the codebook, it would be incredibly easy to guess or identify . and ,, because those will be ...


1

Such a scheme would have two effects against an attacker trying to analyze the frequency of words and word combinations: They would need more samples to differentiate between two tokens at the same level of confidence. For two different tokens with similar frequency they would no longer know that the words differ. The first means you are making the ...



Only top voted, non community-wiki answers of a minimum length are eligible