我们是如何在破解游戏密文方面创造新的世界纪录的

IF 0.3 4区 工程技术 Q4 COMPUTER SCIENCE, THEORY & METHODS Cryptologia Pub Date : 2021-08-13 DOI:10.1080/01611194.2021.1905734
Elonka Dunin, Magnus Ekhall, Konstantin Hamidullin, Nils Kopal, G. Lasry, Klaus Schmeh
{"title":"我们是如何在破解游戏密文方面创造新的世界纪录的","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":"{\"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}","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

摘要

摘要Playfair密码是19世纪发展起来的一种著名的手动加密方法。直到2018年,已知的密码分析技术在计算机辅助下,如果有至少60个字母可供使用,就可以解决非基于关键字的Playfair密文。在没有婴儿床的情况下,较短的密文实际上是不可能解决的。在这篇文章中,我们展示了我们是如何在这些密码分析方法中引入一些改进的,这些改进使我们有可能做得更好。这导致Playfair最短信息的(非官方)世界纪录从60个字母减少到50个、40个、32个和28个,减少到26个。使用的密码分析技术包括爬山、模拟退火、禁忌搜索和基于明文的字典攻击。对于有兴趣改进当前记录的读者,我们还提供了由24封和22封信件组成的未解决的Playfair挑战。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
How we set new world records in breaking Playfair ciphertexts
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
Cryptologia 工程技术-计算机:理论方法
自引率
33.30%
发文量
31
审稿时长
24 months
期刊介绍: 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.
期刊最新文献
The classified mathematical papers of A. A. Albert: a glimpse into the application of mathematics to cryptologic problems during the 1950s and 1960s Review of The Hidden History of Code-Breaking and 50 Codes That Changed the World, both by Sinclair McKay The Condenser PBJ cipher machine The “Topaze stick fragment”—a newly discovered rongorongo-inscribed artifact collected during the Rapa Nui (Easter Island) visit of HMS Topaze in 1868 An artificial neural network approach to finding the key length of the Vigenère cipher
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1