Abstract: Technologies are generally described for partial programming of memory having physically unclonable functions for secure data storage. In some examples, a sender that wishes to securely send data to a recipient using a physical memory may measure a program threshold average and a program threshold variation for bits in the memory and group the bits into different bins based on the measured average and variation. The sender may partially program the data to a set of bits selected from one or more of the bins by applying partial program pulses to the bits based on the program threshold average and the program threshold variation. The sender may then provide the partially-programmed memory to the recipient. The recipient may then partially program the received memory based on the program threshold average and the program threshold variation to recover the programmed data.

Abstract: One feature pertains to a true random number generator that utilizes the settling time of a bit cell as an entropy source to generate random digital output values. The bit cell may be a static random access memory bit cell. The bit cell's settling time may be converted into a digital output using an analog to digital converter. A plurality of bit cells may serially couple to one another in a ring formation. The bit cell ring can then be enabled such that each bit cell of the plurality of bit cells achieves a settling value that activates the subsequent bit cell in the ring causing it to in turn reach a settling value, and so on. An output node of one of the bit cells in the ring can then be sampled using a flip-flop to generate a continuous stream of random bits.

Abstract: A method of assessing parallel random number streams includes mixing two or more parallel random number streams. Mixing the parallel random number streams may include pairing at least one of the random number streams with other random number streams. For each mixed random number stream, an inter-stream correlation value may be computed based on a correlation among the random number steams used. A quality metric for the parallel random number streams may be determined from inter-stream correlation values for the two or more mixed streams created from the parallel random number streams. A quality metric for a single random number stream may be computed by segmenting the single random number stream into multiple substreams and applying the methods of mixing streams and computing quality metric in the case of parallel streams.

Abstract: A true random number generator (RNG) has one or more oscillators and an output register for storing a random number output. Each of the oscillators is activated, successively, in a free-running oscillation phase, and a capture phase during which the oscillator is quiescent. The output register latches during the capture phase of each oscillator an end state of that oscillator at or close to the end of its oscillation phase. The random number output is derived from the latched end states.

Abstract: A technique for improving random number generation (RNG) security for a data processing system includes a storage subsystem of a processing unit receiving a first deliver a random number (DARN) operation. The storage subsystem issues the first DARN operation with a first value, retrieved from a first base address register (BAR), on a first bus. The processing unit receives (from a first RNG unit) at least one of a first data and a first indication (that indicate whether the first RNG unit is functional) when a second value stored in a second BAR of the first RNG unit is the same as the first value. In response to the first and second values not being the same or the first RNG unit not being functional, the storage subsystem issues the first DARN operation with the first value on a second bus that is coupled to a second RNG unit.

Abstract: A random number generating device of the present disclosure includes: an arithmetic random number generator that generates an arithmetic random number sequence; an arithmetic random number converter that sequentially reads at least one arithmetic random number from the arithmetic random number sequence and converts a value of the read arithmetic random number into a voltage or current value of at least two predetermined levels of gray scale having an identical polarity; a hysteresis unit that outputs values depending on a presently-input voltage or current value and a previously-input voltage or current value with respect to the sequentially-input voltage or current value; and a threshold processor that binarizes the output of the hysteresis unit.

Abstract: Techniques are described for generating high quality entropy in a software only or a hardware assisted software environment, such as a virtualized environment. Embodiments of the invention describe creating an entropy pool within the virtualized environment using multiple sources of entropy. The entropy pool may be used in creating dynamically customizable and high entropy RNG and PUF. The sources of entropy may include trusted sources, untrusted sources and entropy sources with a varied scale of trust and entropy quality associated with them.

Abstract: A pairing method and an apparatus thereof for an ad-hoc connection in a wireless communication terminal are provided. In the method, an event duration that occurs according to user manipulation is measured. A pairing key is generated using the measured duration. A pairing procedure is performed with a counterpart terminal using the pairing key.

Abstract: A random number generator for generating random numbers using a solid-state memory is proposed. The random number generator includes a determination unit for determining management data stored in the solid-state memory and for managing the solid-state memory during operation. The random number generator also includes a computing unit for calculating a starting value on the basis of the determined management data. The random number generator also includes a generation unit for generating a random number on the basis of the calculated starting value.

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: The present disclosure provides a method and an apparatus for removing biasing due to a signal source during random number generation. At least one embodiment includes a method, performed by a random number generation apparatus, for generating a random number having a signal source biasing removed, including: generating a raw bit string by sampling, at a predetermined cycle, a physical signal input from a signal source; and generating the random number by performing block partial sum or sequential partial sum on the generated raw bit string.

Abstract: Methods and systems for hardware implementation of uniform random shuffling are disclosed. According to one aspect, a system for hardware implementation of uniform random shuffling includes multiple pseudo-random bit sequence (PRBS) generators, where each PRBS generator provides a pseudo-random sequence of numbers S and the next value in its pseudo-random sequence in response to receiving an output request. The system also includes selection logic for creating a sequence of output values O by repetitively selecting one of the plurality of modules according to a random selection function and sending an output request to the selected module, wherein the sequence of values O created from the output of the randomly selected modules comprises a uniform, randomly shuffled sequence. The probability that a PRBS generator will be selected is weighted based on the number N of pseudo-random values that have not yet been output out of L possible values in the sequence.

Abstract: A method of generating a random bit string includes receiving a binary input string, creating copies of the binary input string received from the min-entropy source, and providing each of the copies of the binary input string to one of a plurality of randomness extractors. The method further includes, for each randomness extractor, providing the respective extracted output binary string to one of a plurality of quantum devices, where each of the plurality of quantum devices is configured to (i) receive the extracted output binary string as a locally random input signal string, random only to that respective quantum device, and (ii) transform the received locally random input string into a globally random output signal string. Still further, the method includes combining the plurality of globally random output signal strings from the plurality of quantum devices to generate the random bit string.

Abstract: Embodiments of the invention relate to providing isolated entropy elements for a virtual machine to increase entropy in a computing environment. At least one virtual machine is deployed on a hypervisor. The hypervisor generates entropy elements based on triggers related to a virtual machine. Identifiers are assigned to the entropy elements based on the triggers and the virtual machine. Use of the entropy elements is restricted for the virtual machine based on the assigned identifiers. The increase in entropy through providing isolated entropy elements for a virtual machine deployed on a hypervisor reduces the success of external attacks on data residing within the computing environment.

Abstract: A technique for improving random number generation (RNG) security for a data processing system includes a storage subsystem of a processing unit receiving a first deliver a random number (DARN) operation. The storage subsystem issues the first DARN operation with a first value, retrieved from a first base address register (BAR), on a first bus. The processing unit receives (from a first RNG unit) at least one of a first data and a first indication (that indicate whether the first RNG unit is functional) when a second value stored in a second BAR of the first RNG unit is the same as the first value. In response to the first and second values not being the same or the first RNG unit not being functional, the storage subsystem issues the first DARN operation with the first value on a second bus that is coupled to a second RNG unit.

Abstract: A random number generator includes oscillating units configured to generate entropy sources and amplify the generated entropy sources, an entropy source combination unit configured to receive the entropy sources output from the oscillating units and combine the entropy sources to increase entropy, a sampling unit configured to sample a signal output from the entropy source combination unit in response to a sampling clock, and a clock generator and control unit configured to control the oscillating units and generate the sampling clock.

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

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: Techniques and mechanisms for generating a random number. In an embodiment, a first signal is received from a first cell including a first source follower transistor. Circuit logic detects for a pulse of the first signal and, in response to the pulse, generates a signal indicating detection of a first random telegraph noise event in the first source follower transistor. In another embodiment, a first count update is performed in response to the indicated detection of the first random telegraph noise event. The first count update is one basis for generation of a number corresponding to a plurality of random telegraph noise events.

Abstract: Maximum length properties of n-state sequences of n-state symbols with n=2 or n>2 are tested. Checkwords are generated from p consecutive n-state symbols in a sequence of n-state symbols which may overlap by (p?1) n-state symbols. If a sequence has np?1 n-state symbols in which 2 consecutive checkwords overlap in (p?1) n-state symbols and each checkword formed in the extended sequence is unique, then the sequence is a maximum length n-state sequence. An n-state feedback shift register based sequence generator with p n-state register elements is tested on the content of the shift register for np?1 cycles. If the shift register content is not repeated the sequence is maximum length. Generation of a sequence is stopped when the content repeats. Non-reversible n-state inverters and non-reversible n-state logic functions are applied to generate n-state sequences.

Abstract: A method for estimating error rates in low-density parity check codes includes calibrating an encoder according to specific channel parameters and according to dominant error events in the low-density parity-check code. Dominant codewords are classified based on characteristics of each codeword that are likely to produce similar error rates at similar noise levels; codeword classes that produce the highest error rate are then tested. Error boundary distance is estimated using multiple binary searches on segments. Segments are defined based on codeword, trapping set and biasing noise components of the channel. To improve calculation speed the most significant subclasses of codewords, trapping sets and noise signals are used.

Abstract: Described herein are methods and systems capable of generating weighted parameter sets, which can be randomly addressed for dictating a waveform of each pulse to be generated by using a probability distribution function loader to load a memory table with waveform parameter values, wherein the values are loaded according to a weighted probability distribution function. Each value is then randomly addressed in the memory table and/or randomly selected from the memory table by a random number generator and fed into a signal generation circuit for creation of the waveform to be transmitted.

Abstract: An electronic device is provided with an integral transducer used to update a random data pool without connection to an external source of new random data. In one embodiment, there is provided a method for providing random data on an electronic device, the method comprising: storing random data in a random data pool in a memory; sensing motion of the electronic device using a transducer integrally carried as part of the electronic device, wherein the transducer is configured to generate an output in response to sensed motion; generating new random data in accordance with the output of a transducer when sensed motion exceeds a threshold; and storing the new random data in the random data pool in the memory.

Abstract: Embodiments relate to methods, devices, and computer-implemented methods for transmitting a modulated signal transmitted from at least one signal light source and using the modulated signal for commissioning of network nodes. The method can include determining, by a network node, that the network node is not commissioned. The method can further include generating, by the network node, a random number, and generating a modulated light signal based on the random number. In addition, the method can include transmitting, to an image capture device, the modulated light signal, receiving, from a network control unit, via a radio channel, an encrypted commissioning message, and decrypting, by the network node, the encrypted commissioning message using the random number. Further, the method can include establishing, with the network control unit, communication based on data in the encrypted commissioning message.

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

Abstract: Embodiments of an electronic circuit comprise a module, such as a security module, configured to perform cryptographic processing for a predetermined security protocol that includes random number checking. The security module is controlled by a descriptor that includes instructions that cause the security module to access a generated random number, compare the generated random number to a random number stored during a previous execution of the descriptor, and generate an error signal when the generated random number and the previous execution random number are equal.

Abstract: A data processing device which includes a conversion circuit and a pseudo random number generator including a series connection of plural shift registers. The conversion circuit receives a pseudo random number sequence from an output of one of the plural shift registers excluding a last shift register of the series connection, and converts first data to second data using the received pseudo random number sequence.

Abstract: A method, an apparatus, and a computer program product for generating and processing random numbers are provided. An apparatus comprises a processing system that includes a processor, a random number generator and a pair of buffers. A first buffer receives low-entropy random numbers generated by the random number generator and a second buffer provides high-entropy random numbers directly to a processing system. The processing system may directly access the second buffer in response to an instruction executed by the processing system. The processing system responds to an interrupt based on occupancy levels of the buffers by conditioning low-entropy random numbers read from the first buffer to obtain high-entropy random numbers that are then stored in the second.

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: 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: An asymmetric cryptographic integrated circuit 20 and a data processing device 10 in which the integrated circuit 20 is used are disclosed. A security boundary 44 is confined to the interior of integrated circuit 20. A random number generator 50 with a hardware entropy source 54 and an arithmetic unit 62 programmed through microcode 38? to perform a variety of cryptographically useful functions are included within security boundary 44. One of these functions is a primality tester 72. A controller 36 for integrated circuit 20 may cause cryptographically sensitive data, such as large random prime numbers and a clear private key to be generated within the confines of security boundary 44. A symmetric key encryption engine 56 is included within security boundary 44 and used to encrypt the clear private key so that a resulting encrypted private key may be stored outside security boundary 44 in a non-volatile memory 12.

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: 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: A system and method of generating an encryption key in a self-encrypting mass storage device that includes using a manual input device as input for a micro-controller that contains a cyclic counter. An input device event triggers the micro-controller to read the current state of the cyclic counter. An accumulation of cyclic counter values is used as a source of entropy to seed a deterministic random number generator. The output of the deterministic random number generator is used as an encryption key for encryption/decryption processes within the mass storage device.

Abstract: A random number generator includes a fairness checker and correction module that ensures that a complete random sequence within a predetermined period of time will be output by the random number generator.

Abstract: An improved method for data encryption has been developed. The method includes storing data, multiple prime numbers and random numbers within an electronic memory storage device. Next, calculating a public number using the multiple prime numbers and providing a public number to a recipient apparatus that has knowledge of the multiple prime numbers. The method then encrypts the stored data with a randomly generated key and deletes the randomly generated key after use. Next, the method calculates a common shared secret between the sender and recipient using the prime numbers, a recipient public number and the second random number. The sender and recipient calculate parameters using a key equation based on the randomly generated key and random numbers and a common shared secret. Finally, the recipient calculates the randomly generated key for decryption using the common shared secret, one of the prime numbers, the parameters and the simultaneous equations for decryption of the data.

Abstract: An apparatus includes multiple oscillators, where each oscillator includes an inverter chain. The apparatus also includes combinatorial logic configured to generate a random number having one or more bits. The combinatorial logic is configured to generate each bit by combining two or more signals from at least two oscillators that have inverter chains with different prime numbers of inverters. The combinatorial logic may be configured to generate each bit using signals from a unique combination of oscillators. The combinatorial logic may also be configured to combine the signals asynchronously and sample the combined signal synchronously using a synchronous sampling clock, where at least one of the signals is not harmonically related to the sampling clock. Each of at least one of the oscillators may include multiple taps configured to provide multiple signals, and the multiple signals from one oscillator could have different asynchronous phases relative to the sampling clock.

Abstract: A delay device for generating a signal for a random component in a random number generator is disclosed. The delay device includes a delay module, for generating a plurality of delayed signals, wherein each delayed signal has a delay time and the delay time is different from each other; a first multiplexer, coupled to the delay module, for outputting a delayed signal among the plurality of delayed signals as a delayed trigger signal to control the random component to generate a random bit; and a delay selector, coupled to the first multiplexer, for generating a selecting signal to control the first multiplexer to select to output the delayed signal as the delayed trigger signal.

Abstract: An apparatus for generating physical random numbers includes a physical random number generator configured to generate physical random numbers, a test unit configured to perform a test process to check randomness of the physical random numbers, a minimum entropy estimating unit configured to estimate a minimum entropy based on statistical information generated as a byproduct of the test process, an entropy compressing unit configured to perform an entropy compression process using the physical random numbers as an input, and an entropy control unit configured to control based on the minimum entropy a number of bits of the physical random numbers input into the entropy compression process performed by the entropy compressing unit.

Abstract: There is provided a battery module including: a power storage unit storing power; a first authentication unit carrying out first authentication via a first authentication route; a second authentication unit carrying out second authentication via a second authentication route; and a discharging control unit controlling discharging from the power storage unit to an external appliance, wherein the first authentication unit is operable, when the first authentication has succeeded, to share key information to be used in the second authentication with an authentication party for the second authentication, the second authentication unit carries out the second authentication using the key information shared with the authentication party, and the discharging control unit is operable, when the second authentication has succeeded, to permit discharging from the power storage unit.

Abstract: A function f(x) is calculated with a calculating apparatus that makes a correct calculation with a low probability. Provided that G and H are cyclic groups, f is a function that maps an element x of the group H into the group G, X1 and X2 are random variables whose values are elements of the group G, x1 is a realized value of the random variable X1, and x2 is a realized value of the random variable X2, an integer calculation part calculates integers a? and b? that satisfy a relation a?a+b?b=1 using two natural numbers a and b that are relatively prime. A first randomizable sampler is capable of calculating f(x)bx1 and designates the calculation result as u. A first exponentiation part calculates u?=ua. A second randomizable sampler is capable of calculating f(x)ax2 and designates the calculation result as v. A second exponentiation part calculates v?=vb. A determining part determines whether u?=v? or not. A final calculation part calculates ub?va? in a case where it is determined that u?=v?.

Abstract: Disclosed herein is a shared memory systems that use a combination of SBR and MRRR techniques to calculate eigenpairs for dense matrices having very large numbers of rows and columns. The disclosed system allows for the use of a highly scalable tridiagonal eigensolver. The disclosed system likewise allows for allocating a different number of t00hreads to each of the different computational stages of the eigensolver.

Abstract: Techniques for medium access control. Some techniques include receiving, at a first computing device, a solicitation for at least a first medium access request that specifies at least one time period for transmitting the first medium access request to the second computing device; encoding the first medium access request at least in part by using a compressive sensing encoding technique to obtain a first encoded medium access request; and transmitting the first encoded medium access request to the second computing device during the at least one time period specified in the received solicitation.

Abstract: A non-transitory storage device containing software than, when executed by a processor, causes the processor to generate a projection set of polynomials based on a projection of a space linear combination of candidate polynomials of degree d on polynomials of degree less than d that do not evaluate to less than a threshold on a set of points. The software also causes the processor to compute the singular value decomposition of a matrix containing the difference between candidate polynomials evaluated on the points and the projection set of polynomials evaluated on the points, and to partition the polynomials resulting from the singular value decomposition based on a threshold.

Abstract: An independently functioning or centrally controlled wall light switch is configured to operate in normal mode and a Jewish holiday mode wherein the state of the light is fixed, regardless of the user's physical manipulation of the light switch. The control system automatically activates holiday mode by combining a geographically determined Jewish religious clock executed by software and hardware that utilizes the current time, date and geographical location of the apparatus in accordance with the Jewish definition of time and laws for calculating numerous religiously significant shifting daily points in time. The control system further incorporates several energy saving and preference modes by utilizing a particular day's calculated religious points in time in conjunction with holiday behavior patterns common to most Jewish families to provide the user with a greatly simplified means of programming an automatically adjusting on/off light timer and dimming overlay functionality during holiday mode.

Abstract: Methods, systems, and computer readable media for selecting numbers from multiple ranges are disclosed. One method includes receiving, information associated with a plurality of ranges, selecting, by a module implemented using a non-transitory computer readable medium, iteratively selecting numbers from within the ranges such that, during a selection iteration, a given number within one of the ranges is not selected more than once and such that a sequence of numbers selected during the selection iteration appears to be random, and utilizing the numbers selected during the selection iteration to control at least one aspect of testing a network or storage device.

Abstract: The generation of individual-specific information having a good reliability and uniqueness is made possible with a little circuit scale. For this purpose, in an individual-specific information generation apparatus, a plurality of digital circuits are in the same circuit configuration. Each of the digital circuits outputs a fixed or a random number output value individually without their output with respect to a certain input being determined unambiguously among the digital circuits. In each of the digital circuit, an order is defined in advance. A random number judgment unit judges whether the output value is a random value or fixed, for each of the plurality of digital circuits. An individual-specific information generation unit generates the individual-specific information based on information of the order defined in the digital circuit judged by the random number judgment unit as having a fixed output value among the plurality of digital circuits and the output value.

Abstract: A random number generator includes an exclusive-OR circuit, a random number determiner, and a random number generation instruction inhibitor. The exclusive-OR circuit obtains an exclusive-OR of outputs from a number of digital circuits. The random number determiner determines whether or not an output generated according to an instruction to generate random numbers is a random number for each of the digital circuits. The random number generation instruction inhibitor inhibits an instruction to generate random numbers to be provided to the digital circuits whose output generated according to the instruction is determined to be not a random number by the random number determiner.

Abstract: A method, system, and computer program product for random number generation using a network of mobile devices are provided in the illustrative embodiments. From a set of mobile devices, a corresponding set of data packets is received. A presence of raw sensor data is detected in a first data packet received from a first mobile device in the set of mobile devices. The raw sensor data comprises data corresponding to changing value of an output of a sensor in a set of sensors installed in the first mobile device. The raw sensor data is separated from the first data packet, resulting in an original data packet. A first random number is generated using the raw sensor data.

Abstract: A method of generating a code sequence in a wireless communication system is disclosed. More specifically, the method includes recognizing a desired length of the code sequence, generating a code sequence having a length different from the desired length, and modifying the length of the generated code sequence to equal the desired length. Here, the step of modifying includes discarding at least one element of the generated code sequence or inserting at least one null element to the generated code sequence.