A finite group G is called exceptional if for a Galois extension F/k of number fields with the Galois group G,in the Brauer-Kuroda relation of the Dedekind zeta functions of fields between k and F,the zeta function of...A finite group G is called exceptional if for a Galois extension F/k of number fields with the Galois group G,in the Brauer-Kuroda relation of the Dedekind zeta functions of fields between k and F,the zeta function of F does not appear.In the present paper we describe effectively all exceptional groups of orders divisible by exactly two prime numbers p and q,which have unique subgroups of orders p and q.展开更多
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 w...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.展开更多
基金supported by National Natural Science Foundation of China (Grant No. 10871106)
文摘A finite group G is called exceptional if for a Galois extension F/k of number fields with the Galois group G,in the Brauer-Kuroda relation of the Dedekind zeta functions of fields between k and F,the zeta function of F does not appear.In the present paper we describe effectively all exceptional groups of orders divisible by exactly two prime numbers p and q,which have unique subgroups of orders p and q.
基金the National Natural Science Foundation of China (Grant No. 10371061)
文摘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.