G06F7/586

VALIDATION OF STORE COHERENCE RELATIVE TO PAGE TRANSLATION INVALIDATION
20230105945 · 2023-04-06 ·

Systems and methods for invalidating page translation entries are described. A processing element may apply a delay to a drain cycle of a store reorder queue (SRQ) of a processing element. The processing element may drain the SRQ under the delayed drain cycle. The processing element may receive a translation lookaside buffer invalidation (TLBI) instruction from an interconnect connecting the plurality of processing elements. The TLBI instruction may be an instruction to invalidate a translation lookaside buffer (TLB) entry corresponding to at least one of a virtual memory page and a physical memory frame. The TLBI instruction may be broadcasted by another processing element. The application of the delay to the drain cycle of the SRQ may decrease a difference between the drain cycle of the SRQ and an invalidation cycle associated with the TLBI.

Fairness in gaming

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.

Parallel generation of pseudorandom number sequences using multiple generators with brined initial states

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.

Security processor performing remainder calculation by using random number and operating method of the security processor

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.

Apparatus and method for unbreakable data encryption
11296869 · 2022-04-05 ·

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.

SYSTEMS AND METHODS FOR DEVICE AUTHENTICATION IN SUPPLY CHAIN

A first semiconductor device includes a processor configured to generate a random number at initial test of a second semiconductor device after fabrication of the second semiconductor device in a supply chain related to the second semiconductor device, and send the generated random number to the second semiconductor device. The processor is further configured to receive a first signature that is signed over the sent random number by the second semiconductor device using a first private key that is stored in the second semiconductor device, among a first private and public key pair, and test the received first signature, using a first public key that is stored in the first semiconductor device, among the first private and public key pair, to determine whether the second semiconductor device is authenticated.

Apparatus and method for unbreakable data encryption
11271723 · 2022-03-08 ·

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.

EXTENDED REALITY AUTHENTICATION
20210336784 · 2021-10-28 ·

Methods and systems for secure authentication in an extended reality (XR) environment are described herein. An XR environment may be output by a computing device and for display on a device configured to be worn by a user. A first plurality of images may be determined via the XR environment. The first plurality of images may be determined based on a user looking at a plurality of objects, real or virtual, in the XR environment. The first plurality of images may be sent to a server, and the server may return a second plurality of images. A public key and private key may be determined based on different portions of each of the second plurality of images. The public key may be sent to the server to register and/or authenticate subsequent communications between the computing device and the server.

RANDOM NUMBER GENERATION APPARATUS, METHOD AND PROGRAM

A random number generation apparatus comprises: a first random number generating part 2 generating a random number u=(u.sub.1, . . . ,u.sub.D).sup.T∈[−∞,∞].sup.D; a second random number generating part 3 generating a random number v∈[0,f′.sub.max]; and a determining part 4 determining whether f′(x.sub.1=u.sub.1, . . . ,x.sub.D=u.sub.D)≥v or not, and, if f′(x.sub.1=u.sub.1, . . . ,x.sub.D=u.sub.D)≥v, adopting u as a random number according to f′(x.sub.1, . . . ,x.sub.D), wherein D is a predetermined positive integer, for i=1, . . . ,D, [h.sub.i] is a predetermined possible range for a random variable x.sub.i, a hole [h] is [h]=([h.sub.1], . . . ,[h.sub.D]).sup.T, H is a probability of a predetermined basic distribution function f(x.sub.1, . . . ,x.sub.D) in the hole [h], α=1/(1−H), a corrected distribution function f′(x.sub.1, . . . ,x.sub.D) is defined by Expressions (1) and (2), and f′.sub.max is a maximum value of f′(x.sub.1, . . . ,x.sub.D).

AUTOMATED VEHICLE LANE POSITIONING
20210171028 · 2021-06-10 · ·

A vehicle lane positioning system includes a sensor arrangement that is designed to determine lateral boundaries of a vehicle lane. A control unit is designed to calculate a vehicle travel path within the vehicle lane having a predetermined variation from a centered vehicle pathway. An actuator unit is designed to execute the vehicle travel path within the vehicle lane.