By use of partially balanced t-designs (v,b, k;λ,0) that is constructed by the rational normal curves given by [5] and the Cartesian product given by [4],an authentication code with arbitration is constructed and its...By use of partially balanced t-designs (v,b, k;λ,0) that is constructed by the rational normal curves given by [5] and the Cartesian product given by [4],an authentication code with arbitration is constructed and its probability of success of attacks by the transmitter, the receiver and the opponent is obtained in this paper.展开更多
In this paper we give a new construction of authentication codes with arbitration using orthogonal spaces. Some parameters and the probabilities of successful attacks are computed.
介绍一种可用APB总线配置的I3C控制器IP的设计与验证,I3C(Improved Inter Integrated Circuit),即改进的I2C,是一种新型的串行通信模块,同样是用于SoC设计中的外围IP模块。与I2C相比,它支持新的通信模式、更高的通信速度(高达12.5 MHz)...介绍一种可用APB总线配置的I3C控制器IP的设计与验证,I3C(Improved Inter Integrated Circuit),即改进的I2C,是一种新型的串行通信模块,同样是用于SoC设计中的外围IP模块。与I2C相比,它支持新的通信模式、更高的通信速度(高达12.5 MHz)、动态地址分配,并带有内置中断(IBI)。这些特性使得I3C与I2C相比优势明显,未来大规模地普及和商用也是大势所趋。首先介绍I3C协议的基本原理和优势,然后详细描述I3C控制器的设计架构和功能模块,在设计完成后,对I3C控制器进行了功能验证并展示其验证结果,证明了所提出方法的有效性和可靠性。展开更多
This paper is devoted to constructing an authentication code with arbitration using subspaces of vector spaces over finite fields.Moreover,if we choose the encoding rules of the transmitter and the decoding rules of t...This paper is devoted to constructing an authentication code with arbitration using subspaces of vector spaces over finite fields.Moreover,if we choose the encoding rules of the transmitter and the decoding rules of the receiver according to a uniform probability distribution,then some parameters and the probabilities of successful attacks are computed.展开更多
The authentication codes with arbitration are able to solve dispute between the sender and the receiver. The authentication codes with trusted arbitration are called AZ-codes, the authentication codes with distrust ar...The authentication codes with arbitration are able to solve dispute between the sender and the receiver. The authentication codes with trusted arbitration are called AZ-codes, the authentication codes with distrust arbitration are called A3-codes . As an expansion of Az-cOdes , an A3-code is an authentication system which is closer to the reality environment. Therefore, A3-codes have more extensive application value. In this paper, we construct a class of A3-codes based on polynomials over finite fields, give the parameters of the constructed codes, and calculate a variety of cheating attacks the maximum probabilities of success. Especially, in a special case, the constructed A3-codes are perfect. Compared with a known type of codes, they have almost the same security level, however, our codes need less storage requirements. Therefore, our codes have more advantages.展开更多
A construction of authentication codes with arbitration from singular pseudo-symplectic geometry over finite fields is given and the parameters of the code are computed. Under the assumption that the encoding rules of...A construction of authentication codes with arbitration from singular pseudo-symplectic geometry over finite fields is given and the parameters of the code are computed. Under the assumption that the encoding rules of the transmitter and the receiver are chosen according to a uniform probability distribution, the probabilities of success for different types of deceptions are also computed.展开更多
文摘By use of partially balanced t-designs (v,b, k;λ,0) that is constructed by the rational normal curves given by [5] and the Cartesian product given by [4],an authentication code with arbitration is constructed and its probability of success of attacks by the transmitter, the receiver and the opponent is obtained in this paper.
文摘In this paper we give a new construction of authentication codes with arbitration using orthogonal spaces. Some parameters and the probabilities of successful attacks are computed.
文摘介绍一种可用APB总线配置的I3C控制器IP的设计与验证,I3C(Improved Inter Integrated Circuit),即改进的I2C,是一种新型的串行通信模块,同样是用于SoC设计中的外围IP模块。与I2C相比,它支持新的通信模式、更高的通信速度(高达12.5 MHz)、动态地址分配,并带有内置中断(IBI)。这些特性使得I3C与I2C相比优势明显,未来大规模地普及和商用也是大势所趋。首先介绍I3C协议的基本原理和优势,然后详细描述I3C控制器的设计架构和功能模块,在设计完成后,对I3C控制器进行了功能验证并展示其验证结果,证明了所提出方法的有效性和可靠性。
基金Supported by the National Natural Science Foundation of China (Grant No. 10771023)
文摘This paper is devoted to constructing an authentication code with arbitration using subspaces of vector spaces over finite fields.Moreover,if we choose the encoding rules of the transmitter and the decoding rules of the receiver according to a uniform probability distribution,then some parameters and the probabilities of successful attacks are computed.
基金supported by the National Natural Science Foundation of China(61179026)the Fundamental Research Funds for the Central Universities(3122016L005)
文摘The authentication codes with arbitration are able to solve dispute between the sender and the receiver. The authentication codes with trusted arbitration are called AZ-codes, the authentication codes with distrust arbitration are called A3-codes . As an expansion of Az-cOdes , an A3-code is an authentication system which is closer to the reality environment. Therefore, A3-codes have more extensive application value. In this paper, we construct a class of A3-codes based on polynomials over finite fields, give the parameters of the constructed codes, and calculate a variety of cheating attacks the maximum probabilities of success. Especially, in a special case, the constructed A3-codes are perfect. Compared with a known type of codes, they have almost the same security level, however, our codes need less storage requirements. Therefore, our codes have more advantages.
基金Foundation item： the National Natural Science Foundation of China （No. 60776810） the Natural Science Foundation of Tianjin City （No. 08JCYBJC13900）.
文摘A construction of authentication codes with arbitration from singular pseudo-symplectic geometry over finite fields is given and the parameters of the code are computed. Under the assumption that the encoding rules of the transmitter and the receiver are chosen according to a uniform probability distribution, the probabilities of success for different types of deceptions are also computed.
