Merge branch 'simulated-annealing-testing'

[cipher-tools.git] / cipher / keyword_cipher.py

diff --git a/cipher/keyword_cipher.py b/cipher/keyword_cipher.py
index fc8eb1c6847b11dc2a2ea29c40e0934776c84c1c..a135c2b0489f14e8d6835a716fbe7bfb611f8739 100644 (file)
--- a/cipher/keyword_cipher.py
+++ b/cipher/keyword_cipher.py
@@ -6,6 +6,8 @@ from support.utilities import *
 from support.language_models import *
 
 from logger import logger
+import logging
+# logger.setLevel(logging.DEBUG)
 
 
 class KeywordWrapAlphabet(Enum):
@@ -160,13 +162,15 @@ def monoalphabetic_break_hillclimbing(message,
                               max_iterations=20000,
                               plain_alphabet=None, 
                               cipher_alphabet=None, 
-                              fitness=Ptrigrams, chunksize=1):
+                              swap_index_finder=None,
+                              fitness=Pletters, chunksize=1):
     return simulated_annealing_break(message, 
                               workers=1, 
                               initial_temperature=0,
                               max_iterations=max_iterations,
                               plain_alphabet=plain_alphabet, 
                               cipher_alphabet=cipher_alphabet, 
+                              swap_index_finder=swap_index_finder,
                               fitness=fitness, chunksize=chunksize)
 
 
@@ -175,21 +179,30 @@ def monoalphabetic_break_hillclimbing_mp(message,
                               max_iterations=20000,
                               plain_alphabet=None, 
                               cipher_alphabet=None, 
-                              fitness=Ptrigrams, chunksize=1):
+                              swap_index_finder=None,
+                              fitness=Pletters, chunksize=1):
     return simulated_annealing_break(message, 
                               workers=workers, 
                               initial_temperature=0,
                               max_iterations=max_iterations,
                               plain_alphabet=plain_alphabet, 
                               cipher_alphabet=cipher_alphabet, 
+                              swap_index_finder=swap_index_finder,
                               fitness=fitness, chunksize=chunksize)
 
 
+def gaussian_swap_index(a):
+    return (a + int(random.gauss(0, 4))) % 26
+
+def uniform_swap_index(a):
+    return random.randrange(26)
+
 def simulated_annealing_break(message, workers=10, 
                               initial_temperature=200,
                               max_iterations=20000,
                               plain_alphabet=None, 
                               cipher_alphabet=None, 
+                              swap_index_finder=None,
                               fitness=Ptrigrams, chunksize=1):
     worker_args = []
     ciphertext = sanitise(message)
@@ -211,7 +224,9 @@ def simulated_annealing_break(message, workers=10,
         #     random.shuffle(cipher_alphabet)
         #     cipher_alphabet = cat(cipher_alphabet)
         worker_args.append((ciphertext, used_plain_alphabet, used_cipher_alphabet, 
-                            initial_temperature, max_iterations, fitness))
+                            swap_index_finder,
+                            initial_temperature, max_iterations, fitness,
+                            i))
     with multiprocessing.Pool() as pool:
         breaks = pool.starmap(simulated_annealing_break_worker,
                               worker_args, chunksize)
@@ -219,7 +234,9 @@ def simulated_annealing_break(message, workers=10,
 
 
 def simulated_annealing_break_worker(message, plain_alphabet, cipher_alphabet, 
-                                     t0, max_iterations, fitness):
+                                     swap_index_finder,
+                                     t0, max_iterations, fitness,
+                                     logID):
     def swap(letters, i, j):
         if i > j:
             i, j = j, i
@@ -246,7 +263,8 @@ def simulated_annealing_break_worker(message, plain_alphabet, cipher_alphabet,
     # print('starting for', max_iterations)
     for i in range(max_iterations):
         swap_a = random.randrange(26)
-        swap_b = (swap_a + int(random.gauss(0, 4))) % 26
+        # swap_b = (swap_a + int(random.gauss(0, 4))) % 26
+        swap_b = swap_index_finder(swap_a)
         alphabet = swap(current_alphabet, swap_a, swap_b)
         cipher_translation = ''.maketrans(alphabet, plain_alphabet)
         plaintext = message.translate(cipher_translation)
@@ -271,13 +289,13 @@ def simulated_annealing_break_worker(message, plain_alphabet, cipher_alphabet,
             best_fitness = current_fitness
             best_plaintext = plaintext
         if i % 500 == 0:
-            logger.debug('Simulated annealing: iteration {}, temperature {}, '
-                'current alphabet {}, current_fitness {}, '
-                'best_plaintext {}'.format(i, temperature, current_alphabet, 
+            logger.debug('Simulated annealing worker {}: iteration {}, temperature {}, '
+                'current alphabet {}, plain alphabet {}, current_fitness {}, '
+                'best_plaintext {}'.format(logID, i, temperature, current_alphabet, plain_alphabet,
                 current_fitness, plaintext[:50]))
         temperature = max(temperature - dt, 0.001)
 
     return best_alphabet, best_fitness # current_alphabet, current_fitness
 
 if __name__ == "__main__":
-    import doctest
\ No newline at end of file
+    import doctest