You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
It would be amazingly useful to allow people to identify common substrings in some corpus of plaintexts. We have common words in English in the frequency section of Cryptanalib already, but this is pulled from publicly available data, in contrast to our character and multigraph frequency data, which we have calculated from Charles Dickens' A Tale of Two Cities.
It should be possible to automatically recognize cribs in some provided data, and this should boil down to the Longest repeated substring problem.
The text was updated successfully, but these errors were encountered:
It would be amazingly useful to allow people to identify common substrings in some corpus of plaintexts. We have common words in English in the
frequency
section of Cryptanalib already, but this is pulled from publicly available data, in contrast to our character and multigraph frequency data, which we have calculated from Charles Dickens' A Tale of Two Cities.It should be possible to automatically recognize cribs in some provided data, and this should boil down to the Longest repeated substring problem.
The text was updated successfully, but these errors were encountered: