Random numbers generation method
|
Random numbers generation method / 2246129 Method includes generating random numbers with use of displacement register with check connection, elementary digit of which is a q-based symbol (q=2l, l - binary symbol length) at length of q-based digits register, in check connection networks nonlinear two-parameter operations on q-based symbols F (ub, ud) are used, on basis of random replacement tables, for generating next random number values z1=F(ui, uj), z2=F(ut, um), zg=F(z1, z2) are calculated, where ui, uj, ut, um - values of filling of respective register digits, value of result in check connection networks zg 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. |
 Random series generator / 2250489Device 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. |
 Method and device for generation of multiple bits of pseudo-noise series for each clock pulse by means of parallel calculation of bits / 2267807Beginning 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. |
 Generator for modeling flow of requests in mass service systems / 2271564Generator 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. |
 Device for modelling continuous random value on basis of bar chart / 2287177Device 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. |
 Method and device for forming of initial value of pseudorandom number generator / 2292074Method 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. |
 Device for generating pseudo-random series of binary numbers with usage of elliptic curves / 2294559Device contains two memory blocks, current time moment timer, two concatenation blocks, two hash-function computation blocks, operation block, computing block. |
 Generator of pseudo-random series / 2313125Device contains selector-multiplexer (1), random-access memory device (2), supply of random numbers (3), K P-bit registers (4), where K≥2 and P≥2, K comparison blocks (5), priority encoder (6) and N, where N≥1, inverters (7). |
 Generator of pseudorandom sequences of impulses in uniform environment with programmaticably changeable structure / 2331915Invention refers to the computer science, cryptographic encoding and discrete information transfer and can be used for creation of pseudorandom sequences generators. The device consists of the timing pulse generator, control and adjustment unit and series of uniform cells with corresponding relations. |
 Random number generator / 2331916Invention refers to methods and systems of data protection from unauthorised actions, changing of the content during data transfer and storage and can be used for quick generating of random numbers required for ciphering, creation of digital signature, authentication protocols etc. It is assumed to use the random number generator containing source of low intensity elementary particles, receiver containing particle detector and an events storage unit that allows obtaining instant analogue value of quantum events intensity proportional to the number of registered particles; analog-to-digital coder and a scheme equalising statistical properties of the obtained data stream and also generator setting measuring frequency and connected with the analog-to-digital coder. Thereby the simultaneous quantum process is used as a source of low-intensity elementary particles. |
|
Random numbers generation method / 2246129 Method includes generating random numbers with use of displacement register with check connection, elementary digit of which is a q-based symbol (q=2l, l - binary symbol length) at length of q-based digits register, in check connection networks nonlinear two-parameter operations on q-based symbols F (ub, ud) are used, on basis of random replacement tables, for generating next random number values z1=F(ui, uj), z2=F(ut, um), zg=F(z1, z2) are calculated, where ui, uj, ut, um - values of filling of respective register digits, value of result in check connection networks zg 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. |
|
Random numbers generation method / 2246129 Method includes generating random numbers with use of displacement register with check connection, elementary digit of which is a q-based symbol (q=2l, l - binary symbol length) at length of q-based digits register, in check connection networks nonlinear two-parameter operations on q-based symbols F (ub, ud) are used, on basis of random replacement tables, for generating next random number values z1=F(ui, uj), z2=F(ut, um), zg=F(z1, z2) are calculated, where ui, uj, ut, um - values of filling of respective register digits, value of result in check connection networks zg 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. |
 Method for forming and checking of message certified with watermark / 2258315Previously for sender and receiver a binary series of digital watermark k-bit long is formed as well as binary series of secret key, message is certified at sender side using binary series of digital watermark and secret key, certified message is sent to receiver, where authenticity of received message is checked using binary series of digital watermark and secret key. |
 Method for protecting information in meteor radio channel by encryption by random natural occurrence / 2265957At receiving and transmitting stations of meteor communication system additional random characteristic is measured for current meteor radio image - time of spreading of signal from transmitter to receiver. |
 Data protection method / 2370898Invention refers to electrical communication equipment and can be used for protecting the data against unauthorised access in communication systems. The essence of the invention is that the set of random numbers, which is taken as the basis of forming symmetric encryption keys, is formed at the receiving and transmitting communications points with opposite measurements of random transmission time of sounding signals from the transmitter to the receiver. Keys are formed by means of irreversible conversions of a large number of transmission time measurements of sounding signals from the transmitter to the receiver, which has been accumulated within the specified operating time interval of information protection equipment. At that, the stored number of measurements is continuously added with successive measurement results. |
 System and method of marking desynchronised identification information of digital multimedia data / 2375825Invention relates to identification of multimedia information. The system and method of using desynchronised identification information can be used for audio applications and for video applications and includes embedding functions and detection and extraction functions. Unique keys are associated with each buyer of a copy of digital data. The embedding function includes application of pseudorandom conversion of selected embedding zones. The pseudorandom conversion key is specific for the user. Zones are selected using a secret hash function of the multimedia information. The detection and extraction functions include rough search in a set of user keys. If one of the keys is sufficiently probable, then that user is involved in making illegal copies. |
 Device for encrypting and decrypting formalised messages with hashing function / 2382504Invention relates to electrical communication, and more specifically to transmission of encrypted formalised messages. The technical outcome is achieved due to that, in the device for encrypting and decrypting formalised messages with a hashing function, which includes transmission and reception units a digest is obtained in the transmission unit via iterative cryptogram hashing using the Winternitz method, where the digest corresponds to the cryptogram. The digest is linked to the cryptogram in the memory module of the cryptogram. The combination of the digest and the cryptogram is then transmitted over a direct communication channel. Further, in the reception unit the received digest is recorded into a digest selection unit. The digest which corresponds to the received cryptogram is then calculated through iterative hashing of units of the received cryptogram identical to the analogous process in the transmission unit. The obtained digest is then compared with the received digest. If the digests coincide, the received message is sent to the output of the device, otherwise a "query" signal is generated and sent to the transmitting unit over a return channel for repetition of the cryptogram in which an error or modification was detected. |
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=2l, l - binary symbol length) at length of q-based digits register, in check connection networks nonlinear two-parameter operations on q-based symbols F (ub, ud) are used, on basis of random replacement tables, for generating next random number values z1=F(ui, uj), z2=F(ut, um), zg=F(z1, z2) are calculated, where ui, uj, ut, um - values of filling of respective register digits, value of result in check connection networks zg 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=2ll - 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 (ubudon 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 uband udthen 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 z1=F (uiuj), the second pair of values indicates the number of taps (numbers of cells of the register) to perform the second operation z2=F (utand um), the fifth value specifies the number of cells of the shift register in which to store the execution result of the third operation Zg=F (z1, z2), the operands are the results of the first two operations.
Operation F (ubudin the feedback circuit is built on the basis of table Ttocontaining 2ldistinct values of the binary combinations of length l; when the operation is found in the table the value of the first operand uband read the value from a table of the conversion, which is the number of rows that match the value of the second operand udfrom 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×(2l)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 Tto;
- 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=2ll=8, 16 bits)in the feedback circuit exercise at least three two-parameter operations on q-ary symbols based on the random substitution tables Tto, each of which contains the 2ldistinct 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 Ttothe value of the first operand and read from the table of Ttothe value is the number of rows used tables Ttocoinciding 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 Ttototal length of 3×(2l)l bit is the key, or by setting a random numbers generator.