# How to verify most appropriate cleartext?

So basically I was implementing a decryption tool (just for fun) and the first encryption logic I decided to implement was Caesar Cipher. So if I have the input as cvggbmp and I have to find what the cleartext is, I would pass this through the decrypt function 26 times. I get 26 outputs. Is there some way I match each of these outputs against a words.txt for like legible word density and then display the output with the most number of legible words ? Or is there a better optimized way to do this ?

• In GNU development tools, there is a strings command that is very helpful for such cases, though for Shift Cipher this is more costly than just printing and looking at all possible outputs. Note that the key in the Caesar cipher is fixed. The shift cipher has all possible shifts in which one may exclude the identity! Caesar cipher is a shift cipher with the key is fixed to 3. – kelalaka May 17 at 9:49
• I was of the understanding that Caesar Cipher is where we shift each character by n. Thanks for clarifying anyways. – Aritro Shome May 17 at 10:05
• @kelalaka is there some sort of a dictionary ( not dict data structure) using which I can compare whether a word is a legible english word or gibberish ? – Aritro Shome May 17 at 10:06
• Little search? github.com/dwyl/english-words – kelalaka May 17 at 10:15
• @kelakala thanks. GitHub wasn't opening on my device. Now it is ok. – Aritro Shome May 17 at 11:28