On Obtaining of Irreducible Polynomials on Galois Fields for Information Security Systems
The article is dedicated to the problem of generating the indecomposable polynomials over Galois fields used in cryptographic information security, generation of pseudo random numbers and sequences, data compression and error-correction during data transmission. New properties of polynomials over finite fields was discovered after theoretical and experimental research. The approach to increase speed of searching indecomposable polynomials is proposed and relies on the optimization of the procedure of their selection and testing using discovered features.