A method and apparatus is provided for generating pseudorandom numbers in a way that is deterministic (i.e., repeatable), that passes statistical tests, can have multiple instances of objects generating pseudorandom numbers at the same time. Also, the collection of pseudorandom numbers generated by multiple instances have the same statistical properties as numbers generated by a single instance (i.e., randomness). Embodiments described herein generate pseudorandom values by using a plurality of subsidiary linear congruential generators and combining their outputs nonlinearly. According to embodiments, after their outputs have been combined, a mixing function is applied. Embodiments include an on-demand split method in the style of the SplitMix algorithm.

Embodiments comprise construction of a collection of pseudorandom number generators (PRNGs), with either a known or unknown cardinality, using unique brine values that comprise a salt value for the collection and also different index values for each PRNG for the collection. The additive parameters of such PRNGs are based on the respective brine values of the PRNGs, thereby ensuring that the PRNGs in the collection have different state cycles. Embodiments make it likely that PRNGs from different collections have distinct additive parameters by choosing a pseudorandom salt value for each collection. According to embodiments, a stream of generators in a collection is created by a spliterator that carries a salt value for the collection and combines the salt value with index values for the generators to produce brined additive parameters for the PRNGs in the stream. According to embodiments, such a stream may be executed by multiple threads in parallel.

Embodiments are disclosed for fairness in gaming. The techniques include generating a public-private key pair for a bet with a gaming application. The techniques further include encrypting the bet using the generated public-private key pair. Additionally, the techniques include providing the encrypted bet to the gaming application. The techniques also include providing a private key of the public-private key pair in response to a notice from the gaming application indicating whether the bet is won.

Provided are a security processor for performing a remainder operation by using a random number and an operating method of the security processor. The security processor includes a random number generator configured to generate a first random number; a modular calculator configured to generate a first random operand based on first data and the first random number and generate output data through a remainder operation on the first random operand, wherein a result value of the remainder operation on the first input data is identical to a result value of the remainder operation on the first random operand.

A combination of secure texts of values a, b and c having a relationship c=ab is efficiently generated. A secure text generation part 12 generates secure texts [x.sub.i] of x.sub.i satisfying x.sub.i=f(k.sub.i), and secure texts [y.sub.i] of y.sub.i satisfying y.sub.i=g(k.sub.i), for i=0, . . . , m. A fragment generation part 13 generates .sub.i decrypted from [x.sub.i][a.sub.i] and .sub.i decrypted from [y.sub.i][b.sub.i], for i=1, . . . , m, and calculates [c.sub.i]+.sub.i[b.sub.i]+.sub.i[a.sub.i]+.sub.i.sub.i and generates secure texts [z.sub.1], . . . , [z.sub.m]; and A random number synthesizing part 14 generates a secure text [z.sub.0] using different values k.sub.0, . . . , k.sub.m and secure texts [z.sub.1], . . . , [z.sub.m].

An encryption specification named MetaEncrypt implemented as a method and associated apparatus is disclosed for unbreakable encryption of data, code, applications, and other information that uses a symmetric key for encryption/decryption and to configure the underlying encryption algorithms being utilized to increase the difficulty of mathematically modeling the algorithms without possession of the key. Data from the key is utilized to select several encryption algorithms utilized by MetaEncrypt and configure the algorithms during the encryption process in which block sizes are varied and the encryption technique that is applied is varied for each block. Rather than utilizing a fixed key of predetermined length, the key in MetaEncrypt can be any length so both the key length and key content are unknown. MetaEncrypt's utilization of key data makes it impossible to model its encryption methodology to thereby frustrate cryptographic cracking and force would be hackers to utilize brute force methods to try to guess or otherwise determine the key.

An encryption specification named MetaEncrypt implemented as a method and associated apparatus is disclosed for unbreakable encryption of data, code, applications, and other information that uses a symmetric key for encryption/decryption and to configure the underlying encryption algorithms being utilized to increase the difficulty of mathematically modeling the algorithms without possession of the key. Data from the key is utilized to select several encryption algorithms utilized by MetaEncrypt and configure the algorithms during the encryption process in which block sizes are varied and the encryption technique that is applied is varied for each block. Rather than utilizing a fixed key of predetermined length, the key in MetaEncrypt can be any length so both the key length and key content are unknown. MetaEncrypt's utilization of key data makes it impossible to model its encryption methodology to thereby frustrate cryptographic cracking and force would be hackers to utilize brute force methods to try to guess or otherwise determine the key.

An encryption specification named MetaEncrypt implemented as a method and associated apparatus is disclosed for unbreakable encryption of data, code, applications, and other information that uses a symmetric key for encryption/decryption and to configure the underlying encryption algorithms being utilized to increase the difficulty of mathematically modeling the algorithms without possession of the key. Data from the key is utilized to select several encryption algorithms utilized by MetaEncrypt and configure the algorithms during the encryption process in which block sizes are varied and the encryption technique that is applied is varied for each block. Rather than utilizing a fixed key of predetermined length, the key in MetaEncrypt can be any length so both the key length and key content are unknown. MetaEncrypt's utilization of key data makes it impossible to model its encryption methodology to thereby frustrate cryptographic cracking and force would be hackers to utilize brute force methods to try to guess or otherwise determine the key.

Described embodiments relate to systems and method for conditioning, de-biasing and/or whitening raw entropy data or for hashing data. The method comprises receiving data; determining at least a first algebraic number from the data; calculating at least one solution to one or more transcendental equations using the at least the first algebraic number as an input parameter value, wherein the one or more transcendental equations comprise a transcendental function that is capable of generating transcendental number outputs from algebraic number inputs; determining one or more sequences of pseudo random numbers based on the at least one solution; and determining an output based on the one or more sequences of pseudo random numbers. For example, the data may be received from a raw entropy source and comprise raw entropy to be transformed. Alternatively, the data may be data to be hashed and the output may comprise a hash of the data.

An improved pseudo-random number generator is introduced that has increased security due to higher randomness and lower predictability. The PRNG uses seed values that are based on a combination of various selectable values from the real-world that are typically made publicly available over a computer network (i.e., the Internet), such as: one or more weather conditions at a particular time or date and geographic location, a score of a sports event, a stock market index or ticker value, an election vote total, attendance at a cultural event, gross dollar sales from a movie release, and other such numerically quantifiable values that, individually and in combination, are impossible to exactly predict in advance, yet are precisely verifiable after the number-generating event using electronically-stored information. The improved pseudo-random number generator may be used for more secure determination of lottery outcomes and the like.