Can we say that any shift cipher to be decrypted needs an algorithm of complexity “
n * n!”? (where
n is number of possible values. 26 in case of English language).
My reasoning related to reaching
n * n! was as follows:
Take the word
BRAZIL for example. We have 26 possibilities for
B, 25 for
R, 24 forA
, etc. ThusO(n!)
. We also can have this 26 times, B was A now, but is a G in the next time, thus 26 which isO(n)
henceO(n * n!)`.