We construct one multi-sender authentication code by algebraic combination method from eigenvalues and eigenvectors of the matrix over nite elds. Some parameters and the probabilities of three kinds of successful atta...We construct one multi-sender authentication code by algebraic combination method from eigenvalues and eigenvectors of the matrix over nite elds. Some parameters and the probabilities of three kinds of successful attack of this code are also computed. For multi-sender authentication code,it allows a group of senders to construct an authenticated message for a receiver such that the receiver can verify authenticity of the received message.展开更多
We determine the left eigenvector of a stochastic matrix M associated to the eigenvalue 1 in the commutative and the noncommutative cases. In the commutative case, we see that the eigenvector associated to the eigenva...We determine the left eigenvector of a stochastic matrix M associated to the eigenvalue 1 in the commutative and the noncommutative cases. In the commutative case, we see that the eigenvector associated to the eigenvalue 0 is (N1,Nn) , where Ni is the i–th iprincipal minor of N=M–In , where In is the identity matrix of dimension n. In the noncommutative case, this eigenvector is (P1-1,Pn-1) , where Pi is the sum in Q《αij》 of the corresponding labels of nonempty paths starting from i and not passing through i in the complete directed graph associated to M .展开更多
基金Sponsored by the National Natural Science Foundation of China(Grant No.61179026)the Fundamental Research of the Central Universities of China Civil Aviation University of Science Special(Grant No.3122016L005)
文摘We construct one multi-sender authentication code by algebraic combination method from eigenvalues and eigenvectors of the matrix over nite elds. Some parameters and the probabilities of three kinds of successful attack of this code are also computed. For multi-sender authentication code,it allows a group of senders to construct an authenticated message for a receiver such that the receiver can verify authenticity of the received message.
文摘We determine the left eigenvector of a stochastic matrix M associated to the eigenvalue 1 in the commutative and the noncommutative cases. In the commutative case, we see that the eigenvector associated to the eigenvalue 0 is (N1,Nn) , where Ni is the i–th iprincipal minor of N=M–In , where In is the identity matrix of dimension n. In the noncommutative case, this eigenvector is (P1-1,Pn-1) , where Pi is the sum in Q《αij》 of the corresponding labels of nonempty paths starting from i and not passing through i in the complete directed graph associated to M .
