{'fraction_non_alphanumeric': 0.01858736059479554, 'fraction_numerical': 0.007434944237918215, 'mean_word_length': 6.092105263157895, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
An Implementation of Probabilistic Relaxation in the Cryptanalysis of Simple Substitution Ciphers

Relaxation algorithms have been used successfully in the automated cryptanalysis of simple substitution ciphers [5,6,7]. This paper describes a Pascal implementation of relaxation using an adjustment formula by Shannon [8]. The formula is used to generate trigram statistics suitable for the solution of simple substitution ciphers without word divisions. Problems encountered when applying relaxation to homophonic ciphers are identified.