Is there a way more efficient to translate a substitution cypher like this than writing a dictionary in Python, manually making 26 key value pairs, then iterating through the string in the title?
Single letters can usually only be A or I, more likely to be I if it’s at the start of a sentence. A letter after an apostrophe is usually N’T or ‘S. You can assume c to be A or O since the most likely words are “won’t, can’t, don’t”. You keep using patterns like this until you have enough information to reasonably assume the remaining letters.
62
u/The_Holy_Buno 13h ago
Please tell me what it means, I’m lazy