暴力语言检测
我需要一种算法（任何编程语言）来测试爬山算法的活力，以破解加密挑战的密码。该算法应该测试随机解密（没有空格）是英文文本（还对不完整的单词给予分数！）或只是随机字符序列的可能性有多大。
我用我开发的几种算法进行了尝试，但它们都不太好。
我的研究：
一个 enigma M4 加密项目 ( http://www.bytereef.org/m4_project.html ) 使用辛科夫统计，我也想使用它。
我唯一找到的是 «quebra -pedra» 的文档，这是一个 Java 框架，其中包括我正在寻找的 Sinkov 对数权重分析。
但我还没有找到在哪里下载框架。另外，我还没有找到 Sinkov 测试的任何实现或描述。
我很高兴得到任何提示。谢谢。
I need an algorithm (any programming language) to test the vitality with an hill climbing algorithm for breaking a cipher for a crypto challenge. The algorithm should test how likely it is that an random-decryption (has no spaces) is an English text (also giving points for yet incomplete words!) or just a random sequence of characters.
I tried it with several algorithms I developed but they were not so good.
My research:
An enigma M4 crypto project ( http://www.bytereef.org/m4_project.html ) uses the Sinkov statistics, which I want to use, too.
The only thing I found was a document of «quebra -pedra», a Java framework that includes the Sinkov log-weight analysis I am searching for.
http://www.google.com/m?client=ms-android-samsung&source=android-home#q=Quebra-pedra+framework+java
But I have not found where to download the framework. Also I have not found any implementation or description of the Sinkov test.
I would be glad for any hints. Thanks.
如果你对这篇内容有疑问，欢迎到本站社区发帖提问 参与讨论，获取更多帮助，或者扫码二维码加入 Web 技术交流群。
绑定邮箱获取回复消息
由于您还没有绑定你的真实邮箱，如果其他用户或者作者回复了您的评论，将不能在第一时间通知您！
发布评论
评论（1）
我不知道辛科夫统计数据，但自然语言处理的语言模型可以完全满足您的要求，根据文本与英语的相似程度对文本进行评分。
我在这里写了一个简单的字符二元组，它应该相当容易理解。
https://github.com/rrenaud/Gibberish-Detector
I don't know about Sinkov statistics, but language models from natural language processing can do exactly what you want, scoring text by how similar it is to English.
I wrote a simple character bigram one here, it should be reasonably easy to follow.
https://github.com/rrenaud/Gibberish-Detector