Abstract: A method and apparatus for testing operation of a random number generator (RNG) testing circuit are provided. In accordance with at least one embodiment, a first RNG output value obtained from a RNG is stored in a first register. In response to activation of a test mode to simulate a faulty RNG, the first RNG output value is stored in a second register. The first RNG output value in the first register is compared to the first RNG output value in the second register. In response to the comparing, a RNG failure signal is provided at a RNG testing circuit output of the RNG testing circuit. In accordance with at least one embodiment, sequential and combinational logic can simulate a faulty RNG. Accordingly, simulation of a faulty RNG may be performed to test a RNG testing circuit even when the RNG is not faulty.

Abstract: A random number generator may include an input configured to receive a plurality of entropy bits generated by an entropy source of a random number generator, wherein the random number generator is configured to generate a plurality of random numbers; and an entropy health monitor coupled with the input, wherein the entropy health monitor is configured to perform a corrective action based on the plurality of entropy bits.

Abstract: In a method of generating a digital signature of a message m, a signature component s of the digital signature is calculated by first masking the long-term private key d using a single additive operation to combine the key d with a first value. The masked value is then multiplied by a second value to obtain component s. The first value is calculated using the message m and another component of the digital signature, and the second value is derived using the inverse of a component of the first value. In this way, the signature component s is generated using a method that counters the effectiveness of side channel attacks, such as differential side channel analysis, by avoiding a direct multiplication using long-term private key d.

Abstract: A system including a memory to store a plurality of digital random numbers generated by a digital random number generator, a plurality of cores coupled to the memory, the plurality of cores accessing the memory to retrieve digital random numbers.

Abstract: Random number generation apparatus (2) is described that comprises a threshold detector (4) and an electrical noise generator (6). The electrical noise generator (6) has at least two channels (8a-8d) and each channel is arranged to generate an electrical noise signal. The threshold detector (4), which may comprise a digital input-output (DIO) card, is arranged to periodically compare this electrical noise signal with a threshold and to provide a binary data output that indicates whether the threshold has been exceeded. Each channel of the electrical noise generator comprises at least two amplifiers (10a-10c) electrically connected in series that preferably provide a gain of 50,000 or more. Use of the random number generation apparatus (2) for quantum cryptography applications is also described.

Abstract: An apparatus for low complexity sub-Nyquist sampling of sparse wideband signals is provided, including a mixer, a periodic random sequence generator and a filter bank. The periodic random sequence generator generates a periodic pseudo-random sequence. The mixer is connected to the periodic random sequence generator for receiving the periodic pseudo-random sequence and mixing with an input signal to obtain a modulated signal. The filter bank further includes a plurality of filters and is connected to the mixer for filtering the modulated signal. The sub-Nyquist sampling apparatus may further includes a plurality of analog-to-digital convertors (ADCs), with each ADC connected to each filter of the filter bank to sample the signal from the filter bank and output a sampling signal.

Abstract: A random number generating device includes a processing request part, a receiving part, a counting part, and a random number generation part. The processing request part makes a request for a predetermined processing to a processing requested object. The receiving part receives a response from the processing requested object in response to the request. The counting part performs a counting operation to increase or decrease a count value with a predetermined cycle, the counting operation being started at least prior to receipt of the response. The random number generation part acquires at least one count value of the counting part at least one predetermined acquisition timing after the receipt of the response is started, and generates a random number by using the at least one count value that is acquired.

Abstract: Disclosed herein are systems, methods, and non-transitory computer-readable storage media for generating random data at an early stage in a boot process. A system practicing the method performs, by a processor based on a first clock, a group of reads of a counter running on a second clock to yield entropy words. In order to produce words with entropy, the system introduces a progressively increasing delay between each of the group of reads of the counter. The system generates entropy words by filling the buffer with successive reads of the least significant bit of the counter and then generates random data by applying a hash algorithm to the entropy words stored in the buffer.

Abstract: A system and method for producing cryptographic keys for use by an embedded processing device within a manufactured product. A pseudo random number generator is seeded with entropy data gathered by the embedded device, and the result is used to generate a public-private key pair. The process can be carried out during manufacturing so that the public key of each manufactured product can be stored in a database along with a unique identifier for the embedded device associated with the key. In one particular example, a vehicle having an installed telematics unit uses the key generating process to self-generate keys using entropy data available to the vehicle.

Abstract: A method and apparatus for generating random numbers based on packetized media data comprising querying one or more packetized media devices for a predetermined number of bits from one or more current real-time transport protocol (RTP) session, receiving the predetermined number of bits from the one or more packetized media devices, assembling the predetermined number of bits into a set of bytes; and converting the second set of bytes into a numerical value.

Abstract: Embodiments include bitstring generators and methods of their operation. A sampling parameter of the bitstring generator is set to a current value, and values of one or more bits are then repeatedly sampled based on the current value of the sampling parameter. The repeated sampling results in a set of test bits, which is analyzed to determine a randomness measurement associated with the set of test bits. A determination is made whether the randomness measurement meets a criterion. If not, the current value of the sampling parameter is changed to a different value that corresponds to a lower probability of being able to correctly predict the values of the one or more bits produced by the bitstring generator. The steps of repeatedly sampling, analyzing the set of test bits, and determining whether the randomness measurement meets the criteria are then repeated.

Abstract: A parallel computer system adds entropy to improve the quality of random number generation by using parity errors as a source of entropy because parity errors are influenced by external forces such as cosmic ray bombardment, alpha particle emission, and other random or near-random events. By using parity errors and associated information to generate entropy, the quality of random number generation in a parallel computer system is increased.

Abstract: The present invention discloses a pseudo-random bit sequence (PRBS) generator which outputs the entire datapath, or entire pseudo-random bit sequence, over one single clock cycle. This is accomplished by removing redundancy, or any redundant exclusive-or gates from linear feedback shift registers; using logic to identify the critical path and optimal shift for the critical path; and dividing the datapath into several pipeline stages to increase the clock rate (i.e., transmission speed).

Abstract: A parallel computer system adds entropy to improve the quality of random number generation by using parity errors as a source of entropy because parity errors are influenced by external forces such as cosmic ray bombardment, alpha particle emission, and other random or near-random events. By using parity errors and associated information to generate entropy, the quality of random number generation in a parallel computer system is increased.

Abstract: Novel random number generation methods and random number generators (RNG)s based on continuous-time chaotic oscillators are presented. Offset and frequency compensation loops are added to maximize the statistical quality of the output sequence and to be robust against parameter variations and attacks. We have verified both numerically and experimentally that, when the one-dimensional section was divided into regions according to distribution, the generated bit streams passed the tests used in both the FIPS-140-2 and the NIST 800-22 statistical test suites without post processing. Numerical and experimental results presented in this innovation not only verify the feasibility of the proposed circuits, but also encourage their use as the core of a high-performance IC RNG as well.

Abstract: A storage circuit 2 in the form of a master slave latch includes a slave stage 6 serving as a bit storage circuit. The slave stage 6 includes an inverter chain which when operating in a normal mode includes an even number of inverters 10, 12 and when operating in an random number generation mode includes an odd number of inverters 10, 12, 14 and so functions as a free running ring oscillator. When a switch is made back from the random number generation mode to the normal mode, then the oscillation ceases and a stable pseudo random bit value is output from the bit value storage circuit 6.

Abstract: A method for generating a random number with nRND bits BRi includes providing, in a memory, a static bit table (BFT) with mBFT addressable bits BTj, where 0?j?mBFT?1. The static bit table contains an equal number of “0” bits and “1” bits in a random distribution. In addition, for a bit BRi of said random number with 1?i?nRND, the method further includes generating, by a processor, an address FA in the range between 0 and mBFT?1, selecting, by the processor, the bit BTFA having the address FA from said static bit table, and setting, by the processor, said bit BRi of said random number to equal said bit BTFA from said static bit table (BRi=BTFA).

Abstract: A memory device includes but is not limited to a substrate, a non-volatile memory array integrated on the substrate, and random number generator logic integrated with the non-volatile memory array on the substrate. The random number generator logic is operable to perform at least one random number generator function in association with the non-volatile memory array. In addition to the foregoing, other aspects are described in the claims, drawings, and text forming a part of the present disclosure.

Abstract: A system and method is disclosed which may include providing at least one processor with an integrally disposed random number generator (RNG) therein; entering a protected mode by said at least one processor; and generating a random number using said RNG in said at least one processor after entering said protected mode.

Abstract: A random number generation apparatus and method using input time information is provided. The random number generation apparatus using input time information includes an information obtainment unit for obtaining input time information from input means. An initial value calculation unit calculates an initial value for random number generation using the input time information. A random number generation unit generates a random number using the initial value for random number generation.

Abstract: An apparatus is provided. The apparatus comprises a polynomial register having a plurality of bits, a first bus, a second bus, and a transceiver that is coupled to the first bus, the second bus, and the polynomial register. The polynomial register is configured to store a user-defined polynomial, and the transceiver includes a pseudorandom bit sequence (PRBS) generator is configured to generate a scrambled signal from the user-defined polynomial and a PRBS checker that is configured to generate a descrambled signal from a second signal using the user-defined polynomial.

Abstract: A random number generator system that utilizes a magnetic tunnel junction (MTJ) that is controlled by an STT-MTJ entropy controller that determines whether to proceed with generating random numbers or not by monitoring the health of the MTJ-based random number generator is illustrated. If the health of the random number generation is above a threshold, the STT-MTJ entropy controller shuts down the MTJ-based random number generator and sends a message to a requesting chipset that a secure key generation is not possible. If the health of the random number generation is below a threshold, the entropy controller allows the MTJ-based random number generator to generate random numbers based on a specified algorithm, the output of which is post processed and used by a cryptographic-quality deterministic random bit generator to generate a security key for a requesting chipset.

Abstract: Various methods and systems related to chaos-based pseudo-random number generation are presented. In one example, among others, a system includes a pseudo-random number generator (PRNG) to generate a series of digital outputs and a nonlinear post processing circuit to perform an exclusive OR (XOR) operation on a first portion of a current digital output of the PRNG and a permutated version of a corresponding first portion of a previous post processed output to generate a corresponding first portion of a current post processed output. In another example, a method includes receiving at least a first portion of a current output from a PRNG and performing an XOR operation on the first portion of the current PRNG output with a permutated version of a corresponding first portion of a previous post processed output to generate a corresponding first portion of a current post processed output.

Abstract: The invention relates to semiconductor devices, and more particularly, to systems, devices and methods of utilizing inherent differences among physical elements in an electrical component to generate unique and non-duplicable numbers that are statistically random and repeatable. These bits may be applied as identifications, random number seeds or encryption keys in many security applications, e.g., a financial terminal. An integrator is coupled to a plurality of physical elements, selects two physical elements or element sets, and generates an integrated difference signal according to a difference between these two physical elements or element sets. A comparison-decision logic further determines whether the difference between the selected two physical elements is associated with a bit of “1” or “0”. In some embodiments, a multi-bit number constitutes multiple bits each of which may be derived from a difference between two randomly selected physical elements or element sets.

Abstract: When an encryption processing circuit encrypts data, a current flows in the encryption processing circuit. A noise current generated by a noise generation circuit is superimposed on the current consumed by the encryption processing circuit. The present invention is applicable to an IC chip that encrypts plaintext data using a key, thus preventing the key from being broken by DPA attacks based on analysis of the current consumption to provide high security.

Abstract: A rollable random number generator (1) for providing a random value. The random number generator comprises a processor (11) controllable by a movement sensor (17) and the processor (11) being arranged to be programmable to present the random value as a desired message.

Abstract: An apparatus includes: a plurality of bit producing circuits; a controller setting a sample frequency at which bits from the bit producing circuits are sampled; and a plurality of test circuits determining if bits sampled from each of the bit producing circuits are random, wherein the controller adjusts the sample frequency if the test circuits determine that the sampled bits are not random. A method performed by the apparatus is also included.

Abstract: Systems and/or methods that facilitate secure electronic communication of data are presented. A cryptographic component facilitates securing data associated with messages in accordance with a cryptographic protocol. The cryptographic component includes a randomized exponentiation component that facilitates decryption of data and generation of digital signatures by exponentiating exponents associated with messages. An exponent is divided into more than one subexponent at an exponent bit that corresponds to a random number. Exponentiation of the first subexponent can be performed based on a left-to-right-type of exponentiation algorithm, and exponentiation of the second subexponent can be performed based on a right-to-left square-and-multiply-type of exponentiation algorithm. The final value is based on the exponentiations of the subexponents and can be decrypted data or a digital signature, which can be provided as an output.

Abstract: Embodiments of the disclosure are directed to generating a random number. An embodiment of the disclosure passes a current from a read operation through a magnetic tunnel junction (MTJ) to cause a first magnetization orientation of a free layer to switch to a second magnetization orientation, the switch in magnetization orientation causing a change in a resistance of the MTJ, and periodically samples the resistance of the MTJ to generate a bit value for the random number.

Abstract: A random number generator of a processor comprises a whitener for reducing the bias in random numbers generated by the random number generator. The whitener receives a random number of a first length read by an array of latches with inputs from an array of oscillators. The whitener dynamically creates a mask of the first length based on a parity of at least one previous random number read from the array of latches during at least one cycle prior to reading the random number. The whitener applies a compare operation between the random number and the mask to generate a whitened random number of the first length, with reduced bias, without reducing randomness.

Abstract: A random number generator of a processor comprises a whitener for reducing the bias in random numbers generated by the random number generator. The whitener receives a random number of a first length read by an array of latches with inputs from an array of oscillators. The whitener dynamically creates a mask of the first length based on a parity of at least one previous random number read from the array of latches during at least one cycle prior to reading the random number. The whitener applies a compare operation between the random number and the mask to generate a whitened random number of the first length, with reduced bias, without reducing randomness.

Abstract: A random wave envelope is created from a set of bounded random numbers by additively combining a triangle, a square and a sine wave. The random wave envelope is then used to create a sequence of wave random numbers from the wave envelope, which are used to generate random-variant keys for encryption in place of the pre-placed encryption key. An ambiguity envelope is thus created over the transmission of data packets as random-variant-keys are used that are distinct and separate for each packet and may also be distinct and separate for each incoming and outgoing packet. The random-variant keys are only created at the time of the actual use for encrypting or decrypting a data packet and not before and then discarded after one time use. The random-variant keys may be used in wireless network using wireless access points, cellular phone and data networks and ad hoc mobile wireless networks.

Abstract: 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 (i1, . . . , ik, . . . , iK), R is used for the following part of the decimal point of initial value x0 for nonlinear function, i is transformed into coordinates of each dimension, i1, . . . , ik, . . . , iK, and the initial value x0 and ik are stored in the register, through operations to generate and manage multi-dimensional random number Ri.

Abstract: A random number generator includes: a variable frequency oscillator that includes: a selection circuit having multiple input terminals and an output terminal; a parallel circuit having an input terminal and multiple output terminals that are respectively connected to the input terminals of the selection circuit, the parallel circuit including one or more buffer circuits to be selected by the selection circuit; and an inverter circuit having a control terminal, the inverter circuit being connected to the input terminal of the parallel circuit and to the output terminal of the selection circuit; and a latch circuit connected to the variable frequency oscillator.

Abstract: For generating a random number in a disk drive, a seed is generated from a respective sector number for each of at least one sector of the disk drive. The random number is calculated using the seed. The seed that is generated with enhanced unpredictability and complexity is used to generate the random number for secure data cryptography within the disk drive.

Abstract: A system and method for implementing the Elliptic Curve scalar multiplication method in cryptography, where the Double Base Number System is expressed in decreasing order of exponents and further on using it to determine Elliptic curve scalar multiplication over a finite elliptic curve.

Abstract: Method for performing an operation, the operation including, responsive to receiving a file system request at a file system, retrieving a first entropy pool element from the file system, and inserting, at the file system, the first entropy pool element into a network packet sent from the file system responsive to the file system request.

Abstract: A method and a device for maintenance filtering to process a flow of m coded incoming messages Esj each with nj Inputs/Outputs esi,j, a checksum ?Sesi,j of signatures Sesi,j, and a date dj. outgoing message Esmj is generated from each incoming message with nj Inputs/Outputs esmi,j, a checksum ?Sesmj of signatures Sesmi,j, and the date dj. The novel maintenance filtering device maintains at least one state of at least one Input/Output esi,j of at least one of the incoming messages Esj for a period of time Ti whatever the state of an Input/Output of an incoming message consecutive to the incoming message Esj by generating at least one outgoing message wherein the state of the ith Input/Output of the outgoing message is equal to the state of the Input/Output esi,j of incoming message Esj. The maintenance filtering device includes a calculation device, a pseudo-random generator, and a compensation table.

Abstract: Method, system, and computer program product for performing an operation, the operation including, responsive to receiving a file system request at a file system, retrieving a first entropy pool element from the file system, and inserting, at the file system, the first entropy pool element into a network packet sent from the file system responsive to the file system request.

Abstract: In a memory of non-volatile memory cells, a random number is generated by programming non-volatile memory cells, reading the programmed non-volatile memory cells using a random number read voltage selected in accordance with a characteristic of the non-volatile memory cells to generate random read data, and generating the random number from the random read data.

Abstract: Disclosed is a random number verification method and apparatus capable of quickly detecting the fact that a random number generation device designed to generate substantially authentic random numbers has become unable to generate authentic random numbers due to a malfunction, wrongful manipulation or the like. When random numbers randomly generated as n kinds of values are verified, a random number verification method according to one aspect of the present invention comprises a random number acquisition step of selecting a number m of the values, a counting step of counting the number of ones occurring p times (0?p<m) in the n kinds of values, a comparison step of comparing the number obtained in the counting step with a predetermined first threshold, and a determination step of, when it is found the number is greater than the first threshold as the result of the comparison step, determining that the random numbers have a problem.

Abstract: A random bit stream generator includes a plurality of feedback shift registers configured to store a plurality of bit values that represent an internal state of the random bit stream generator. Each feedback shift register includes a register input and a register output. The random bit stream generator further includes a Boolean output function configured to receive the plurality of register outputs from the plurality of feedback registers, to perform a first Boolean combination of the plurality of register outputs, and to provide a corresponding output bit, wherein a plurality of successive output bits forms a random bit stream. A feedback loop is configured to perform a second Boolean combination of the output bit with at least one register feedback bit of at least one of the feedback shift registers, so that the register input of the at least one feedback shift register is a function of the output bit.

Abstract: An elliptic curve cryptographic system where point coordinates are transformed from a first coordinate system to a second coordinate system. The transformed coordinates are processed by field operations, which have been modified for operating on the transformed point coordinates. In some implementations, the point coordinates are transformed from an affine coordinate system to a projective coordinate system using a non-random value for the projective coordinate. In some implementations, the transformed projective representation of the point can be changed from a first representation of the point in projective coordinates to a second representation of the point in projective coordinates, where the projective coordinate used in the representation change is a random value.

Abstract: An assemblage for monitoring an output of a random generator is provided, which assemblage compares chronologically successive sample values at a sampling point with one another in order to detect a relationship of the compared sample values with one another.

Abstract: A method for analyzing a random telegraph signal according to the present invention includes the steps of: performing band-pass filter processing with respect to signal data; subsequently calculating a histogram; subsequently performing threshold determination processing; further performing, based on a result of the threshold determination, binarization processing with respect to the filtered signal data; and further obtaining, based on a result of the binarization, coefficients ?.

Abstract: Where G and H are cyclic groups, M is an integer of two or more, i=1, . . . , M, f is a homomorphic function of mapping a member xi of group H to group G, Ri and R0 are random variables with a value in group G, ri is a realized value of the random variable Ri,, r0 is a realized value of the random variable R0, and ai is a random number of an integer of 0 or more, a random number generation unit 11 generates random numbers a1, a2, . . . , aM. A sampler 21 is capable of calculating f(x1)r1, f(x2)r2, . . . , f(xM)rM to obtain a calculation result thereof as z1, z2, . . . , zM, respectively. A power calculation unit 12 calculates (z1)a1, (z2)a2, . . . , (zM)aM. An extended randomizable sampler 22 is capable of calculating f(x1a1×x2a2× . . . ×xMaM)r0 to obtain a calculation result z0 thereof. A determination unit 16 determines whether or not (z1)a1×(z2)a2× . . . ×(zM)aM=z0.

Abstract: In a computing system environment, a data recipient manages entropy data supplied from an external data source despite not knowing or being certain about their trustworthiness or if such varies over time. Features relate to scoring the data and determining whether it meets or exceeds a predetermined policy score. One or more initial or updated reputation values of the data source are contemplated and used for scoring. Logging of the scoring, reputation values or other matters is provided for historical purposes and to identify possible future corrective actions. Other embodiments contemplate enhancing the score of the entropy data. In some instances, use of less than all the data by the recipient occurs to increase attack-resistance. Whether such occurs or how much occurs remains substantially unbeknownst to all parties other than the data recipient. Still other embodiments contemplate computer-readable media.

Abstract: An apparatus for balancing consumption of random data, comprising an entropy manager operable to: responsive to receipt of a request for random data, monitor one or more events associated with a plurality of entities and access one or more rules; determine whether a higher level of entropy associated with the random data is required by analysing the one or more events in accordance with the one or more rules; responsive to a determination that a higher level of entropy is not required, set an entropy state associated with the entropy to a lower level of entropy and obtain random data from an entropy source having a lower level of entropy; and responsive to a determination that a higher level of entropy is required, switch an entropy state associated with the entropy to a higher level of entropy and obtain random data from an entropy source having a higher level of entropy.

Abstract: A method of generating a pseudorandom sequence of terms belonging to a finite body K of cardinal q?2 intended to be used in a cryptographic procedure, said method comprising the iterative calculation, from an initialization n-tuple X(0)=(X(0)1, X(0)2, . . . , X(0)n), where n?2, of elements of K, of n-tuples X(i)=(X(i)1, X(i)2, . . . , X(i)n) of elements of K (where i=1, 2, . . . ), each n-tuple X(i) being obtained on iteration number i in a predetermined manner at least from certain components Y(i)k of an m-tuple Y(i)=(Y(i)1, Y(i)2, . . . , Y(i)m), where m?n, of elements of K and the terms of said pseudorandom sequence being extracted in a predetermined manner from the n-tuples X and/or the m-tuples Y. For at least one value of i, among said components Y(i)k of the m-tuple Y(i) that are used to obtain the multiplet X(i), at least E(n/2) of them are each represented by a predetermined second degree polynomial function, with coefficients in K, of the components of the n-tuple X(i?1).

Abstract: A random number generation method and apparatus using a low-power microprocessor is provided. In the random number generation method, a low-power microprocessor determines whether external power is supplied to a random number generator. The low-power microprocessor updates an internal state of the random number generator based on a first scheme if it is determined that the external power is supplied to the random number generator. The low-power microprocessor updates the internal state of the random number generator based on a second scheme different from the first scheme if it is determined that the external power is not supplied to the random number generator.