Class / Patent application number | Description | Number of patent applications / Date published |
708254000 | Seed value controls | 22 |
20080263117 | INITIAL SEED MANAGEMENT FOR PSEUDORANDOM NUMBER GENERATOR - A secure seeding and reseeding scheme is provided for pseudorandom number generators by using a pre-stored initialization seed. This scheme initializes a pseudorandom number generator into an unknown state even when entropy collection is unavailable. A primary seed file and a shadow seed file are maintained with initialization seed information in a secure file system. If the primary seed file is corrupted, the pseudorandom number generator is seeded with the content of the shadow seed file. Additionally, a trusted timer or clock may be mixed with the pre-stored initialization seed to add entropy even when the pre-stored seed information has been compromised. | 10-23-2008 |
20090049111 | METHOD, APPARATUS AND SYSTEM FOR RESISTANCE TO SIDE CHANNEL ATTACKS ON RANDOM NUMBER GENERATORS - A random number generator (RNG) resistant to side channel attacks includes an activation pseudo random number generator (APRNG) having an activation output connected to an activation seed input to provide a next seed to the activation seed input. A second random number generator includes a second seed input, which receives the next seed and a random data output, which outputs random data in accordance with the next seed. An input seed memory is connected to the activation seed input and a feedback connection from the activation output so that the next seed is stored in the input seed memory to be used by the APRNG as the activation seed input at a next startup cycle. | 02-19-2009 |
20090150467 | METHOD OF GENERATING PSEUDO-RANDOM NUMBERS - A method of generating a pseudo-random number by means of an iteration, comprising at least two iteration steps, applied to a one-way function, wherein the one-way function, based on a start value and a key, generates part of the pseudo-random number and wherein the iteration is initialized with a random start value and a random key, and wherein, in each iteration step, both the start value and the key for an iteration step are determined from the part of the pseudo-random number determined in the previous iteration step using the one-way function. | 06-11-2009 |
20100036900 | UNCERTAINTY RANDOM VALUE GENERATOR - A system and method of generating a one-way function and thereby producing a random-value stream. Steps include: providing a plurality of memory cells addressed according to a domain value wherein any given domain value maps to all possible range values; generating a random domain value associated with one of the memory cells; reading a data value associated with the generated random domain value; generating dynamically enhanced data by providing an additional quantity of data; removing suspected non-random portions thereby creating source data; validating the source data according to a minimum randomness requirement, thereby creating a validated source data; and integrating the validated source data with the memory cell locations using a random edit process that is a masking, a displacement-in-time, a chaos engine, an XOR, an overwrite, an expand, a remove, a control plane, or an address plane module. The expand module inserts a noise chunk. | 02-11-2010 |
20100070549 | RANDOM NUMBER GENERATOR SYSTEM, METHOD FOR GENERATING RANDOM NUMBERS - According to an exemplary embodiment a random number generator system, comprises a pre-processing unit, and a random number generation unit, wherein the pre-processing unit is adapted to calculate an internal seed out of an external seed and/or system variables and/or dynamic variables related to stack, and wherein the random number generation unit is adapted to generate a random number by using a determined function, wherein the determined function is a function of the internal seed and of at least one dynamic runtime variable related to the stack. | 03-18-2010 |
20100235418 | RANDOM NUMBER GENERATOR AND RANDOM NUMBER GENERATING METHOD THEREOF - A random number generator utilizes nonlinear function to obtain high generating speed, long cycle and great quality. By utilizing equation (1): x | 09-16-2010 |
20100287225 | Random Number Generation and Management Method, and Device - The present invention relates to a method and device for generating and managing shorter random number series, such as ID and password, in which, for the given N bits binary series R and K dimensions multi-dimensional coordinate information i (i | 11-11-2010 |
20110022648 | Secure Random Number Generator - A random number generator circuit includes a first memory having multiple storage elements. Each of the storage elements has an initial state corresponding thereto when powered up by a voltage supply source applied to the first memory. The first memory is operative to generate a first signal including multiple bits indicative of the respective initial states of the storage elements. The random number generator circuit further includes an error correction circuit coupled to the first memory. The error correction circuit is operative to receive the first signal and to correct at least one bit in the first signal that is not repeatable upon successive applications of power to the first memory to thereby generate a second signal. The second signal is a random number that is repeatable upon successive applications of power to the first memory. | 01-27-2011 |
20110029588 | MODULAR UNCERTAINTY RANDOM VALUE GENERATOR AND METHOD - A system and method of generating a one-way function and thereby producing a random-value stream. Steps include: providing a plurality of memory cells addressed according to a domain value wherein any given domain value maps to all possible range values; generating a random domain value associated with one of the memory cells; reading a data value associated with the generated random domain value; generating dynamically enhanced data by providing an additional quantity of data; removing suspected non-random portions thereby creating source data; validating the source data according to a minimum randomness requirement, thereby creating a validated source data; and integrating the validated source data with the memory cell locations using a random edit process that is a masking, a displacement-in-time, a chaos engine, an XOR, an overwrite, an expand, a remove, a control plane, or an address plane module. The expand module inserts a noise chunk. | 02-03-2011 |
20110131264 | RANDOM NUMBER GENERATOR INCORPORATING CHANNEL FILTER COEFFICIENTS - A device comprising a controller configured to retrieve at least one channel filter coefficient from a plurality of registers, and to generate a random number based at least in part on the at least one retrieved channel filter coefficient. | 06-02-2011 |
20110225223 | GENERATING UNIQUE RANDOM NUMBERS FOR MULTIPLE INSTANTIATIONS - In a first embodiment of the present invention, a method for generating a random number for an instance of a hardware description language definition is provided, the method comprising: generating a unique signature for the instance; applying a message digest generation process on the unique signature to arrive at a message digest having a fixed length; and applying a random number generation process on the message digest. | 09-15-2011 |
20120030268 | Randomized value generation - A data processing apparatus is provided for producing a randomized value. A cell in the data processing apparatus comprises a dielectric oxide layer and stress voltage circuitry is configured to apply a stress voltage across the dielectric oxide layer of the cell to cause an oxide breakdown process to occur. Oxide breakdown detection circuitry is configured to determine a current extent of the oxide breakdown process by measuring a response of the dielectric oxide layer to the stress voltage and randomized value determination circuitry is configured to determine a randomized value in dependence on the current extent of the oxide breakdown process. | 02-02-2012 |
20120173599 | SYSTEM AND METHOD FOR GENERATING TRUE RANDOM NUMBERS USING COMPUTING DEVICE - In a system and method for generating true random numbers, a computing device initializes a data storage area in a memory as a buffer, and obtains random events generated by the computing device. The system converts each of the random events to a random data represented by a series of binary digits, and stores the binary digits of the random data to a data array. The binary digits of each of the data arrays are mixed into the buffer to generate a random number source. The system further retrieves a random number sequence from the random number source stored in the buffer, and generates a true random number according to the random number sequence. | 07-05-2012 |
20120179735 | SCALABLE RANDOM NUMBER GENERATION - In embodiments of scalable random number generation, a system includes one or more entropy pools that combine entropy data, which is derived from entropy sources based on event data. A root pseudo-random number generator (PRNG) maintains a seeded entropy state that is reseeded by the entropy pools, and a seed version identifier updates to indicate a current seed version of the root PRNG. Processor PRNGs are instantiated one each per logical processor in a kernel of the system, where each processor PRNG maintains a PRNG entropy state that is reseeded from the root PRNG, and a processor PRNG generates a random number from a respective PRNG entropy state when invoked. | 07-12-2012 |
20120290632 | METHOD OF GENERATING RANDOM NUMBERS II - A method of obtaining uniform and independent random numbers is given
| 11-15-2012 |
20130103731 | Systems and Methods for Efficient Data Channel Testing - Various embodiments of the present invention provide systems and methods for data processing. For example, a data processing system is disclosed that includes: a data detector circuit, a pseudo-random sequence generator circuit, a decoder circuit, and a pseudo-random sequence reconstitution circuit. The data detector circuit is operable to apply a data detection algorithm to a first data set to yield a detected output. The pseudo-random sequence generator circuit is operable to generate an interim data sequence and to generate a second data set based upon a combination of the detected output and the interim data sequence. The decoder circuit is operable to apply a data decode algorithm to a derivative of the second data set to yield a third data set. | 04-25-2013 |
20130304781 | GENERATION OF SEED VALUE FOR PSEUDO RANDOM NUMBER GENERATOR - Two or more numerical samples are read from a storage location (or many storage locations) and the samples are compared to generate a single bit of entropy. This method is repeated to populate two arrays which are also compared to generate a single bit. Comparison of the arrays is also repeated to generate a sequence of bits which are formed into computer words. The words are combined with a shift register to generate a seed block array of any length. The seed block array is used to seed a pseudo random number generator. The storage location is a register, accumulator, buffer, clock, address, memory location, etc., that changes periodically. Comparison may be performed by counting the number of certain types of bits in the two values and returning a one or zero depending upon the count. | 11-14-2013 |
20140025718 | CIRCUIT AND METHOD FOR GENERATING RANDOM NUMBER - A circuit and a method for generating a random number are provided. The circuit for generating the random number includes an analog-to-digital converter and a controller. The analog-to-digital converter sequentially generates a plurality of digital data in response to an analog signal. The controller utilizes an estimation procedure to sequentially analyze a variation trend of the plurality of digital data in a time sequence or extract components of the plurality of digital data within a preset frequency band. In addition, the controller generates a true random number based on a result of the estimation procedure. | 01-23-2014 |
20140040338 | RANDOM NUMBER GENERATING SYSTEM BASED ON MEMORY START-UP NOISE - A random number generating system for generating a sequence of random numbers comprising a memory, the memory being writable, volatile and configured such that the memory contains an at least partially random memory content upon each powering-up of the memory, an instantiating unit configured for seeding the random number generating system with a seed dependent upon the at least partially random memory content, the sequence of random numbers being generated in dependence upon the seed, and an over-writing unit configured for over-writing at least part of the memory with random numbers generated by the random number generating system in dependence upon the seed. | 02-06-2014 |
20140280414 | INSTRUCTION FOR PERFORMING A PSEUDORANDOM NUMBER SEED OPERATION - A machine instruction is provided that includes an opcode field to provide an opcode, the opcode to identify a perform pseudorandom number operation, and a register field to be used to identify a register, the register to specify a location in memory of a second operand to be used. The machine instruction is executed, and execution includes obtaining a modifier field of a register associated with the machine instruction; based on the modifier field having a first value, performing a deterministic pseudorandom number seed operation, which includes obtaining seed material based on information stored in the second operand; using a 512 bit secure hash technique and the seed material to provide one or more seed values; and storing the one or more seed values in a parameter block. | 09-18-2014 |
20140337399 | METHOD OF GENERATING RANDOM NUMBERS III - A system and method of generating uniform and independent random numbers is given by comprising two distinct odd primes that give an odd integer and an even integer, together with by taking an integer exponent and an integer exponent, by forming the composite modulus by taking a primitive root modulo and a primitive modulo and giving the multiplier modulo by either the system of congruence relations, any of which determines the multiplier modulo uniquely, by taking an initial value coprime. The method generates the sequence of integers by recursive congruence relations and gives an output of uniform and independent random numbers. | 11-13-2014 |
20150081751 | INSTRUCTION FOR PERFORMING A PSEUDORANDOM NUMBER SEED OPERATION - A machine instruction is provided that includes an opcode field to provide an opcode, the opcode to identify a perform pseudorandom number operation, and a register field to be used to identify a register, the register to specify a location in memory of a second operand to be used. The machine instruction is executed, and execution includes obtaining a modifier field of a register associated with the machine instruction; based on the modifier field having a first value, performing a deterministic pseudorandom number seed operation, which includes obtaining seed material based on information stored in the second operand; using a 512 bit secure hash technique and the seed material to provide one or more seed values; and storing the one or more seed values in a parameter block. | 03-19-2015 |