Abstract: A processing system to serve as a source device for protected digital content comprises a processor and control logic. When used by the processor, the control logic causes the processing system to receive a digital certificate from a presentation device. The processing system then uses public key infrastructure (PKI) to determine whether the presentation device has been authorized by a certificate authority (CA) to receive protected content. The processing system may also generate a session key and use the session key to encrypt data. The processing system may transmit the encrypted data to the presentation device only if the presentation device has been authorized by the CA to receive protected content. Presentation devices and repeaters may perform corresponding operations, thereby allowing content to be transmitted and presented in a protected manner. Other embodiments are described and claimed.

Abstract: A method and a generator for generating a pseudo-random data sequence (3), including combining means for combining data belonging to a plurality of initial data sequences (9a, 9b, 9c) using a procedure for searching for at least one search pattern.

Abstract: A quantum random number generation system includes a source of light output as a plurality of coherent states such that each state has an indeterminate number of photons, a photodetector arranged to receive the light output from the light source and to generate a photocurrent dependent on the number of photons in each coherent state, and processing circuitry connected to receive the photocurrent and arranged to convert it to generate a sequence of random numbers.

Abstract: A method, system and program product for computer information retrieval is disclosed. A matrix A is received. Random sign matrices S and R are generated. Matrix products of S^T*A, A*R, and S^T*A*R are computed. A Moore-Penrose pseudoinverse C of S^T*A*R is computed. A singular value decomposition is computed of the pseudoinverse C. Three matrices ARU, Sigma, and V^TS^TA are outputted as factorization in applications.

Abstract: Apparatus for testing a random number generator includes a random number generating unit that generates and outputs random numbers, and a switching unit that receives the random numbers from the random number generating unit and selectively transmits the random numbers in response to a switching control signal. A test unit performs a basic test on the random numbers to determine whether the transmitted random numbers are within a statistical range, controls the generation of random numbers according to a result of the basic test, and outputs the switching control signal based on whether a test suite is finished.

Abstract: Extending entropy in a random number generation utility. Where a device has access to trusted sources of encrypted data, such as encrypted network traffic, such encrypted network traffic may be sampled and the bits fed into the entropy seeding routines of the random number generation utility.

Abstract: Certain embodiments of the present invention relate to methods and apparatuses for providing random numbers for a gaming system. A random number generator (RNG) processor is arranged to select a plurality of RNG system components and configure them in an RNG pipeline, to provide random numbers to a gaming system. In one embodiment, a true random number generator (TRNG) is used to generate seeds for a pseudo random number generator in the pipeline. Analysers, loggers and other elements may also be included in the pipeline.

Abstract: Generating a number based on mask and range constraints. For example, a method of generating a pseudo random number satisfying a range constraint and a mask constraint may include determining a number of possible solutions satisfying the range constraint and the mask constraint; selecting an index representing a solution of the possible solutions; and generating the pseudo random number based on the index. Other embodiments are described and claimed.

Abstract: A system and method for estimating a signal based on a stream of randomly generated samples. The method includes: (a) receiving a sample; (b) generating a sampling vector; (c) multiplying the sample and the sampling vector to obtain a current back projection; (d) computing a first intermediate vector that represents an average of the current back projection and previous back projections; (e) transforming the first intermediate vector to determine a second intermediate vector; (f) identifying locations where the second intermediate vector attains its k largest values; (g) computing an estimate for the transformation of the signal by solving a system of equations based on the identified locations, the received sample value, previously received sample values, the sampling vector and previously generated sampling vectors; (h) inverse transforming the transformation estimate to determine an estimate of the signal; and (i) storing the signal estimate.

Abstract: The present invention relates to a random-number generating apparatus and method for generating physical random numbers in accordance with noises randomly generated by a noise generating element, and allows for generating true random numbers at a high speed and uniformizing the generation frequency of each random number value, even in a simplified circuit configuration. The random-number generating apparatus is operable to amplify a waveform based on thermal noises generated in a thermal-noise generating element, and generate a random pulse at the time when the amplified output signal exceeds a given threshold from the state of being less than the threshold. The random-number generating apparatus is also provided with a reference-pulse generator for generating a reference pulse having a constant period, and a timer for measuring a time interval between the reference pulse and the random pulse. The measured value in the timer is output as a random number value.

Abstract: A method for accelerating a pseudo-random input bit flow (PRBS(T1)), generated at a first relatively low dock frequency (f1), into an identical output bit flow (PRBS(T0)) at a second relatively high dock frequency (f0), comprising: collecting the output bit flow, delaying the collected flow by a predetermined value (?); and combining the delayed flow with the input bit flow.

Abstract: Generating a number based on mask and range constraints. For example, a method of generating a pseudo random number satisfying a range constraint and a mask constraint may include determining a number of possible solutions satisfying the range constraint and the mask constraint; selecting an index representing a solution of the possible solutions; and generating the pseudo random number based on the index. Other embodiments are described and claimed.

Abstract: Method and device for generating factors of a RSA modulus N with a predetermined portion Nh, the RSA modulus comprising at least two factors. A first prime p is generated; a value Nh that forms a part of modulus N is obtained; a second prime q is generated in an interval dependent from p and Nh so that pq is a RSA modulus that shares Nh; and information enabling the calculation of the modulus/V is outputted.

Abstract: An apparatus for generating random data includes a raw random sequence source adapted to generate a raw random sequence and a digital post processor adapted to process the raw random sequence to generate the random data, wherein the digital post-processor includes a synchronous finite state machine having at least one input adapted to repeatedly receive a current value of the raw random sequence and at least one output to provide a current output value depending on previous values of the raw random sequence.

Abstract: A two-stage block synchronization and scrambling module includes a synchronization PRNG module, a scramble PRNG module, a summing module, and a storage module. The synchronization PRNG module is clocked once per N+1 bit PCS frame (N arbitrary) to produce a synchronization bit and a pseudo-random starting state for the scramble PRNG. The scramble PRNG module is clocked N times per PCS frame to produce a cipher stream starting with a pseudo-random state from the synchronization PRNG. The summing module is operably coupled to sum the cipher stream and a PCS frame payload to produce scrambled payload. The storage module is operably coupled to store the scrambled payload with the synchronization bit. Synchronization bits from successive frames are a running bit-serial representation of the synchronization PRNG state and are used by the receiver to synchronize with the transmit scrambler.

Abstract: A stream stretcher is provided for securely expanding a key stream to match the length of a data block to be encrypted and/or decrypted. A key stream is obtained having a length of LZ bits. A length LD corresponding to a data block to be encrypted/decrypted is obtained, where LD>LZ. LD?LZ new bits are recursively generated by combining at least two bits of the key stream. The LD?LZ new bits are appended to the key stream to generate a stretched key stream. The data block may then be encrypted/decrypted with the stretched key stream. The at least two bits are selected to have offsets that form a full positive difference set.

Abstract: Method and apparatus for ensuring randomness of pseudo-random numbers generated by a conventional computer operating system or electronic device. Typically pseudo-random number generators used in computer operating systems or electronic devices may be penetrated by a hacker (pirate), who penetrates a cryptographic or other supposedly secure process using the random numbers by tampering with the input random numbers, thus making them nonrandom. The present method and apparatus are intended to verify such random numbers to make sure that they are indeed random enough, by applying suitable random tests. Only if the values pass the test are they passed on for use in the cryptographic or other process. If they fail the test, a new set of random numbers is requested from the pseudo-random number generator. These are again tested. Further a diversity function may be applied to the random numbers even if they have passed the random number test in order to improve their randomness.

Abstract: Handling mask and range constraints. For example, a method of handling range and mask constraints, may include determining whether or not to utilize a mask constraint and a range constraint by determining whether or not the range and mask constraints are satisfiable. Other embodiments are described and claimed.

Abstract: A random number generation device including a first random number generation part which generates a new random number based on a random number which was previously generated and which outputs the random number generated by the first random number generation part, the random number generation device includes: a second random number generation part which generates a random number different from the random number generated by the first random number generation part; and an operation part which outputs a random number obtained by a prescribed operation using a random number generated by the second random number generation part on a random number generated by the first random number generation part when generating a first random number after start of supplying electric power.

Abstract: A microprocessor including random cache line refill ordering to lessen side channel leakage in a cache line and thus thwart cryptanalysis attacks such as timing attacks, power analysis attacks, and probe attacks. A random sequence generator is used to randomize the order in which memory locations are read when filling a cache line.

Abstract: A seed for use in a cryptographic operation for an electronic device is determined by estimating the number of entropy data bits needed to satisfy a predetermined security strength of the cryptographic operation. The estimation is based on an entropy strength of a string of entropy data bits. Entropy strength is a measure of randomness. Furthermore, guiding a determination of the seed differently according to the estimated number of entropy data bits may be performed.

Abstract: A system having a pseudo random number generator, a control circuit being configured to increase a quality of a pseudo random number output signal of the pseudo random number generator by coupling the pseudo random number generator with a true random number output signal of a true random number generator and a consumer circuit being configured to use the pseudo random number output signal before and after the increase.

Abstract: Methods for transposing elements of a sequence according to a rule, wherein the rule is derived from pseudo-noise or pseudo-noise like binary and non-binary sequences are disclosed. Sequences of transposed symbols can be recovered by applying a reversing rule. Sets of orthogonal hopping and transposition rules are created by applying transposition rules upon themselves. Sets of orthogonal hopping and transposition rules are also created from binary and non-binary Gold sequences.

Abstract: The present invention relates to a method and a device (11) using a physical token (14), which provides measurable parameters, to derive at least one data set. A plurality of values of one or more of the parameters are measured. From these measured values, a measure of variance is calculated. Quantization intervals into which a measured value is to be quantized are then determined. A possible value of a data set, which subsequently can be derived from a measured value provided by the physical token, is associated with each quantization interval. Further, information which subsequently enables determination of these quantization intervals is stored. Hence, an enrolling phase has been completed. When the preparing phase has been completed, a deriving phase may commence. When a data set is to be derived, for example to be used as a cryptographic key, a value of any one of the parameters provided by the PUF is measured.

Abstract: Described herein are embodiments of methods, devices and computer program products of a utility service meter comprising a random number generator.

Abstract: A method of generating a set of unique pseudorandom N-digit base-B integers includes the steps of selecting an integer A, wherein A is equal to or greater than 0 and equal to or less than BN?1, and adding to integer A an integer P, modulus BN, wherein P is equal to or greater than 0 and equal to or less than BN?1, and wherein P and N are relatively prime, to obtain a first element of the set. The method generates a second element of the set by adding P to the first element, modulus BN. The method generates the complete set of unique pseudorandom N-digit base-B integers by repeating the process BN times. Elements of the set may be used to populate a data set.

Abstract: Methods and a system are disclosed for one or more appliances including a controller for managing power consumption within a household. The controller is configured to receive and process a signal indicative of one or more energy parameters of an associated energy utility, including at least a peak demand period or an off-peak demand period. A generated serial number is obtained from an original serial number of the appliance or controller, which is configured for a signal to communicate to the appliance within a population and command the appliance to operate in an energy savings mode and a normal mode at various time periods. The generated serial number (GSN) is used to segregate a total population into segments to provide granularity in assigning DR activations and deactivations based upon the GSN.

Abstract: A random number generator uses the output of a true random generator to alter the behavior of a pseudo-random number generator. The alteration is performed by a mixing logic that builds a random seed for the pseudo-random number generator and includes a generator of an alteration signal, the generation of which exploits the random instant of arrival of the bits outgoing from the true random generator. The alteration signal is obtained by processing the seed by means of the pseudo-random sequence.

Abstract: A random number generator circuit includes: an element generating and outputting physical random numbers; a digitizing circuit digitizing the physical random numbers to output a random number sequence tested by a testing circuit; and an error correcting code circuit including a shift register having the random number sequence input thereto, a multiplier multiplying the stored random number sequence by an error-correcting-code generating matrix, and a selector switch outputting one of an output of the shift register and an output of the multiplier in accordance with a test result obtained by the testing circuit. The error correcting code circuit outputs the output of the multiplier as a corrected random number sequence from the selector switch when the result of a test conducted by the testing circuit indicates a rejection. The testing circuit tests the corrected random number sequence when the result of the test indicates a rejection.

Abstract: A processing system to serve as a source device for protected digital content comprises a processor and control logic. The processing system may generate and save a first master key, and may transmit that key to a first receiving device for use during a first session. During a second session, the processing system may obtain an identifier for a candidate receiving device. The processing system may use the identifier to determine whether the processing system contains a master key for the candidate receiving device. If the processing system such a master key, the processing system may send verification data concerning that key to the candidate receiving device, and may use that key to encrypt a session key for the second session. If not, a second master key may be generated and transmitted to the candidate receiving device for use during the second session. Other embodiments are described and claimed.

Abstract: A method, system and apparatus that advantageously provide a security protocol for data security. The apparatus includes a random number generator for generating random numbers and a share calculator in communication with the random number generator, the share calculator processes the data to generate one or more encoded data shares where the processing is based at least in part on the random numbers. The apparatus may further include a router that routes the encoded data shares, a switching fabric and associated logic. The data security system includes one or more storage devices that store client data and a splitter that controls access to the client data stored on the one or more storage devices where the splitter apparatus encodes at least a portion of the client data that is stored on the one or more storage devices.

Abstract: A Pseudo Random Bit Sequence (PRBS) generator is provided with components to enable operation at very high microwave frequencies with inexpensive components. The PRBS generator initially replaces the D flip-flops of a conventional PRBS generator with delay lines connected in a similar manner. Further, an exclusive OR (EXOR) gate used in a conventional device is replaced in one embodiment by a mixer and amplifier. In another embodiment, the EXOR gate is replaced by a Gilbert Cell. In some embodiments, complementary outputs of an EXOR gate are connected to separate delay lines to reduce components needed for the PRBS generator.

Abstract: A random binary sequence generator for generating a random binary sequence adapted to be used for producing random numbers, includes at least one logic circuit corresponding to an associated finite-state machine having a state-transition function including states arranged to form cycles of states, wherein the at least one logic circuit has a set of logic circuit inputs and a set of logic circuit outputs fed back to the logic circuit inputs; the associated finite-state machine is autonomous and asynchronous; the state-transition function is void of loops; and any of the cycles of states has either a minimum length equal to three states, in case the cycle is stable, or a minimum length of two states, in case the cycle is meta-stable.

Abstract: A method for generating an accelerated and/or decelerated chaotic sequence. The method involves selecting a plurality of polynomial equations constructed from an acc-dec variable v. The method also involves selecting a value for the acc-dec variable v for advancing or stepping back a chaotic sequence generation by at least one cycle at a given time. The method further involves using residue number system (RNS) arithmetic operations to respectively determine solutions for the polynomial equations using the acc-dec variable v. The solutions iteratively computed and expressed as RNS residue values. The method involves determining a series of digits in a weighted number system based on the RNS residue values.

Abstract: Techniques are presented for randomly generating bits. A seed is inverted and a non repeating portion of the resulting digits from the inversion are retained. The inverted seed is then raised to a power to acquire another non repeating portion or additional digits. This process is repeated for a desired number of iterations. The resulting digits are then selectively combined to generate a stream of randomly generated bits with an infinite period.

Abstract: 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.

Abstract: Systems and/or methods that facilitate security of data are presented. A random number generation component generates random numbers based in part on electron activity in a select memory cell(s) to facilitate data security. Sensor components that are highly sensitive can be employed to sense activity of the select memory cell(s) and/or reference memory cell in a noise margin associated with respective memory cells in the memory component. The activity of the select memory cell is compared to the reference memory cell(s) to facilitate generating binary data. The binary data is provided to the random number generation component where the binary data is evaluated to determine whether a predetermined level of entropy exists in the binary data. The binary data, or a portion thereof, can be processed to generate random numbers that are utilized in cryptographic processes and/or as a physical signature to facilitate data security.

Abstract: A method for random number generation includes generating random number sequences using a Random Number 5 Generator (RNG) circuit having an externally-modifiable configuration. The RNG circuit generates a first random number sequence having a first measure of randomness, and modifies the configuration of the RNG circuit, causing the RNG circuit to generate a second random number sequence having a second measure of the randomness, indicating a degree of the randomness that is no less than the first measure.

Abstract: A method of generating a pseudorandom data sequence, wherein said pseudorandom data sequence is generated by a procedure for searching for a search pattern in an initial data sequence of N bits, said search procedure comprising the following steps: (a) detecting in said initial data sequence a particular search pattern of r bits that is one of a set of search patterns; (b) determining an output pattern of k bits by an operation that depends on the progress of the preceding step; and repeating the preceding steps (a) and (b) successively to form the pseudorandom data sequence from a succession of output patterns.

Abstract: Aspects of a method and system for constant amplitude random sequence construction may include generating one or more real signal components via a random number generator, wherein each of the generated one or more real signal components may be subjected to an amplitude constraint. One or more corresponding imaginary signal components may be generated, each of which may be derived from a relationship between the generated one or more real signal components and the amplitude constraint. At least the generated one or more real signal components and the generated one or more corresponding imaginary signal components may be combined to generate a complex constant amplitude signal. The one or more real signal components may be generated according to a probability distribution in the random number generator.

Abstract: A pseudorandom number generator reduced in size while maintaining high security is disclosed. The generator has a state storage unit of 2 blocks (n bits per block) and a buffer of plurality of blocks, and mixes their contents to obtain a random number sequence. The mixing is done by a nonlinear transformation unit for inputting the stored content of the buffer to output data of the same size as the input data, a first linear transformation unit for inputting the content of the state storage unit and the output of the nonlinear transformation unit to store an output into the state storage unit, and a second linear transformation unit for inputting the stored content of the buffer and the stored content of the state storage unit to store an output into the buffer. The mixed content of the state storage unit is output as a random number sequence.

Abstract: A method of generating a random number using a multiplier oscillation, the method comprising providing a multiplier circuit coupled to receive a first digital input and a second digital input, wherein the first digital input and the second digital input are asynchronous signals and the first digital input comprises a feedback signal based upon an output of the multiplier circuit; allowing the multiplier to enter a state of feedback oscillation; and generating a random number based upon the output of the multiplier circuit. The method may further comprise providing a plurality of adders receiving feedback signals.

Abstract: A random number generator generates a string of random bits from a received RF signal source. A sample-and-hold circuit is coupled to the received RF signal source. The RF signal is sampled by a jittered clock signal from a source coupled to the sample-and-hold circuit. The frequency of the jittered clock signal is less than frequency of the received RF signal. The random number appears at the output of the sample-and-hold circuit.

Abstract: In the field of direct mind-machine interactions, prior art devices and methods do not provide sufficiently fast and reliable results. Mental influence detectors (100, 140, 400, 430) and corresponding methods provide fast and reliable results useful for detecting an influence of mind and hidden or classically non-inferable information. An anomalous effect detector (100) includes a source (104) of non-deterministic random numbers (110), a converter (114) to convert a property of numbers, a processor to accept converter output (118) and to produce an output signal (124) representative of an influence of mind. The processor output signal (124) contains fewer numbers than the input (110).

Abstract: A method for evaluating a function of a finite field of characteristic p into itself, for an element x of the field, uses an evaluation, for the element x, of a polynomial formed by a plurality of monomials. The evaluation of the polynomial includes the following steps: determining monomials the degree of which is an integer power of the characteristic p by successive raisings of the element x to the power p; and determining monomials the degree of which is different from an integer power of the characteristic p on the basis of the determined monomials, the degree of which is an integer power of the characteristic p, and by at least one multiplication. An evaluating device is also provided.

Abstract: Method and device for creating a starting value for a pseudorandom number generator, having a reader configured to unstably read out an output value from a memory cell and a determiner configured to determine the starting value on the basis of the output value of the memory cell.

Abstract: A method and apparatus for performing a self-test of a plesiochronous link. A pseudorandom serial bit pattern is generated by the transmitter from a linear feedback shift register (LFSR) based on a primitive polynomial of a specific order and transmitted across a plesiochronous link. Bits of this transmitted pattern are received and deserialized into n parallel bits. In the receiver, given the current n bits in the bit pattern, the next n bits that are expected in the bit pattern are computed in advance. The next n compare bits thus generated are delayed and compared when the next n bits from the transmitted pattern arrive at the receiver and an error is signaled in the case of a mismatch. The method further repeats the receiving, deserializing and computing the next expected bits for each n bits of the received pattern.

Abstract: A method, system and program product for computer information retrieval is disclosed. A matrix A is received. Random sign matrices S and R are generated. Matrix products of S?T*A, A*R, and S?T*A*R are computed. A Moore-Penrose pseudoinverse C of S?T*A*R is computed. A singular value decomposition is computed of the pseudoinverse C. Three matrices ARU, Sigma, and V?TS?TA are outputted as factorization in applications.

Abstract: Methods of securely communicating a message from a first terminal to a second terminal include generating a keypad including a random sequence of bits having a length L, encrypting the message at the first terminal using a bit string beginning at an offset O in the keypad, and transmitting the encrypted message and an indicator of the offset O to the second terminal. A communication terminal includes a controller, a communication module configured to establish a location-limited communication channel, and an encryption unit configured to store a keypad including a random sequence of bits having a length L, to encrypt an outgoing message using the keypad, and to decrypt an incoming message using the keypad.

Abstract: Disclosed is a method for deriving random numbers at a higher speed than ever before while maintaining desired randomness without spoiling uniformity of the occurrence frequency of each random number. One pulse included in one of two or more mutually-independent random pulse sequences and one pulse included in one of the remaining random pulse sequences are used, respectively, as a start pulse and a stop pulse. Then a time interval between the start pulse and the stop pulse is measured, and the measured value is output. The pulses temporally occur in a random manner, and therefore the obtained sequence of numerical values becomes random numbers. Specifically, in FIG. 1, time intervals t1 to t4 are measured, and these measured values (in FIG. 1, four values) are derived as random numbers.