摘要
The probabilities of the state transitions of the initial value S 0 in the S table of RC4 are described by a kind of bistochastic matrices, and then a computational formula for such bistochastic matrices is given, by which the mathematical expectation of the number of fixed points in the key extending algorithm of RC4 is obtained. As a result, a statistical weakness of the key extending algorithm of RC4 is presented.
The probabilities of the state transitions of the initial value So in the S table of RC4 are described by a kind of bistochastic matrices, and then a computational formula for such bistochastic matrices is given, by which the mathematical expectation of the number of fixed points in the key extending algorithm of RC4 is obtained. As a result, a statistical weakness of the key extending algorithm of RC4 is presented.
基金
the National Natural Science Foundation of China (Grant No. 10371061)
