testovani variant jakobsenova algoritmu

diff --git a/jakobsen.py b/jakobsen.py
index 9b7c0eb..2e2caf1 100644 (file)
--- a/jakobsen.py
+++ b/jakobsen.py
@@ -93,3 +93,9 @@ def desifruj(zprava, mezery=True):
     return '\n'.join([''.join(substituce(zprava, slovnik)),
                       ' '.join(ref.abeceda),
                       ' '.join([slovnik[c] for c in ref.abeceda])])
     return '\n'.join([''.join(substituce(zprava, slovnik)),
                       ' '.join(ref.abeceda),
                       ' '.join([slovnik[c] for c in ref.abeceda])])

+
+def __test():
+    print desifruj('Mxbhfxn cbfbhinpr, wnx fv f gvzuyr cbenqv.'.upper())
+
+def __test2():
+    print desifruj('Sel pes do lesa a potkal dlazebni kostku. Chtelo by to jeste o neco delsi test, to tedy jo.'.upper())

diff --git a/jakobsen1.py b/jakobsen1.py
new file mode 100644 (file)
index 0000000..799559b
--- /dev/null
+++ b/jakobsen1.py
@@ -0,0 +1,126 @@
+"""Modul pro praci s Jakobsenovym algoritmem."""
+
+from itertools import combinations
+import pickle
+from ocesavac import ocesat
+from spolecne import MABECEDA
+
+def nova_tabulka(zprava, abc=MABECEDA):
+    """Vraci tabulku cetnosti bigramu ve zprave nad danou abecedou."""
+    tabulka = dict()
+    for i in abc:
+        tabulka[i] = dict()
+        for j in abc:
+            tabulka[i][j] = 0
+    for i in range(len(zprava) - 1):
+        tabulka[zprava[i]][zprava[i+1]] += 1
+    celkem = sum(sum(tab2.values()) for tab2 in tabulka.values())
+    for i in abc:
+        for j in abc:
+            tabulka[i][j] /= float(celkem)
+    return tabulka
+
+def vzdalenost(tab1, tab2, abc=MABECEDA):
+    """Vraci soucet strednich kvadratickych odchylek pro dve tabulky cetnosti
+    bigramu nad danou abecedou."""
+    rozdil = 0
+    for i in abc:
+        for j in abc:
+            rozdil += abs(tab1[i][j] - tab2[i][j])
+    return rozdil
+
+def vzdalenost2(tab1, tab2):
+    """Vraci soucet strednich kvadratickych odchylek pro dve tabulky cetnosti
+    bigramu nad danou abecedou."""
+    rozdil = 0
+    for i in range(len(tab1)):
+        for j in range(len(tab1)):
+            rozdil += abs(tab1[i][j] - tab2[i][j])
+    return rozdil
+
+def substituce(zprava, slovnik, abc=MABECEDA):
+    """Vrati zpravu, ve ktere jsou znaky dane abecedy nahrazenypodle daneho
+    slovniku."""
+    pole = []
+    for char in zprava:
+        if char in abc:
+            pole.append(slovnik[char])
+        else:
+            pole.append(char)
+    return pole
+
+def poradi_dle_frekvence(zprava, abc=MABECEDA):
+    """Vrati znaky dane abecedy v poradi podle frekvence v dane zprave."""
+    freq = dict()
+    for char in abc:
+        freq[char] = 0
+    for char in zprava:
+        if char in abc:
+            freq[char] += 1
+    return sorted(freq.keys(), key=freq.get, reverse=True)
+
+class reference:
+    pass
+
+def prohod(sl_a, sl_b, tabulka):
+    """Vrati tabulku s prohozenou dvojici sloupcu a radku."""
+    tabulka[sl_a], tabulka[sl_b] = tabulka[sl_b], tabulka[sl_a]
+    for c in tabulka.keys():
+        tabulka[c][sl_a], tabulka[c][sl_b] = tabulka[c][sl_b], tabulka[c][sl_a]
+    return
+
+def prohod2(sl_a, sl_b, tabulka):
+    """Vrati tabulku s prohozenou dvojici sloupcu a radku."""
+    tabulka[sl_a], tabulka[sl_b] = tabulka[sl_b], tabulka[sl_a]
+    for c in range(len(tabulka)):
+        tabulka[c][sl_a], tabulka[c][sl_b] = tabulka[c][sl_b], tabulka[c][sl_a]
+    return
+
+def dicty_na_listy(tabulka, abeceda):
+    listy = []
+    for a in abeceda:
+        listy.append([tabulka[a][b] for b in abeceda])
+    return listy
+
+def jakobsen(zprava, ref):
+    """Pro danou sifrovanou zpravu vrati substitucni slovnik odvozeny s pomoci
+    Jakobsenova algoritmu s danou referencni tabulkou."""
+    slovnik = poradi_dle_frekvence(zprava, ref.abeceda)
+    tab = nova_tabulka(zprava, ref.abeceda)
+    
+    tabulka = dicty_na_listy(tab, slovnik)
+    reftab = dicty_na_listy(ref.tabulka, ref.poradi)    
+ 
+    vzdal = vzdalenost2(tabulka, reftab)
+    
+    vzdal_old = vzdal + 1
+    while vzdal_old > vzdal:
+        vzdal_old = vzdal
+        for (x, y) in combinations(range(len(ref.abeceda)), 2):
+            prohod2(x, y, tabulka)
+            nova_vzdalenost = vzdalenost2(tabulka, reftab)
+            if nova_vzdalenost < vzdal:
+                vzdal = nova_vzdalenost
+                slovnik[x], slovnik[y] = slovnik[y], slovnik[x]
+            else:
+                prohod2(x, y, tabulka)
+    return dict(zip(slovnik, ref.poradi))
+    
+def desifruj(zprava, mezery=True):
+    """Vrati vysledek pokusu dekodovat zpravu Jakobsenovym algoritmem."""
+    if mezery:
+        soubor = open('ref')
+    else:
+        soubor = open('bref')
+    ref = pickle.load(soubor)
+    soubor.close()
+    slovnik = jakobsen(ocesat(zprava, mezery), ref)
+    return '\n'.join([''.join(substituce(zprava, slovnik, ref.abeceda)),
+                      ' '.join(ref.abeceda),
+                      ' '.join([slovnik[c] for c in ref.abeceda])])
+
+def __test():
+    print desifruj('Mxbhfxn cbfbhinpr, wnx fv f gvzuyr cbenqv.'.upper())
+
+def __test2():
+    print desifruj('Sel pes do lesa a potkal dlazebni kostku. Chtelo by to jeste o neco delsi test, to tedy jo.'.upper())

diff --git a/jakobsen2.py b/jakobsen2.py
new file mode 100644 (file)
index 0000000..c4f82bc
--- /dev/null
+++ b/jakobsen2.py
@@ -0,0 +1,101 @@
+"""Modul pro praci s Jakobsenovym algoritmem."""
+
+from itertools import combinations
+import pickle
+from ocesavac import ocesat
+from spolecne import MABECEDA
+
+def nova_tabulka(zprava, abc=MABECEDA):
+    """Vraci tabulku cetnosti bigramu ve zprave nad danou abecedou."""
+    tabulka = dict()
+    for i in abc:
+        tabulka[i] = dict()
+        for j in abc:
+            tabulka[i][j] = 0
+    for i in range(len(zprava) - 1):
+        tabulka[zprava[i]][zprava[i+1]] += 1
+    celkem = sum(sum(tab2.values()) for tab2 in tabulka.values())
+    for i in abc:
+        for j in abc:
+            tabulka[i][j] /= float(celkem)
+    return tabulka
+
+def vzdalenost(tab1, tab2, abc=MABECEDA):
+    """Vraci soucet strednich kvadratickych odchylek pro dve tabulky cetnosti
+    bigramu nad danou abecedou."""
+    rozdil = 0
+    for i in abc:
+        for j in abc:
+            rozdil += abs(tab1[i][j] - tab2[i][j])
+    return rozdil
+
+def substituce(zprava, slovnik, abc=MABECEDA):
+    """Vrati zpravu, ve ktere jsou znaky dane abecedy nahrazenypodle daneho
+    slovniku."""
+    pole = []
+    for char in zprava:
+        if char in abc:
+            pole.append(slovnik[char])
+        else:
+            pole.append(char)
+    return pole
+
+def poradi_dle_frekvence(zprava, abc=MABECEDA):
+    """Vrati znaky dane abecedy v poradi podle frekvence v dane zprave."""
+    freq = dict()
+    for char in abc:
+        freq[char] = 0
+    for char in zprava:
+        if char in abc:
+            freq[char] += 1
+    return sorted(freq.keys(), key=freq.get, reverse=True)
+
+class reference:
+    pass
+
+def prohod(sl_a, sl_b, tabulka):
+    """Vrati tabulku s prohozenou dvojici sloupcu a radku."""
+    tabulka[sl_a], tabulka[sl_b] = tabulka[sl_b], tabulka[sl_a]
+    for c in tabulka.keys():
+        tabulka[c][sl_a], tabulka[c][sl_b] = tabulka[c][sl_b], tabulka[c][sl_a]
+    return
+
+def jakobsen(zprava, ref):
+    """Pro danou sifrovanou zpravu vrati substitucni slovnik odvozeny s pomoci
+    Jakobsenova algoritmu s danou referencni tabulkou."""
+    slovnik = dict(zip(ref.abeceda, ref.abeceda))
+    tabulka = nova_tabulka(zprava, ref.abeceda)
+    vzdal = vzdalenost(tabulka, ref.tabulka, ref.abeceda)
+
+    vzdal_old = vzdal + 1
+    while vzdal_old > vzdal:
+        vzdal_old = vzdal
+        for (x, y) in combinations(ref.abeceda, 2):
+            prohod(x, y, tabulka)
+            nova_vzdalenost = vzdalenost(tabulka, ref.tabulka, ref.abeceda)
+            if  nova_vzdalenost < vzdal:
+                vzdal = nova_vzdalenost
+                slovnik[x], slovnik[y] = slovnik[y], slovnik[x]
+            else:
+                prohod(x, y, tabulka)
+    return slovnik
+    
+def desifruj(zprava, mezery=True):
+    """Vrati vysledek pokusu dekodovat zpravu Jakobsenovym algoritmem."""
+    if mezery:
+        soubor = open('ref')
+    else:
+        soubor = open('bref')
+    ref = pickle.load(soubor)
+    soubor.close()
+    zprava = substituce(zprava, dict(zip(poradi_dle_frekvence(zprava, ref.abeceda), ref.poradi)), ref.abeceda)
+    slovnik = jakobsen(ocesat(zprava, mezery), ref)
+    return '\n'.join([''.join(substituce(zprava, slovnik, ref.abeceda)),
+                      ' '.join(ref.abeceda),
+                      ' '.join([slovnik[c] for c in ref.abeceda])])
+
+def __test():
+    print desifruj('Mxbhfxn cbfbhinpr, wnx fv f gvzuyr cbenqv.'.upper())
+
+def __test2():
+    print desifruj('Sel pes do lesa a potkal dlazebni kostku. Chtelo by to jeste o neco delsi test, to tedy jo.'.upper())

diff --git a/test b/test
new file mode 100755 (executable)
index 0000000..00bc61d
--- /dev/null
+++ b/test
@@ -0,0 +1,5 @@
+#!/bin/bash
+
+echo "__test()" | python -i jakobsen.py
+echo "__test()" | python -i jakobsen1.py
+echo "__test()" | python -i jakobsen2.py

diff --git a/test2 b/test2
new file mode 100755 (executable)
index 0000000..e319f4a
--- /dev/null
+++ b/test2
@@ -0,0 +1,5 @@
+#!/bin/bash
+
+echo "__test2()" | python -i jakobsen.py
+echo "__test2()" | python -i jakobsen1.py
+echo "__test2()" | python -i jakobsen2.py