Last seen: February 1, 2022 6:28 pm
@quicktrader I unfortunately do not have access to a list of real person names. If there is a source accessible, then it is easy to scan. In the mea…
@quicktrader Even when assuming the simplest case of a correctly spelled substitution cipher of really a name, then there are many matches with a firs…
Testing all combinations of the 1200 first and 4999 last names of the census you reference above for a perfect match for 13 letters leaves me without …
Hello, I want to try to clarify the idea in cDecryptor, and the statistical idea behind it. The tasks are to describe features of natural language, f…
I propose to you we do the following approach: 1. We compute the entropy of information that is in a text of length 340. That is easy, it is the sum …
For the records, applying the transposition to the original 340, and scoring n-grams with Poisson distribution and comparing each with what is expecte…
, but it is generally through an experience-driven feeling of "knowing" that it is right, without showing the exact mathematical arguments a…
Congratulations to all involved! What an achievement, what a result, what a beauty! I join you celebrating your success, and say thank you for the pre…
If we look at the AZdecrypt scoring formula then I would say that there is no magic number involved: ngram_score_sum/ngrams*entropy. There is a n-gra…
Hi Jarlve & Doranchak thank you both for your replies. For the acceptance: Correct, Jarlve, I was using a simple score comparison, choosing the …
I would expect the evidence that 408 was solved correctly to the only existing reasonable solution can be proven with unicity distance, as in . Unless…
I tried to read your code, but do not really get at what point you combine the ngrams log probability sum, and the IoC. For both of AZDecrypt and zkd…