1

Let’s say there’s a language that has all the letters of the alphabet evenly distributed.

Is this language then secure against frequency-analysis or could there still be some soft of weakness, i.e. by using too short keys?

AleksanderCH
  • 6,435
  • 10
  • 29
  • 62

1 Answers1

2

Substitution cipher (e.g., Caesar) and polyalphabetic substitution cipher (e.g., Vigenere) are deterministic encryption schemes. The same plaintext will always result in the same ciphertext. So, they are not secure in the sense of indistinguishability under chosen plaintext attack (IND-CPA).

It may be possible that "all the letters of the alphabet are evenly distributed", but it is very unlikely that all the 2-grams, 3-grams, etc., are evenly distributed (because some of them may be meaningless in the language). In this case, the frequency analysis can still work.

Shan Chen
  • 2,715
  • 1
  • 12
  • 17
  • 1
    What’s 2-grams, etc.? Sadly Google only returned the price for weed when I tried to search this (cries cryptographically) – AleksanderCH Sep 08 '18 at 21:10
  • 1
    @AleksanderRassasse In general, an n-gram is a contiguous sequence of n letters. For instance, here are some 2-grams in English: is, as, he, my. – Shan Chen Sep 08 '18 at 21:17