Research papers - Revision history

Admin: /* 2019 */

2022-01-29T01:56:19Z

‎2019

Admin: /* 2019 */

2022-01-29T01:53:59Z

‎2019

Admin at 01:53, 29 January 2022

2022-01-29T01:53:49Z

Admin: /* pre 2000 */

2022-01-25T22:07:48Z

‎pre 2000

Admin: /* pre 2000 */

2022-01-25T22:07:08Z

‎pre 2000

Admin: /* 2000-2004 */

2021-07-27T13:35:23Z

‎2000-2004

Admin: /* 2008 */

2021-07-09T14:10:22Z

‎2008

Admin: /* 2017 */

2021-07-09T12:10:01Z

‎2017

Admin: /* 2017 */

2021-07-09T12:08:12Z

‎2017

Admin: /* 2017 */

2021-07-09T12:07:49Z

‎2017

@@ Line 15: / Line 15: @@
 *[https://ep.liu.se/ecp/158/ecp19158.pdf Nils Kopal.  "Cryptanalysis of Homophonic Substitution Ciphers Using Simulated Annealing with Fixed Temperature"]
 ** This paper describes the current progress of our research in the area of breaking homophonic substitution ciphers. Furthermore, it presents the state-of-the-art of cryptanalyzing this kind of cipher. There is a huge gap between the success rate of methods published in according research papers and the success rate of already available tools on the Internet. This paper also presents a small general taxonomy of monoalphabetic substitution ciphers. Finally, it shows how we broke different homophonic substitution ciphers in an automatic as well as in a semi-automatic way.
 = 2018 =

@@ Line 13: / Line 13: @@
 = 2019 =
-*[https://ep.liu.se/ecp/158/ecp19158.pdf Nils Kpal.  "Cryptanalysis of Homophonic Substitution Ciphers Using Simulated Annealing with Fixed Temperature"]
+*[https://ep.liu.se/ecp/158/ecp19158.pdf Nils Kopal.  "Cryptanalysis of Homophonic Substitution Ciphers Using Simulated Annealing with Fixed Temperature"]
 ** This paper describes the current progress of our research in the area of breaking homophonic substitution ciphers. Furthermore, it presents the state-of-the-art of cryptanalyzing this kind of cipher. There is a huge gap between the success rate of methods published in according research papers and the success rate of already available tools on the Internet. This paper also presents a small general taxonomy of monoalphabetic substitution ciphers. Finally, it shows how we broke different homophonic substitution ciphers in an automatic as well as in a semi-automatic way.

@@ Line 10: / Line 10: @@
 *[https://ijels.com/detail/the-similarities-of-thematic-progression-in-zodiac-killer-letters/ Mohammad Rakhmat Pramudita, Elvi Citraresmana, Susi Yuliawati.  "The Similarities of Thematic Progression in Zodiac Killer Letters"]
 ** This study examines thematic progression in zodiac killer letters. This study aims to reveal the unknown killer whether it is personal killer or group killer. This study employs a descriptive qualitative method since it attempts to describe and analyze textual data accurately. The data of this study come from research publication article. After gathering the data, thematic progression theory proposed by Fries (2002) is employed to analyze the data. Findings show that constant theme is the type of thematic progression that is mostly used in the zodiac killer letters by 65.30%. However, some letters of zodiac killer contain a lot of similarities for instance they usually use constant theme and multiple theme but there is no linear theme. This study conclude that the similarities of thematic progression often occur in zodiac killer letters. It means that the zodiac killer letters are very possible written by one person. So it’s a personal crime, not group killer.
 = 2018 =

@@ Line 136: / Line 136: @@
 **Abstract: "This paper considers a new approach to cryptanalysis based on the application of a directed random search algorithm called a genetic algorithm. It is shown that such a algorithm could be used to discover the key for a simple substitution cipher."
 *[https://www.tandfonline.com/doi/abs/10.1080/0161-119391867755JC King, DR Bahler.  "A framework for the study of homophonic ciphers in classical encryption and genetic systems." Cryptologia, 1993 - Taylor & Francis]
 *[https://link.springer.com/chapter/10.1007/3-540-46885-4_38 Hakon N. Jendal, Yves J. B. Kuhn, James L. Massey.  "An Information-Theoretic Treatment of Homophonic Substitution" (1990)]
 ** The history of cryptology shows that most secret-key cipher systems that have been broken were broken by exploiting the departure of the plaintext statistics from those of a completely random sequence. The technique of “homophonic substitution” is an old technique for converting an actual plaintext sequence into a (more) random sequence. At EUROCRYPT ’88, Günther [1] introduced an important generalization of homophonic substitution, which we will call “variable-length homophonic substitution”. The purpose of this paper is to give an information-theoretic treatment of Günther’s type of homophonic substitution.

@@ Line 135: / Line 135: @@
 *[http://www.tandfonline.com/doi/abs/10.1080/0161-119391867746 Spillman, Richard, et al. "Use of a genetic algorithm in the cryptanalysis of simple substitution ciphers." Cryptologia 17.1 (1993): 31-44.]
 **Abstract: "This paper considers a new approach to cryptanalysis based on the application of a directed random search algorithm called a genetic algorithm. It is shown that such a algorithm could be used to discover the key for a simple substitution cipher."
 *[https://link.springer.com/chapter/10.1007/3-540-46885-4_38 Hakon N. Jendal, Yves J. B. Kuhn, James L. Massey.  "An Information-Theoretic Treatment of Homophonic Substitution" (1990)]
 ** The history of cryptology shows that most secret-key cipher systems that have been broken were broken by exploiting the departure of the plaintext statistics from those of a completely random sequence. The technique of “homophonic substitution” is an old technique for converting an actual plaintext sequence into a (more) random sequence. At EUROCRYPT ’88, Günther [1] introduced an important generalization of homophonic substitution, which we will call “variable-length homophonic substitution”. The purpose of this paper is to give an information-theoretic treatment of Günther’s type of homophonic substitution.

@@ Line 118: / Line 118: @@
 ** Abstract: "Genetic algorithms (GAs) are a class of optimization algorithms. GAs attempt to solve problems through modeling a simplified version of genetic processes. There are many problems for which a GA approach is useful. It is, however, undetermined if cryptanalysis is such a problem. Therefore, this work explores the use of GAs in cryptography. Both traditional cryptanalysis and GA-based methods are implemented in software. The results are then compared using the metrics of elapsed time and percentage of successful decryptions. A determination is made for each cipher under consideration as to the validity of the GA-based approaches found in the literature. In general, these GA-based approaches are typical of the field. Of the genetic algorithm attacks found in the literature, totaling twelve, seven were re-implemented. Of these seven, only three achieved any success. The successful attacks were those on the transposition and permutation ciphers by Matthews, Clark, and Gr¨undlingh and Van Vuuren, respectively. These attacks were further investigated in an attempt to improve or extend their success. Unfortunately, this attempt was unsuccessful, as was the attempt to apply the Clark attack to the monoalphabetic substitution cipher and achieve the same or indeed any level of success. Overall, the standard fitness equation genetic algorithm approach, and the scoreboard variant thereof, are not worth the extra effort involved. Traditional cryptanalysis methods are more successful, and easier to implement. While a traditional method takes more time, a faster unsuccessful attack is worthless. The failure of the genetic algorithm approach indicates that supplementary research into traditional cryptanalysis methods may be more useful and valuable than additional modification of GA-based approaches."
 ** [https://ritdml.rit.edu/bitstream/handle/1850/263/README_geneticattacks.txt;jsessionid=5EB1D1BBFEA3E1F34008F209E4B17F56?sequence=8 List of attacks mentioned in the paper]
 *[http://www.nets.rwth-aachen.de/content/teaching/seminars/sub/2002_2003_ws_docs/HomophonicCoding.pdf Pimenidis, Lexi. "HOMOPHONE KRYPTOGRAPHIE." (2002)]  (German-language paper.  Mentions Zodiac codes.)
 **Abstract: "Homophone Substitutionsverschlusselung kann verwendet werden, wenn traditionelle Algorithmen nicht mehr genug Sicherheit bieten, sowie als Basis fur stark  ere Verschlusselungen.  Durch das Einbringen von Zufallselementen und die Verwendung von Mengen anstatt einzelner Zeichen, soll eine Kryptoanalyse erschwert werden. Diese Arbeit zeigt anhand von einfachen Beispielen Moglichk  eiten, Grenzen und Erweiterungen von homophoner Kryptographie auf."

@@ Line 92: / Line 92: @@
 *[http://www.oranchak.com/t14pap379-oranchak.pdf Oranchak, David. "Evolutionary algorithm for decryption of monoalphabetic homophonic substitution ciphers encoded as constraint satisfaction problems." Proceedings of the 10th annual conference on Genetic and evolutionary computation. ACM, 2008.]
 **Abstract: "A homophonic substitution cipher maps each plaintext letter of a message to one or more ciphertext symbols [4]. Monoalphabetic homophonic ciphers do not allow ciphertext symbols to map to more than one plaintext letter. Homophonic ciphers conceal language statistics in the enciphered messages, making statistical-based attacks more difficult. We present a dictionary-based attack using a genetic algorithm that encodes solutions as plaintext word placements subjected to constraints imposed by the cipher symbols. We test the technique using a famous cipher (with a known solution) created by the Zodiac serial killer. We present several successful decryption attempts using dictionary sizes of up to 1,600 words."
 *[https://www.evernote.com/shard/s1/sh/397f2001-cb0a-4e1f-9cf0-7b5e90b6240a/bc7a9feb900ddf22cb58b95c7ebeff4c Kulich, Martin. "CRACKING OF THE SUBSTITUTION CIPHERS IN CLASSICAL CRYPTOGRAPHY.", Faculty of Information Technology (FIT), Brno University of Technology (2008, approx.)]
 **Abstract: "The thesis provides a tool for automatic monoalphabetic substitution ciphers cracking using most common words dictionary. It is based on some previous solutions for english language which were not designed for cracking ciphertext without word divisions. This thesis is focused on cracking ciphertexts without word divisions. It also looks at specifics of czech language - declension and its influence on dictionary size."

@@ Line 22: / Line 22: @@
 *[https://www.researchgate.net/publication/335603478_Cryptanalytic_of_Substitution_Ciphers_by_Artificial_Bee_Colony_Algorithm_Guided_by_Statistics_based_Fitness_Function Arkan Kh Shakr Sabonchi, Bahriye Akay.  "Cryptanalytic of Substitution Ciphers by Artificial Bee Colony Algorithm Guided by Statistics based Fitness Function" (2017)]
 ** The secrecy and reliability of information have gained importance against the advancing technology and the interest in cryptology has also been increased. The purpose of this study is to analyze cryptanalytic attacks using cryptanalysis combined with Artificial Bee Colony Algorithm which is a swarm intelligence algorithm and successful to solve the complex problems. This study is the first that The Artificial Bee Colony algorithm is used for cryptanalytic in substitution ciphers which are the basic methods of cryptology system. The key and password are broken, and the plain text is obtained as a result of the comparison between the character in the encrypted text and the standard language character used.
 = 2016 =

@@ Line 20: / Line 20: @@
 *[http://www.upress.uni-kassel.de/katalog/abstract_en.php?978-3-7376-0458-1 Lasry, George. "A Methodology for the Cryptanalysis of Classical Ciphers with Search Metaheuristics"  2017] [http://www.upress.uni-kassel.de/katalog/Download.php?ISBN=978-3-7376-0458-1&type=pdf-d (PDF)]
 **Abstract: Starting from the 1990s, local search metaheuristics such as hill climbing, genetic algorithms, and simulated annealing have been employed, and in some cases, successfully, for the cryptanalysis of several classical ciphers. In most cases, however, results were mixed, and the application of such methods rather limited in their scope and performance.  In this work, a robust framework and methodology for the cryptanalysis of classical ciphers using local search metaheuristics, mainly hill climbing and simulated annealing, is described. In an extensive set of case studies conducted as part of this research, this new methodology has been validated and demonstrated as highly effective for the cryptanalysis of several challenging cipher systems and machines, which could not be effectively cryptanalyzed before, and with drastic improvements compared to previously published methods. This work also led to the decipherment of original encrypted messages from WWI, and to the solution, for the first time, of several public cryptographic challenges.
 = 2016 =