Context. The problem to form generalized primitive matrixes on the Galois and Fibonacci any order over the field characteristics2 for the construction by the generators gamma functions for cryptographically stable algorithms of inline data encryption, free from the attack of Berlekamp-Messi (BM).Objective. Development of a way to eliminate the threat an attack using the BM algorithm on LFSR-generators of pseudorandomnumbers (PRN) to increase their crypto stability.Method. Linear Feedback Shift Registers (LFSR) are themselves good pseudorandom PRN generators, but they have undesirableproperties that reduce the efficiency of their use. For the registers of length shift n their internal state is a function of the previousoutput bits of the generator. Even if the feedback scheme is kept the secret, it can be determined by 2n output bits of the generator with the help of BM algorithm, which reduces the crypto-resistance of the generator PRN. The basis for single loop feedback circuits, which cover the classical LFSR-generators of PRN, are primitive polynomials.There are various ways to increase the crypto-resistance of LFSR-generators. To their number concern: introduction of nonlineartransformations, use poly register generators (as, for example, in the algorithm of encryption А5) and several others. The transition from classical LFSR-generators to generators basis on the generalized matrixes of Galois and Fibonacci leads to the fact that the algorithm of BM loses the ability to determine the unattainable polynomials generating multi-circuit feedback circuits in LFSRgenerators. The reason for this feature is that the series of bits generated by the generalized generator becomes dependent not only on the selected irreducible polynomial but also on the primitive element that participates in the creation of the feedback loop generator.Results. The PRN generators developed by LFSR were used to organize bytes of streaming information encryption.Conclusions. Statistical tests of the proposed PRN generators carried out with the help of NIST STS, and Diehard [16–18] packageshave confirmed the high quality of the generated sequences. Moreover, the generators turned out to be cryptographically resistantto BM attacks. The use of these generators in the formation of long keys, necessary, for example, in RSA encryption protocolsand other applications is promising. As an area of further researches, development of the generalized generators of PRN above a field of Galois of any characteristic.