# Random numbers generation method

FIELD: cryptography.

SUBSTANCE: method includes generating random numbers with use of displacement register with check connection, elementary digit of which is a q-based symbol (q=2^{l}, l - binary symbol length) at length of q-based digits register, in check connection networks nonlinear two-parameter operations on q-based symbols F (u_{b}, u_{d}) are used, on basis of random replacement tables, for generating next random number values z_{1}=F(u_{i}, u_{j}), z_{2}=F(u_{t}, u_{m}), z_{g}=F(z_{1}, z_{2}) are calculated, where u_{i}, u_{j}, u_{t}, u_{m} - values of filling of respective register digits, value of result in check connection networks z_{g} is recorded to g digit of displacement register and is a next result of random numbers generation, after which displacement of register contents for one q-based digit is performed.

EFFECT: higher speed and efficiency.

3 cl

The invention relates to cryptography and means of information protection against unauthorized access (unauthorized access), access control unauthorized viewing, the content changes (modifications) for the storage and transmission of information and can be used to generate random sequences with a very large period, with a high degree of statistical compliance with the law uniform distribution and quality of the unpredictability of such sequences.

The method can be used to build software, hardware and hardware-software means of protection against unauthorized access, cryptographic protection of the information from the review and control and restore the integrity of information and to resolve any technical problems that require the use of random numbers with a long period of generation, high generation rate and good statistical properties.

Known methods of generating random (quasilocal) sequences on the basis of the binary registers with feedback, using the operations of addition modulo two in accordance with describing the law of feedback primitive polynomial Q(X) of degree n. With proper choice of the polynomial such a shift register can provide the maximum sequence length associated with a binary register length n soothes the tion between N and the register length n of the following form N=2^{
n}-1. However, these generators do not provide a fast software implementation for large amounts of period N, does not have the properties of the unpredictability of the generated sequence that does not provide cryptographic firmness when using these generators to encrypt information.

In accordance with the invention, the random number generation is performed in the shift register with feedback, which is not a single binary digit (bit), and q-ary symbol length l bits of the symbol (q=2^{l}l - binary symbol length). In the software implementation in a computer handy as a symbol to use one or two bytes of information (l=8 or l=16 bits). Shift and information processing in this case is q-ary symbols, i.e. a single shift register is performed on l bits, such as 1 or 2 bytes of information (for l=8 or l=16 bits, respectively). In the feedback circuit of the shift register of the data processing is performed on q-ary symbols using the pyramidal schema of the at least three two-parameter operations on q-ary symbols F (u_{b}u_{d}on the basis of random substitution tables. The operands of this operation are the values of the q-ary characters written in this cycle in the cells of the shift register u_{b}and u_{d}then there are numbers b and d. To register long n q-ary si the oxen select 5 values rooms such symbols i,
j, t, m, g with values from 0 to n-1. The first pair of values indicates the number of taps (numbers of cells of the register) to perform the first operation z_{1}=F (u_{i}u_{j}), the second pair of values indicates the number of taps (numbers of cells of the register) to perform the second operation z_{2}=F (u_{t}and u_{m}), the fifth value specifies the number of cells of the shift register in which to store the execution result of the third operation Z_{g}=F (z_{1}, z_{2}), the operands are the results of the first two operations.

Operation F (u_{b}u_{d}in the feedback circuit is built on the basis of table T_{to}containing 2^{l}distinct values of the binary combinations of length l; when the operation is found in the table the value of the first operand u_{b}and read the value from a table of the conversion, which is the number of rows that match the value of the second operand u_{d}from the string value of the first operand.

The initial filling of the shift register with feedback and tables of random substitutions in the feedback circuit to determine a conversion function q-ary symbols in the feedback circuit, and hence the generating function of the random numbers and the loop point generated random sequence. To ensure the unpredictability of the generated posledovatel the particular initial filling of the shift register with feedback and tables of random substitutions in the feedback circuit are made from the physical sensor of random numbers.

We propose the following procedure for performing the initial filling of the shift register with feedback and tables of random substitutions in the feedback circuit of the shift register. These seeding perform distinct values of the random numbers to compare what the next random number with the previously recorded values of the random numbers when matching a new value number from the physical sensor with any of the previously written the new value drop, if not - write in another cell of the shift register or replacement tables.

The proposed method is characterized by the fact that the initial filling of the shift register of length n is l bits and three tables of random replacement total length of 3×(2^{l})l bit is key (parameter settings) sensor.

The described method has the following advantages:

- high speed of information processing;

- providing after encryption quasispecies sequences, regardless of the statistics of individual letters in the source text;

- complex transform, with no other formal description, in addition to describing the fill code tables T_{to};

- the opportunity to consider the initial filling of the table as the encryption key.

The source of information

1. Romanet J.V., Timofeev P.A. Shangin SCI Protect the same information in computer systems and networks. - M.: Radio and communication. 1999.

1. The method of generating random numbers using n-bit shift register with feedback, the discharge of which the selected q-ary symbol (q=2^{l}l=8, 16 bits)in the feedback circuit exercise at least three two-parameter operations on q-ary symbols based on the random substitution tables T_{to}, each of which contains the 2^{l}distinct values of the binary combinations of length l, the initial filling of the shift register with feedback and tables of random substitutions are made from the physical sensor random non-repeating values of the random numbers to compare what the next random number with the previously recorded values of the random numbers when matching the new value of number with any of the previously written, the new value is discarded, if not - write the next bit of the shift register and the next line replacement tables, to generate another random number is chosen five values indicating the number of bits of the shift register, the first and second pairs of values indicate the number of bits of the shift register to perform accordingly, the first and second operations, the operands of the third operations are the results of the first two operations, the operands are the values of the q-ary characters written in this t is regarding subsection digit of the shift register corresponding to the specified numbers,
to perform all of the operations are used in the table T_{to}the value of the first operand and read from the table of T_{to}the value is the number of rows used tables T_{to}coinciding with the binary value of the second operand, the execution result of the third operation, which is another result of the generation, recording the last-selected category of the shift register, after which produce a shift of the contents of the shift register on one q-ary digit.

2. The method according to claim 1, characterized in that the operation of the shift-on-one q-ary digit implement change per unit modulo the length of the register values of the numbers of digits.

3. The method according to claim 1, characterized in that the initial filling of the shift register of length nl bits and three tables of random replacement T_{to}total length of 3×(2^{l})l bit is the key, or by setting a random numbers generator.

**Same patents:**

FIELD: cryptography.

SUBSTANCE: method includes generating random numbers with use of displacement register with check connection, elementary digit of which is a q-based symbol (q=2^{l}, l - binary symbol length) at length of q-based digits register, in check connection networks nonlinear two-parameter operations on q-based symbols F (u_{b}, u_{d}) are used, on basis of random replacement tables, for generating next random number values z_{1}=F(u_{i}, u_{j}), z_{2}=F(u_{t}, u_{m}), z_{g}=F(z_{1}, z_{2}) are calculated, where u_{i}, u_{j}, u_{t}, u_{m} - values of filling of respective register digits, value of result in check connection networks z_{g} is recorded to g digit of displacement register and is a next result of random numbers generation, after which displacement of register contents for one q-based digit is performed.

EFFECT: higher speed and efficiency.

3 cl

FIELD: computer science.

SUBSTANCE: device has random numbers source, N-digit selector-multiplexer, RAM, ranges control block, generations number control block, J-input OR element, AND elements block. Because series of given values of data set is broken in ranges and frequency of their appearance is set within certain limits, random series is generated with distribution law, presented in form of ranges.

EFFECT: broader functional capabilities.

3 cl, 7 dwg

FIELD: engineering of pseudo-noise series generators with arbitrary number of bits, while said number of bits is transferred in parallel manner during each clock pulse.

SUBSTANCE: beginning values of states are loaded in registers of parallel pseudo-noise generator, which immediately generates following n bits of pseudo-noise series, where n - arbitrary number, depending on required productiveness level. Then, first sub-portion of pseudo-noise generator in accordance to invention receives current state of pseudo-noise generator and outputs state of n bits pseudo-noise generator in the future.

EFFECT: increased speed of operation, realization of parallel processing for capturing and demodulating processes.

3 cl, 9 dwg

FIELD: computer science.

SUBSTANCE: generator has set-point generator 1, generator 2 of exponential voltage, generator 3 of evenly distributed random numbers, digital-analog converter 4, elements OR 5,6, block 7 for comparison, device for pulse generation 8, forbidding element 9, trigger 10, multiplication block 11, input 12 and output 13 of device. Requests stream is formed of elementary stream by excluding one request with preservation of second request, i.e. at output 13 of generator through temporal ranges, distributed in accordance to Erlang law of second order, pulses are generated, modeling receipt of requests.

EFFECT: decreased hardware costs.

1 dwg

FIELD: computer science, possible use in imitators of random processes, and also in specialized and universal computing machines.

SUBSTANCE: device has random number sensor, clock impulse generator, stepped voltage generator, comparison block, counter, decoder, trigger, impulse generator, memory blocks, delay elements, AND elements, multiplexer, adder, block for setting source data, block of adders, block of subtracters, block of amplitude discriminators, code-amplitude transformer, blocks of elements AND, elements OR.

EFFECT: expanded functional capabilities of device.

1 dwg

FIELD: computer engineering; cryptographic systems.

SUBSTANCE: method is based on entropy valuation calculation and writing of mixed packed data into corresponding cells in different memory block areas. On the basis of written data new initial value is formed. Device for initial value of pseudorandom value generator forming contains data source analysis and current entropy valuation calculation means, data package means, data mix means, data accumulation and entropy valuation forming means, new initial value forming means.

EFFECT: method and device provide the capability of initial values forming, which provide dynamic source speed valuation, classification of sources by fast and slow, reliable and unreliable, and also forming of initial values taking into account speed characteristics of sources and reliability of these sources.

10 cl, 2 dwg

FIELD: engineering of methods for cryptographic transformation of data, possible use in communication, computer and informational systems for cryptographic encryption of information and computation of numbers close to random.

SUBSTANCE: device contains two memory blocks, current time moment timer, two concatenation blocks, two hash-function computation blocks, operation block, computing block.

EFFECT: increased complexity of encryption analysis and decreased probability of reliable prediction of next values of pseudo-random series bits while increasing operation speed of generator.

1 dwg