首页|Method for Constructing Primitive Polynomials for Cryptographic Subsystems of Dependable Automated Systems
Method for Constructing Primitive Polynomials for Cryptographic Subsystems of Dependable Automated Systems
扫码查看
点击上方二维码区域，可以放大扫码查看
原文链接
NETL
NSTL
elements, primitive polynomials over fields of order 2~k, where k ≥ 2. The necessary equalities for calculating the coefficients of polynomials are given. This method is relevant in the case of creating subsystems for cryptographic protection of information in modern computer systems that use microcontrollers and microprocessors based on 32 or 64-bit data presentation formats. The indicated method for constructing primitive polynomials over non-simple fields based on the known primitive polynomials over a field of two elements has polynomial complexity. The article provides definitions of the basic concepts, as well as the necessary auxiliary results, which are used to substantiate the algorithm on which the proposed method is based, which can be useful in its implementation, a detailed description of the algorithm is presented and an example of its application is given.
subsystem of cryptographic securityprimitive polynomialirreducible polynomialthe minimal polynomial of an elementprimitive elementfinite fieldfactor ringRabin's criterion
G.N. Gulak
展开 >
Institute of Mathematical Machines and Systems Problems of National Academy of Sciences of Ukraine, Kiev
NETL
NSTL
