An OOP implementation for Caesar cipher. For more information about the caesar cipher check: https://en.wikipedia.org/wiki/Caesar_cipher
Using this code you can:
- Item 1 Encrypting a given message provided the key (shift).
- Item 2 Decrypt a message without knowing the key (shift). The code iterates through all possible shifts and return the message that has the most numbers of correct words.
File named "story" is a test of an Encrypted messaged that my code has decrypted.
python 3.x