The methods of forming of sequences of pseudo-random numbers (PRN) are examined, going is probed near a construction demonstrable proof generators firmness of which is based on theorist of intricate problem of the syndromic decoding. The method of the rapid forming of PRN of demonstrable firmness is offered, which allows to provide the maximal period of the formed sequences. Research of firmness of the offered method of forming of PRN is conducted to the cryptographic attacks of opponent, to based on the use of decoding of surplus (n,k, d) kodas algorithms above GF(q).
numbers sequence of pseudo-random numbers , generator of pseudocasual numbers
"Metod shvydkoho formuvannia poslidovnostei psevdovypadkovykh chysel dokazovoi stiikosti" ,
Systems of Arms and Military Equipment,