Talk:Impossible differential cryptanalysis

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.
 

This article cites a bunch of papers from ieee xplore (in the further reading section I mean). These are not accessible without a subscription. So it would be nice to have some alternative sources. —Preceding unsigned comment added by 81.204.51.159 (talk) 21:11, 11 February 2011 (UTC)

There are only 2 such, out of a list that is probably too long given the tiny stub-state of this article. Ntsimp (talk) 21:22, 11 February 2011 (UTC)

Does really impossible mean with probability 0? I believed that impossible meant cannot occur, which is (strictly) stronger than having a probability 0. Sedrikov (talk) 14:42, 10 July 2013 (UTC)

The block ciphers considered here are finite algorithms, with finitely many possible inputs and outputs. With a finite sample space, probability 0 is the same as literally impossible. Ntsimp (talk) 20:08, 11 July 2013 (UTC)