16-08-2026, 02:04 PM
Let me clarify a bit about why I believe that an anagrammatic permutation, with sufficient effort, is very difficult to decipher.
Somehow, I encrypted the word “apple” as 445673. You can guess that 4 = p, but it’s unclear with the other letters. First, the number of digits is 4, and there are only 3 remaining letters, so you’ll also need to figure out where the two‑digit number is hidden. Secondly, you don’t know in what order the letters are arranged — ALE, ELA, AEL, LEA, EAL?
Thus, even if I translate 445673 as “apple,” I won’t be able to decipher this word.
Somehow, I encrypted the word “apple” as 445673. You can guess that 4 = p, but it’s unclear with the other letters. First, the number of digits is 4, and there are only 3 remaining letters, so you’ll also need to figure out where the two‑digit number is hidden. Secondly, you don’t know in what order the letters are arranged — ALE, ELA, AEL, LEA, EAL?
Thus, even if I translate 445673 as “apple,” I won’t be able to decipher this word.

