A memory device that includes a memory array and a memory controller is introduced. The memory controller is configured to adjust a program strength of the program pulse according to the configurable ratio of the first bit value and the second bit value to generate an adjusted program pulse or to adjust a bias voltage pair according to the configurable ratio of the first bit value and the second bit value to generate an adjusted bias voltage pair. The memory controller is further configured to generate the random bit stream with the configurable ratio of the first bit value and the second bit value according to the data stored in the plurality of memory cells included in the memory array after applying the adjusted program pulse or according to the data stored in the plurality of memory cells after being biased by the adjusted bias voltage pair.

A method for updating a dynamic website including: a) a user creating or editing one or more draft webpages in a form of one or more emails via one or more email clients thereby storing the one or more draft webpages within one or more email servers; b) automatically converting the one or more draft webpages to one or more publishable webpages suitable for transfer to one or more web servers; c) optionally, automatically creating, updating, or both, one or more index webpages to reference at least one of the one or more publishable webpages; d) publishing the one or more publishable webpages, and optionally the one or more index webpages, as one or more published webpages of a website by transferring the one or more publishable webpages from the one or more email servers to one or more web servers accessible by one or more web browsers.

A processor may receive a request to perform an operation. The processor may generate a seed derived from data required to perform the operation. The processor may generate a perturbation based on inputting the seed into a pseudorandom number generator. The processor may generate the actual result based on performing the operation. The processor may generate a perturbed result, wherein generating the perturbed result may comprise performing a second operation based on the actual result and the perturbation. The processor may return the perturbed result in response to the request.

In an embodiment, a processor may include an execution engine to execute a plurality of instructions, a memory to store a tagged data structure comprising a plurality of entries, and an eviction circuit. The eviction circuit may be to: generate a pseudo-random number responsive to an eviction request for the tagged data structure; in response to a determination that the pseudo-random number is outside of a valid eviction range for the plurality of entries, generate an alternative identifier by rotating through the valid eviction range, the valid eviction range comprising a range of numbers that are valid to identify victim entries of the tagged data structure; and evict a victim entry from the tagged data structure, the victim entry associated with the alternative identifier. Other embodiments are described and claimed.

A memory system connectable to a host device includes a nonvolatile memory, a first circuit configured to generate a sequence of random number bits, and a processor configured to instruct the circuit to generate a sequence of random number bits having a first length, calculate a first value indicating randomness of the sequence, determine whether the first value exceeds a threshold value, upon determining that the first value exceeds the threshold value, generate a pseudo random number using the sequence, upon determining that the first value does not exceed the threshold value, instruct the first circuit to generate another sequence of random number bits having a second length greater than the first length, and generate a pseudo random number using said another sequence, and write or read data to or from the nonvolatile memory using the generated pseudo random number.

A game device capable of generating a plurality of game results by betting, comprising a betting tabletop (10), an imaging unit (20), a game result generating unit (30), a compensation unit (40), and a game processing unit (50). The game processing unit (50) determines whether a game satisfies a specified condition and then decides whether to generate an overweight signal, and makes the game result generating unit (30) generate a specified number of game results when the overweight signal exists, and the specified number is greater than 1. On this basis, in a round game, the plurality of game results can be generated by means of the game result generating unit (30), to satisfy the requirements of a player for obtaining a plurality of game results by a bet, the running of the game is accelerated, and the operating efficiency of the game is increased.

A method for providing identification and access with respect to a passive radio-frequency tag in a tag population, including, receiving a command for initiating an inventory round or a command for initiating a tag access, the command including, as a parameter, a number including an identifier of a reader, generating a 16-bit value referred to as first or second binding handle, the first or second binding handle including N juxtaposed bits forming the reader identifier, backscattering the first or second binding handle, receiving an ACK command, analyzing the identification parameter of the ACK command, and in a case where the identification parameter includes the reader identifier then ignoring the ACK command, only tags having the selected inventoried flag value for the session number are inventoried, the first initiating command only including the same inventoried flag for every inventoried tags during a session and wherein the at least other inventoried flag value is never used during the session.

An elliptic curve random number generator avoids escrow keys by choosing a point Q on the elliptic curve as verifiably random. An arbitrary string is chosen and a hash of that string computed. The hash is then converted to a field element of the desired field, the field element regarded as the x-coordinate of a point Q on the elliptic curve and the x-coordinate is tested for validity on the desired elliptic curve. If valid, the x-coordinate is decompressed to the point Q, wherein the choice of which is the two points is also derived from the hash value. Intentional use of escrow keys can provide for back up functionality. The relationship between P and Q is used as an escrow key and stored by for a security domain. The administrator logs the output of the generator to reconstruct the random number with the escrow key.

Some of the disclosed methods and apparatuses use several types of stochastic binary string (SBS) generators to generate SBS sequences based on the particular values to be multiplied. Some embodiments use a multiphase SBS generator to more efficiently generate multiple SBS sequences that are offset from one another in “phase”.

An elliptic curve random number generator avoids escrow keys by choosing a point Q on the elliptic curve as verifiably random. An arbitrary string is chosen and a hash of that string computed. The hash is then converted to a field element of the desired field, the field element regarded as the x-coordinate of a point Q on the elliptic curve and the x-coordinate is tested for validity on the desired elliptic curve. If valid, the x-coordinate is decompressed to the point Q, wherein the choice of which is the two points is also derived from the hash value. Intentional use of escrow keys can provide for back up functionality. The relationship between P and Q is used as an escrow key and stored by for a security domain. The administrator logs the output of the generator to reconstruct the random number with the escrow key.