Elonka Dunin, Magnus Ekhall, Konstantin Hamidullin, Nils Kopal, G. Lasry, Klaus Schmeh
{"title":"How we set new world records in breaking Playfair ciphertexts","authors":"Elonka Dunin, Magnus Ekhall, Konstantin Hamidullin, Nils Kopal, G. Lasry, Klaus Schmeh","doi":"10.1080/01611194.2021.1905734","DOIUrl":null,"url":null,"abstract":"Abstract The Playfair cipher is a well-known manual encryption method developed in the 19th century. Until 2018, known cryptanalysis techniques, with computer assistance, could solve non-keyword-based Playfair ciphertexts if they had at least 60 letters to work with. Shorter ciphertexts were effectively impossible to solve in the absence of a crib. In this article, we show how we introduced several improvements in these cryptanalysis methods, which made it possible to do much better. This resulted in the (unofficial) world record for the shortest Playfair message broken going down from 60 via 50, 40, 32, and 28 to 26 letters. The cryptanalysis techniques used include hill climbing, simulated annealing, tabu search, and plaintext-based dictionary attacks. For readers interested in improving the current record, we also provide unsolved Playfair challenges consisting of 24 and 22 letters.","PeriodicalId":55202,"journal":{"name":"Cryptologia","volume":"46 1","pages":"302 - 322"},"PeriodicalIF":0.3000,"publicationDate":"2021-08-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Cryptologia","FirstCategoryId":"5","ListUrlMain":"https://doi.org/10.1080/01611194.2021.1905734","RegionNum":4,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"COMPUTER SCIENCE, THEORY & METHODS","Score":null,"Total":0}
引用次数: 1
Abstract
Abstract The Playfair cipher is a well-known manual encryption method developed in the 19th century. Until 2018, known cryptanalysis techniques, with computer assistance, could solve non-keyword-based Playfair ciphertexts if they had at least 60 letters to work with. Shorter ciphertexts were effectively impossible to solve in the absence of a crib. In this article, we show how we introduced several improvements in these cryptanalysis methods, which made it possible to do much better. This resulted in the (unofficial) world record for the shortest Playfair message broken going down from 60 via 50, 40, 32, and 28 to 26 letters. The cryptanalysis techniques used include hill climbing, simulated annealing, tabu search, and plaintext-based dictionary attacks. For readers interested in improving the current record, we also provide unsolved Playfair challenges consisting of 24 and 22 letters.
期刊介绍:
Cryptologia is the only scholarly journal in the world dealing with the history, the technology, and the effect of the most important form of intelligence in the world today - communications intelligence. It fosters the study of all aspects of cryptology -- technical as well as historical and cultural. The journal"s articles have broken many new paths in intelligence history. They have told for the first time how a special agency prepared information from codebreaking for President Roosevelt, have described the ciphers of Lewis Carroll, revealed details of Hermann Goering"s wiretapping agency, published memoirs - written for it -- of some World War II American codebreakers, disclosed how American codebreaking affected the structure of the United Nations.