Talk:Unicity distance

From Wikipedia, the free encyclopedia
Jump to: navigation, search
WikiProject Cryptography / Computer science   
WikiProject icon This article is within the scope of WikiProject Cryptography, a collaborative effort to improve the coverage of Cryptography on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.
 ???  This article has not yet received a rating on the quality scale.
 ???  This article has not yet received a rating on the importance scale.
Taskforce icon
This article is supported by WikiProject Computer science.
 

Meanings and abrevation of.. FER Ec/Io CAI Finger RFI

Please improve sentence structure[edit]

This paragraph gives me parsing problems, Should the second sentence be joined to the first as as it is read, since if? I cannot tell.

Another way to increase the unicity distance is to increase the number of possible valid sequences in the files as it is read. Since if for at least the first several blocks any bit pattern can effectively be part of a valid message then the unicity distance has not been reached. This is possible on long files when certain bijective string sorting permutations are used, such as the many variants of bijective BWT transforms. — Preceding unsigned comment added by 143.111.80.33 (talk) 17:15, 11 March 2013 (UTC)

Broken character, questionable example[edit]

Basically the bigger the unicity distance the better. For a one time pad, given the unbounded entropy of the key space, we have U = , which is consistent with the one-time pad being theoretically unbreakable.

The  is broken for me (Ubuntu, Firefox, with Japanese/Korean support). --Sydius (talk) 00:55, 19 August 2008 (UTC)

Basically the bigger the unicity distance the better. For a one time pad of unlimited size, given the unbounded entropy of the key space, we have U = \infty, which is consistent with the one-time pad being theoretically unbreakable.
I improved the expression here, but the example is not really on target. I would not speak in terms of infinity, which will seem too theoretical even to the theoretically-minded, but rather point out that a one-time pad is used only once, for a message much shorter than the unicity length. A calculation with a ten-thousand word message in English would be great here. For this example: How long a key to get a unicity length of a million? How many key candidates with this key length (surely much greater than one)? It might not be enough for a conviction, but might still justify an arrest. 178.38.151.183 (talk) 17:33, 30 November 2014 (UTC)

Logic of permutation method escapes me[edit]

Another way to increase the unicity distance is to increase the number of possible valid sequences in the files as it is read. Since if for at least the first several blocks any bit pattern can effectively be part of a valid message then the unicity distance has not been reached. This is possible on long files when certain bijective string sorting permutations are used, such as the many variants of bijective Burrows-Wheeler transforms.[dubious ]

I don't quite get this.

First of all, it is not very precisely stated (the first two sentences).

Second, if a permutation is used, it does not change the entropy of the message space since the probabilities are only permuted. Unless there is some implicit framework assumption about the length of the text window for entropy measurements, the length of the permutations versus the length of the messages, the length of code blocks, or something. But then this should be made clear.

And/or: if someone can provide a citation it would help a lot or solve the problem. 178.38.151.183 (talk) 18:54, 30 November 2014 (UTC)