Compare commits

..
12 Commits
Author SHA1 Message Date
KKlochko 481735d9df Add the function that return all key combinations for a possible key vector.
continuous-integration/drone/push Build is passing
2023-11-14 21:55:29 +02:00
KKlochko d6ba958b5b Rename the function from get-possible-keys to get-all-combinations-for-blocks. 2023-11-14 21:54:38 +02:00
KKlochko d1b2ddc351 Add a function to get all permutations for a block.
continuous-integration/drone/push Build is passing
2023-11-13 20:53:07 +02:00
KKlochko 6a1ecf93db Add a function to get the ordered sequence that can form a key.
continuous-integration/drone/push Build is passing
2023-11-12 21:51:42 +02:00
KKlochko c03dc68458 Add a function to convert a count map to a reversed map. 2023-11-12 21:50:02 +02:00
KKlochko 2cc5be57c8 Add functions to get possible keys.
continuous-integration/drone/push Build is passing
2023-11-11 15:21:16 +02:00
KKlochko ddfd5c473d Add the default frequency factory.
continuous-integration/drone/push Build is passing
2023-11-03 20:33:23 +02:00
KKlochko fcae272944 Add key validation for Caesar and Gamma ciphers.
continuous-integration/drone/push Build is passing
2023-11-01 15:07:13 +02:00
KKlochko 1e45771b3e Add key? to check if a string is a gamma key. 2023-11-01 15:05:08 +02:00
KKlochko e145382570 Add int-string? to check if a string is a number.
continuous-integration/drone/push Build is passing
2023-11-01 15:02:44 +02:00
KKlochko 91dc00ea0d Rename unsigned-int? to unsigned-int-string? 2023-11-01 15:01:22 +02:00
KKlochko 0261c97d76 Add the option for the gamma cipher.
continuous-integration/drone/push Build is passing
2023-10-31 16:50:25 +02:00
15 changed files with 207 additions and 10 deletions
+2 -1
View File
@@ -7,7 +7,8 @@
[org.clojure/tools.cli "1.0.219"]
[org.apache.tika/tika-core "1.28.5"]
[org.apache.tika/tika-langdetect "1.28.5"]
[cheshire "5.12.0"]]
[cheshire "5.12.0"]
[org.clojure/math.combinatorics "0.2.0"]]
:main ^:skip-aot cipher-analytical-machine.core
:java-source-paths ["src/main/java"]
:target-path "target/%s"
@@ -11,6 +11,16 @@
(inc (get acc val 0))))
{} text))
(defn reverse-count-characters
"Convert a map of pairs to a map where the characters grouped by the count and a count is the key."
[count-map]
(reduce
(fn [acc [symbol count]]
(->> (conj (get acc count []) symbol)
(into [])
(assoc acc count)))
{} count-map))
(defn chi-squared-letter-statistic
"To calculate the frequency distribution of a letter."
[letter-count letter-frequence length-text]
@@ -0,0 +1,44 @@
(ns cipher-analytical-machine.analyzers.simple-substitution
(:require [clojure.string :as cs]
[clojure.math.combinatorics :as comb]
[cipher-analytical-machine.ciphers.simple-substitution :as ss]
[cipher-analytical-machine.analyzers.analyzers :as analyzers]
[cipher-analytical-machine.analyzers.caesar :as caesar])
(:gen-class))
(defn get-possible-key-vector
"Convert a possible key map to a vector of possible keys. For example, if you have a map: {\\a [\\a \\b \\c] \\b [\\b \\c] \\c [\\a \\c]}, then the vector is [[\\a \\b \\c] [\\b \\c] [\\a \\c]]."
[possible-key-map symbols]
(reduce
(fn [acc el]
(conj acc (get possible-key-map el)))
[] symbols))
(defn get-possible-key-vector-from-reversed-count-map
"Convert a reversed count map to a vector. Example, from {2 [\\a \\b] 1 [\\d] 3 [\\e]} to [[\\e] [\\a \\b] [\\d]])."
[reversed-count-map]
(->> reversed-count-map
(into [])
(sort-by #(- (first %)))
(map second)
(into [])))
(defn get-all-permutation-for-block
"Return a vector for all possible blocks that can be made from a vector of symbols."
[symbols]
(->> (comb/permutations symbols)
(map cs/join)
(into [])))
(defn get-all-combinations-for-blocks
"Return the all combination of blocks in a possible key vector. For example, if you have a map: {\\a [\\a \"bf\" \\c] \\b [\"bf\" \\c] \\c [\\a \\c]}, then the vector is [[\\a \"bf\" \\c] [\"bf\" \\c] [\\a \\c]] and keys (\"abfa\" \"abfc\" ...)."
[possible-key-vector]
(->> (apply comb/cartesian-product possible-key-vector)
(map cs/join)))
(defn get-possible-key-combinations
"Return possible keys for a possible key vector. For example, if you have a map: {\\a [\\a \\b \\c] \\e [\\f \\g] \\c [\\a \\c]}, then the keys are (\"abcefg\" \"abcegf\" ...)."
[possible-key-vector]
(->> (map get-all-permutation-for-block possible-key-vector)
(get-all-combinations-for-blocks)))
@@ -9,7 +9,8 @@
(let [analyzer (:analyzer options)
message (:message options)
symbols (:symbols options)
frequencies symbol-frequencies/english-letter-frequencies]
frequencies (-> (get options :language "en")
(symbol-frequencies/default-frequency-factory))]
(cond
(= analyzer "Chi^2")
(caesar-analyzers/get-plaintext message symbols frequencies)
+11
View File
@@ -1,5 +1,7 @@
(ns cipher-analytical-machine.cli.cli
(:require
[cipher-analytical-machine.parsers.parsers :as ps]
[cipher-analytical-machine.parsers.gamma :as gamma-ps]
[cipher-analytical-machine.cli.file :as file]
[cipher-analytical-machine.symbols.factories :as sf]
[cipher-analytical-machine.cli.options :as options]
@@ -77,6 +79,15 @@
(or (contains? options :encrypt)
(contains? options :decrypt)))
(cond
(and (= (:cipher options) "Caesar")
(false? (ps/int-string? (:key options))))
{:exit-message (error-msg ["Please, use the key format: [+-](integer)!!! Example: 10, +9, -7."])}
(and (= (:cipher options) "Gamma")
(false? (gamma-ps/key? (:key options))))
{:exit-message (error-msg ["Please, use the key format: [+-](integer),[+-](integer),[+-](integer) !!! Example: 10,+9,-7."])}
(contains? options :encrypt)
{:options options :arguments arguments :action-type :encrypt}
@@ -22,7 +22,7 @@
(option-values-as-list option values)))
(def cipher-options
#{"Caesar" "Simple substitution and Caesar"})
#{"Caesar" "Simple substitution and Caesar" "Gamma"})
(def default-cipher "Caesar")
@@ -0,0 +1,9 @@
(ns cipher-analytical-machine.parsers.gamma
(:gen-class))
(defn key?
"Return true if the string is an key of three integers."
[str]
(if (re-matches #"[+-]?\b\d+\b,[+-]?\b\d+\b,[+-]?\b\d+\b" str)
true false))
@@ -2,12 +2,18 @@
(:require [cheshire.core :as cc])
(:gen-class))
(defn unsigned-int?
(defn unsigned-int-string?
"Return true if the string is an unsigned integer."
[str]
(if (re-matches #"\d+" str)
true false))
(defn int-string?
"Return true if the string is an signed integer."
[str]
(if (re-matches #"[+-]?\b\d+\b" str)
true false))
(defn parse-unsigned-int
"Return an integer if the argument is an integer."
[str-or-int]
@@ -15,7 +21,7 @@
(int? str-or-int)
str-or-int
(unsigned-int? str-or-int)
(unsigned-int-string? str-or-int)
(Integer/parseInt str-or-int)
:else
@@ -15,14 +15,14 @@
(defn decode-key
"Returns the first character if the string is a char. Return the number if the string is a number."
[str]
(if (ps/unsigned-int? str)
(if (ps/unsigned-int-string? str)
(Integer/parseInt str)
(first str)))
(defn decode-pair
"Decode a numbers as a string and a char as a string"
[acc [key value]]
(if (ps/unsigned-int? key)
(if (ps/unsigned-int-string? key)
(assoc acc (decode-key key) (decode-key value))
(assoc acc (decode-key key) value)))
@@ -38,7 +38,7 @@
(defn generate-table-or-decode-json
"It generate the table and return map with the key and the table if the argument is a key. Else it decode the json."
[key-or-json symbols]
(if (ps/unsigned-int? key-or-json)
(if (ps/unsigned-int-string? key-or-json)
(-> {"key" key-or-json}
(assoc "table" (ss/generate-substitution-table symbols)))
(decode-key-and-substitution-table-from-json key-or-json)))
@@ -77,3 +77,16 @@
\ 0.138
})
(defn default-frequency-factory
"Returns a default map of letter frequencies for a language"
[language-code]
(cond
(= language-code "en")
english-letter-frequencies
(= language-code "uk")
ukrainian-letter-frequencies
:else
english-letter-frequencies))
@@ -8,6 +8,13 @@
(is (= {\a 2 \b 1}
(count-characters "aba")))))
(deftest reverse-count-characters-test
(testing "The symbols must be grouped as a vector and the count must be a key."
(are [count-map expected-map]
(= expected-map (reverse-count-characters count-map))
{\a 1 \b 2 \c 1} {1 [\a \c] 2 [\b]}
{\a 1 \b 2 \c 3} {1 [\a] 2 [\b] 3 [\c]})))
(deftest chi-squared-letter-statistic-test
(testing "If the frequence of A is 0.1, the text length is 100 and contains 20 times, then the chi-squared is 10."
(is (= 10.0
@@ -0,0 +1,50 @@
(ns cipher-analytical-machine.analyzers.simple-substitution-test
(:require
[clojure.test :refer :all]
[cipher-analytical-machine.symbols.frequencies :as sf]
[cipher-analytical-machine.ciphers.simple-substitution :as ss]
[cipher-analytical-machine.analyzers.simple-substitution :refer :all])
(:gen-class))
(deftest get-possible-keys-vector-test
(testing "The vector must be ordered by symbols"
(are [possible-keys-map symbols expected-key-vector]
(= expected-key-vector (get-possible-key-vector possible-keys-map symbols))
{\a [\a \b] \b [\b \a] \c [\a \c]} "abc" [[\a \b] [\b \a] [\a \c]]
{\a [\a \b] \c [\b \a] \b [\a \c]} "abc" [[\a \b] [\a \c] [\b \a]])))
(deftest get-possible-key-vector-from-reversed-count-map-test
(testing "The block order must be in descending order"
(are [reversed-count-map expected-key-vector]
(= expected-key-vector (get-possible-key-vector-from-reversed-count-map reversed-count-map))
{1 [\a \c] 2 [\b]} [[\b] [\a \c]]
{2 [\a] 1 [\b] 3 [\c]} [[\c] [\a] [\b]])))
(deftest get-all-permutation-for-block-test
(testing "It must return all permutations"
(are [symbols expected-permutations]
(= expected-permutations (get-all-permutation-for-block symbols))
[\a \b] ["ab" "ba"]
[\a \b \c] ["abc" "acb" "bac" "bca" "cab" "cba"])))
(deftest get-all-combinations-for-blocks-test
(testing "The keys must be the all combinations of blocks"
(are [possible-keys-vector expected-keys]
(= expected-keys (get-all-combinations-for-blocks possible-keys-vector))
[[\a \b] [\f] [\a \c] [\g]] '("afag" "afcg" "bfag" "bfcg")
[[\a \b] [\a \c]] '("aa" "ac" "ba" "bc")
[[\a \b \c] [\a \c] [\b \c]] '("aab" "aac" "acb" "acc" "bab" "bac" "bcb" "bcc" "cab" "cac" "ccb" "ccc"))))
(deftest get-possible-key-combinations-test
(testing "The keys must be the all combinations, but the blocks must create a permutations which will be joined as a combination"
(are [possible-keys-vector expected-keys]
(= expected-keys (get-possible-key-combinations possible-keys-vector))
[[\a \b] [\f] [\e \c] [\g]] '("abfecg" "abfceg" "bafecg" "bafceg")
[[\a \b] [\a \c]] '("abac" "abca" "baac" "baca")
[[\a \b \c] [\a \c] [\b \c]] '("abcacbc" "abcaccb" "abccabc" "abccacb"
"acbacbc" "acbaccb" "acbcabc" "acbcacb"
"bacacbc" "bacaccb" "baccabc" "baccacb"
"bcaacbc" "bcaaccb" "bcacabc" "bcacacb"
"cabacbc" "cabaccb" "cabcabc" "cabcacb"
"cbaacbc" "cbaaccb" "cbacabc" "cbacacb"))))
@@ -0,0 +1,20 @@
(ns cipher-analytical-machine.parsers.gamma-test
(:require
[clojure.test :refer :all]
[cipher-analytical-machine.parsers.gamma :refer :all]))
(deftest key?-test
(testing "The function return true only if the key in the format '%d,%d,%d'."
(are [str expected]
(= expected
(key? str))
"9" false
"9,10" false
"10,9,8" true
"-10,9,-8" true
"-10,-9,-8" true
"asd 10 " false
" 10 " false
"-10" false
"abc" false)))
@@ -3,13 +3,28 @@
[clojure.test :refer :all]
[cipher-analytical-machine.parsers.parsers :refer :all]))
(deftest unsigned-int?-test
(deftest unsigned-int-string?-test
(testing "The function return true only for an unsingned integer as a string."
(are [str expected]
(= expected
(unsigned-int? str))
(unsigned-int-string? str))
"9" true
"9" true
"10" true
"asd 10 " false
" 10 " false
"-10" false
"abc" false)))
(deftest int-string?-test
(testing "The function return true only for an singned integer as a string."
(are [str expected]
(= expected
(int-string? str))
"9" true
"10" true
"-10" true
"asd -10 " false
" -10 " false
"abc" false)))
@@ -9,3 +9,13 @@
(is (= "etaoinsrhldcumfpgwybvkxjqz"
(map-to-string symbol-map))))))
(deftest default-frequency-factory-test
(testing "Factory supports languages: English (en), Ukrainian (uk). If language code is unidentified, then it must have the 'en'."
(are [language-code expected-map-size]
(->> (default-frequency-factory language-code)
count
(= expected-map-size))
"en" 26
"uk" 34
"Maybe a code" 26)))