X-Git-Url: https://git.njae.me.uk/?a=blobdiff_plain;f=cipherbreak.py;h=3993a42b5b8f786e9352160032389ac5ae58d476;hb=49dc272d2fc91e7340e56e9e7b96da6ab63514bb;hp=7c27216daf0be2d680168302ecb1f379b65c8fdd;hpb=1635c5915dc678efd90fffc5cb01c8f4bede9f47;p=cipher-tools.git diff --git a/cipherbreak.py b/cipherbreak.py index 7c27216..3993a42 100644 --- a/cipherbreak.py +++ b/cipherbreak.py @@ -2,11 +2,15 @@ import string import collections import norms import logging -from itertools import zip_longest, cycle -from segment import segment, Pwords +from itertools import zip_longest, cycle, permutations +from segment import segment from multiprocessing import Pool +from math import log10 + +import matplotlib.pyplot as plt from cipher import * +from language_models import * # To time a run: # @@ -15,32 +19,6 @@ from cipher import * # timeit.timeit('keyword_break(c5a)', setup='gc.enable() ; from __main__ import c5a ; from cipher import keyword_break', number=1) # timeit.repeat('keyword_break_mp(c5a, chunksize=500)', setup='gc.enable() ; from __main__ import c5a ; from cipher import keyword_break_mp', repeat=5, number=1) - -english_counts = collections.defaultdict(int) -with open('count_1l.txt', 'r') as f: - for line in f: - (letter, count) = line.split("\t") - english_counts[letter] = int(count) -normalised_english_counts = norms.normalise(english_counts) - -english_bigram_counts = collections.defaultdict(int) -with open('count_2l.txt', 'r') as f: - for line in f: - (bigram, count) = line.split("\t") - english_bigram_counts[bigram] = int(count) -normalised_english_bigram_counts = norms.normalise(english_bigram_counts) - -english_trigram_counts = collections.defaultdict(int) -with open('count_3l.txt', 'r') as f: - for line in f: - (trigram, count) = line.split("\t") - english_trigram_counts[trigram] = int(count) -normalised_english_trigram_counts = norms.normalise(english_trigram_counts) - - -with open('words.txt', 'r') as f: - keywords = [line.rstrip() for line in f] - transpositions = collections.defaultdict(list) for word in keywords: transpositions[transpositions_of(word)] += [word] @@ -77,36 +55,39 @@ def frequencies(text): # counts[c] += 1 #return counts return collections.Counter(c for c in text) -letter_frequencies = frequencies +def frequency_compare(text, target_frequency, frequency_scaling, metric): + counts = frequency_scaling(frequencies(text)) + return -1 * metric(target_frequency, counts) -def caesar_break(message, - metric=norms.euclidean_distance, - target_counts=normalised_english_counts, - message_frequency_scaling=norms.normalise): +def euclidean_compare(text): + return frequency_compare(text, norms.euclidean_scale(english_counts), + norms.euclidean_scale, norms.euclidean_distance) + + +def caesar_break(message, fitness=Pletters): """Breaks a Caesar cipher using frequency analysis >>> caesar_break('ibxcsyorsaqcheyklxivoexlevmrimwxsfiqevvmihrsasrxliwyrh' \ 'ecjsppsamrkwleppfmergefifvmhixscsymjcsyqeoixlm') # doctest: +ELLIPSIS - (4, 0.080345432737...) + (4, -130.849890899...) >>> caesar_break('wxwmaxdgheetgwuxztgptedbgznitgwwhpguxyhkxbmhvvtlbhgtee' \ 'raxlmhiixweblmxgxwmhmaxybkbgztgwztsxwbgmxgmert') # doctest: +ELLIPSIS - (19, 0.11189290326...) + (19, -128.82516920...) >>> caesar_break('yltbbqnqnzvguvaxurorgenafsbezqvagbnornfgsbevpnaabjurer' \ 'svaquvzyvxrnznazlybequrvfohgriraabjtbaruraprur') # doctest: +ELLIPSIS - (13, 0.08293968842...) + (13, -126.25233502...) """ sanitised_message = sanitise(message) best_shift = 0 - best_fit = float("inf") + best_fit = float('-inf') for shift in range(26): plaintext = caesar_decipher(sanitised_message, shift) - counts = message_frequency_scaling(letter_frequencies(plaintext)) - fit = metric(target_counts, counts) + fit = fitness(plaintext) logger.debug('Caesar break attempt using key {0} gives fit of {1} ' 'and decrypt starting: {2}'.format(shift, fit, plaintext[:50])) - if fit < best_fit: + if fit > best_fit: best_fit = fit best_shift = shift logger.info('Caesar break best fit: key {0} gives fit of {1} and ' @@ -124,8 +105,8 @@ def affine_break(message, 'omytd jlaxe mh jm bfmibj umis hfsul axubafkjamx. ls kffkxwsd jls ' \ 'ofgbjmwfkiu olfmxmtmwaokttg jlsx ls kffkxwsd jlsi zg tsxwjl. jlsx ' \ 'ls umfjsd jlsi zg hfsqysxog. ls dmmdtsd mx jls bats mh bkbsf. ls ' \ - 'bfmctsd kfmyxd jls lyj, mztanamyu xmc jm clm cku tmmeaxw kj lai kxd ' \ - 'clm ckuxj.') # doctest: +ELLIPSIS + 'bfmctsd kfmyxd jls lyj, mztanamyu xmc jm clm cku tmmeaxw kj lai ' \ + 'kxd clm ckuxj.') # doctest: +ELLIPSIS ((15, 22, True), 0.0598745365924...) """ sanitised_message = sanitise(message) @@ -138,7 +119,7 @@ def affine_break(message, for adder in range(26): plaintext = affine_decipher(sanitised_message, multiplier, adder, one_based) - counts = message_frequency_scaling(letter_frequencies(plaintext)) + counts = message_frequency_scaling(frequencies(plaintext)) fit = metric(target_counts, counts) logger.debug('Affine break attempt using key {0}x+{1} ({2}) ' 'gives fit of {3} and decrypt starting: {4}'. @@ -175,7 +156,7 @@ def keyword_break(message, for wrap_alphabet in range(3): for keyword in wordlist: plaintext = keyword_decipher(message, keyword, wrap_alphabet) - counts = message_frequency_scaling(letter_frequencies(plaintext)) + counts = message_frequency_scaling(frequencies(plaintext)) fit = metric(target_counts, counts) logger.debug('Keyword break attempt using key {0} (wrap={1}) ' 'gives fit of {2} and decrypt starting: {3}'.format( @@ -218,7 +199,7 @@ def keyword_break_mp(message, def keyword_break_worker(message, keyword, wrap_alphabet, metric, target_counts, message_frequency_scaling): plaintext = keyword_decipher(message, keyword, wrap_alphabet) - counts = message_frequency_scaling(letter_frequencies(plaintext)) + counts = message_frequency_scaling(frequencies(plaintext)) fit = metric(target_counts, counts) logger.debug('Keyword break attempt using key {0} (wrap={1}) gives fit of ' '{2} and decrypt starting: {3}'.format(keyword, @@ -256,64 +237,6 @@ def scytale_break(message, sanitise(scytale_decipher(message, best_key))[:50])) return best_key, best_fit -def column_transposition_break(message, - translist=transpositions, - metric=norms.euclidean_distance, - target_counts=normalised_english_bigram_counts, - message_frequency_scaling=norms.normalise): - """Breaks a column transposition cipher using a dictionary and - n-gram frequency analysis - - >>> column_transposition_break(column_transposition_encipher(sanitise( \ - "It is a truth universally acknowledged, that a single man in \ - possession of a good fortune, must be in want of a wife. However \ - little known the feelings or views of such a man may be on his \ - first entering a neighbourhood, this truth is so well fixed in the \ - minds of the surrounding families, that he is considered the \ - rightful property of some one or other of their daughters."), \ - 'encipher'), \ - translist={(2, 0, 5, 3, 1, 4, 6): ['encipher'], \ - (5, 0, 6, 1, 3, 4, 2): ['fourteen'], \ - (6, 1, 0, 4, 5, 3, 2): ['keyword']}) # doctest: +ELLIPSIS - ((2, 0, 5, 3, 1, 4, 6), 0.0628106372...) - >>> column_transposition_break(column_transposition_encipher(sanitise( \ - "It is a truth universally acknowledged, that a single man in \ - possession of a good fortune, must be in want of a wife. However \ - little known the feelings or views of such a man may be on his \ - first entering a neighbourhood, this truth is so well fixed in the \ - minds of the surrounding families, that he is considered the \ - rightful property of some one or other of their daughters."), \ - 'encipher'), \ - translist={(2, 0, 5, 3, 1, 4, 6): ['encipher'], \ - (5, 0, 6, 1, 3, 4, 2): ['fourteen'], \ - (6, 1, 0, 4, 5, 3, 2): ['keyword']}, \ - target_counts=normalised_english_trigram_counts) # doctest: +ELLIPSIS - ((2, 0, 5, 3, 1, 4, 6), 0.0592259560...) - """ - best_transposition = '' - best_fit = float("inf") - ngram_length = len(next(iter(target_counts.keys()))) - for transposition in translist.keys(): - if len(message) % len(transposition) == 0: - plaintext = column_transposition_decipher(message, transposition) - counts = message_frequency_scaling(frequencies( - ngrams(sanitise(plaintext), ngram_length))) - fit = metric(target_counts, counts) - logger.debug('Column transposition break attempt using key {0} ' - 'gives fit of {1} and decrypt starting: {2}'.format( - translist[transposition][0], fit, - sanitise(plaintext)[:50])) - if fit < best_fit: - best_fit = fit - best_transposition = transposition - logger.info('Column transposition break best fit with key {0} gives fit ' - 'of {1} and decrypt starting: {2}'.format( - translist[best_transposition][0], - best_fit, sanitise( - column_transposition_decipher(message, - best_transposition))[:50])) - return best_transposition, best_fit - def column_transposition_break_mp(message, translist=transpositions, @@ -323,46 +246,47 @@ def column_transposition_break_mp(message, chunksize=500): """Breaks a column transposition cipher using a dictionary and n-gram frequency analysis - - >>> column_transposition_break_mp(column_transposition_encipher(sanitise( \ - "It is a truth universally acknowledged, that a single man in \ - possession of a good fortune, must be in want of a wife. However \ - little known the feelings or views of such a man may be on his \ - first entering a neighbourhood, this truth is so well fixed in the \ - minds of the surrounding families, that he is considered the \ - rightful property of some one or other of their daughters."), \ - 'encipher'), \ - translist={(2, 0, 5, 3, 1, 4, 6): ['encipher'], \ - (5, 0, 6, 1, 3, 4, 2): ['fourteen'], \ - (6, 1, 0, 4, 5, 3, 2): ['keyword']}) # doctest: +ELLIPSIS - ((2, 0, 5, 3, 1, 4, 6), 0.0628106372...) - >>> column_transposition_break_mp(column_transposition_encipher(sanitise( \ - "It is a truth universally acknowledged, that a single man in \ - possession of a good fortune, must be in want of a wife. However \ - little known the feelings or views of such a man may be on his \ - first entering a neighbourhood, this truth is so well fixed in the \ - minds of the surrounding families, that he is considered the \ - rightful property of some one or other of their daughters."), \ - 'encipher'), \ - translist={(2, 0, 5, 3, 1, 4, 6): ['encipher'], \ - (5, 0, 6, 1, 3, 4, 2): ['fourteen'], \ - (6, 1, 0, 4, 5, 3, 2): ['keyword']}, \ - target_counts=normalised_english_trigram_counts) # doctest: +ELLIPSIS - ((2, 0, 5, 3, 1, 4, 6), 0.0592259560...) """ + # >>> column_transposition_break_mp(column_transposition_encipher(sanitise( \ + # "It is a truth universally acknowledged, that a single man in \ + # possession of a good fortune, must be in want of a wife. However \ + # little known the feelings or views of such a man may be on his \ + # first entering a neighbourhood, this truth is so well fixed in the \ + # minds of the surrounding families, that he is considered the \ + # rightful property of some one or other of their daughters."), \ + # 'encipher'), \ + # translist={(2, 0, 5, 3, 1, 4, 6): ['encipher'], \ + # (5, 0, 6, 1, 3, 4, 2): ['fourteen'], \ + # (6, 1, 0, 4, 5, 3, 2): ['keyword']}) # doctest: +ELLIPSIS + # (((2, 0, 5, 3, 1, 4, 6), False), 0.0628106372...) + # >>> column_transposition_break_mp(column_transposition_encipher(sanitise( \ + # "It is a truth universally acknowledged, that a single man in \ + # possession of a good fortune, must be in want of a wife. However \ + # little known the feelings or views of such a man may be on his \ + # first entering a neighbourhood, this truth is so well fixed in the \ + # minds of the surrounding families, that he is considered the \ + # rightful property of some one or other of their daughters."), \ + # 'encipher'), \ + # translist={(2, 0, 5, 3, 1, 4, 6): ['encipher'], \ + # (5, 0, 6, 1, 3, 4, 2): ['fourteen'], \ + # (6, 1, 0, 4, 5, 3, 2): ['keyword']}, \ + # target_counts=normalised_english_trigram_counts) # doctest: +ELLIPSIS + # (((2, 0, 5, 3, 1, 4, 6), False), 0.0592259560...) + # """ ngram_length = len(next(iter(target_counts.keys()))) with Pool() as pool: - helper_args = [(message, trans, metric, target_counts, ngram_length, + helper_args = [(message, trans, columnwise, metric, target_counts, ngram_length, message_frequency_scaling) - for trans in translist.keys()] + for trans in translist.keys() for columnwise in [True, False]] # Gotcha: the helper function here needs to be defined at the top level # (limitation of Pool.starmap) breaks = pool.starmap(column_transposition_break_worker, helper_args, chunksize) return min(breaks, key=lambda k: k[1]) +column_transposition_break = column_transposition_break_mp -def column_transposition_break_worker(message, transposition, metric, target_counts, +def column_transposition_break_worker(message, transposition, columnwise, metric, target_counts, ngram_length, message_frequency_scaling): - plaintext = column_transposition_decipher(message, transposition) + plaintext = column_transposition_decipher(message, transposition, columnwise=columnwise) counts = message_frequency_scaling(frequencies( ngrams(sanitise(plaintext), ngram_length))) fit = metric(target_counts, counts) @@ -370,7 +294,33 @@ def column_transposition_break_worker(message, transposition, metric, target_cou 'gives fit of {1} and decrypt starting: {2}'.format( transposition, fit, sanitise(plaintext)[:50])) - return transposition, fit + return (transposition, columnwise), fit + + +def transposition_break_exhaustive(message): + best_transposition = '' + best_pw = -float('inf') + for keylength in range(1, 21): + if len(message) % keylength == 0: + for transposition in permutations(range(keylength)): + for columnwise in [True, False]: + plaintext = column_transposition_decipher(message, + transposition, columnwise=columnwise) + # pw = Pwords(segment(plaintext)) + pw = sum([log10(bigram_likelihood(b, + normalised_english_bigram_counts, + normalised_english_counts)) + for b in ngrams(plaintext, 2)]) + logger.debug('Column transposition break attempt using key {0} {1} ' + 'gives fit of {2} and decrypt starting: {3}'.format( + transposition, columnwise, pw, + sanitise(plaintext)[:50])) + if pw > best_pw: + best_transposition = transposition + best_columnwise = columnwise + best_pw = pw + return (best_transposition, best_columnwise), best_pw + def vigenere_keyword_break(message, wordlist=keywords, @@ -389,7 +339,7 @@ def vigenere_keyword_break(message, best_fit = float("inf") for keyword in wordlist: plaintext = vigenere_decipher(message, keyword) - counts = message_frequency_scaling(letter_frequencies(plaintext)) + counts = message_frequency_scaling(frequencies(plaintext)) fit = metric(target_counts, counts) logger.debug('Vigenere break attempt using key {0} ' 'gives fit of {1} and decrypt starting: {2}'.format( @@ -404,11 +354,11 @@ def vigenere_keyword_break(message, vigenere_decipher(message, best_keyword))[:50])) return best_keyword, best_fit -def vigenere_keyword_break_mp(message, - wordlist=keywords, - metric=norms.euclidean_distance, - target_counts=normalised_english_counts, - message_frequency_scaling=norms.normalise, +def vigenere_keyword_break_mp(message, + wordlist=keywords, + metric=norms.euclidean_distance, + target_counts=normalised_english_counts, + message_frequency_scaling=norms.normalise, chunksize=500): """Breaks a vigenere cipher using a dictionary and frequency analysis @@ -430,7 +380,7 @@ def vigenere_keyword_break_mp(message, def vigenere_keyword_break_worker(message, keyword, metric, target_counts, message_frequency_scaling): plaintext = vigenere_decipher(message, keyword) - counts = message_frequency_scaling(letter_frequencies(plaintext)) + counts = message_frequency_scaling(frequencies(plaintext)) fit = metric(target_counts, counts) logger.debug('Vigenere keyword break attempt using key {0} gives fit of ' '{1} and decrypt starting: {2}'.format(keyword, @@ -456,7 +406,7 @@ def vigenere_frequency_break(message, sanitised_message = sanitise(message) for trial_length in range(1, 20): splits = every_nth(sanitised_message, trial_length) - key = ''.join([chr(caesar_break(s, target_counts=target_counts)[0] + ord('a')) for s in splits]) + key = ''.join([chr(caesar_break(s)[0] + ord('a')) for s in splits]) plaintext = vigenere_decipher(sanitised_message, key) counts = message_frequency_scaling(frequencies(plaintext)) fit = metric(target_counts, counts) @@ -471,6 +421,49 @@ def vigenere_frequency_break(message, vigenere_decipher(message, best_key))[:50])) return best_key, best_fit +def beaufort_frequency_break(message, + metric=norms.euclidean_distance, + target_counts=normalised_english_counts, + message_frequency_scaling=norms.normalise): + """Breaks a Beaufort cipher with frequency analysis + + >>> beaufort_frequency_break(beaufort_encipher(sanitise("It is time to " \ + "run. She is ready and so am I. I stole Daniel's pocketbook this " \ + "afternoon when he left his jacket hanging on the easel in the " \ + "attic."), 'florence')) # doctest: +ELLIPSIS + ('florence', 0.077657073...) + """ + best_fit = float("inf") + best_key = '' + sanitised_message = sanitise(message) + for trial_length in range(1, 20): + splits = every_nth(sanitised_message, trial_length) + key = ''.join([chr(caesar_break(s)[0] + ord('a')) for s in splits]) + plaintext = beaufort_decipher(sanitised_message, key) + counts = message_frequency_scaling(frequencies(plaintext)) + fit = metric(target_counts, counts) + logger.debug('Beaufort key length of {0} ({1}) gives fit of {2}'. + format(trial_length, key, fit)) + if fit < best_fit: + best_fit = fit + best_key = key + logger.info('Beaufort break best fit with key {0} gives fit ' + 'of {1} and decrypt starting: {2}'.format(best_key, + best_fit, sanitise( + beaufort_decipher(message, best_key))[:50])) + return best_key, best_fit + + + +def plot_frequency_histogram(freqs, sort_key=None): + x = range(len(freqs.keys())) + y = [freqs[l] for l in sorted(freqs.keys(), key=sort_key)] + f = plt.figure() + ax = f.add_axes([0.1, 0.1, 0.9, 0.9]) + ax.bar(x, y, align='center') + ax.set_xticks(x) + ax.set_xticklabels(sorted(freqs.keys(), key=sort_key)) + f.show() if __name__ == "__main__":