# US 2026/0064367 A1 · Decentralized multi-random number generator architecture

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2026/0064367 A1
- Document ID: US20260064367A1
- Status: Published application
- Kind: A1
- Application number: 18/820,048
- Filed: 2024-08-29
- Published: 2026-03-05
- Earliest claimed: 2024-08-29
- Assignees: QUALCOMM Incorporated
- Applicants: QUALCOMM Incorporated
- Inventors: Nicolas Thaddee COURTOIS; Matthew MCGREGOR; Anthony MAURE; Frederic AMIEL
- Web page: https://patentgrep.com/patent/US20260064367A1

## CPC

- G06F 7/582: {Pseudo-random number generators}
- G06F 7/58: Random or pseudo-random number generators
- G06F 7/588: {Random number generators, i.e. based on natural stochastic processes}
- H04L 9/0662: {with particular pseudorandom sequence generator}
- H04L 9/0869: {involving random numbers or seeds}
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)
- H04L: TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION (arrangements common to telegraphic and telephonic communication H04M)

## Abstract

Systems and techniques are provided for random number generation. For instance, a process can include generating, using a first random number generator of a plurality of random number generators, a first random number; inputting the first random number to a first flow engine of a plurality of flow engines, wherein the first flow engine is coupled to a random number consumer, of one or more random number consumers, through a first set of flow engines, of the plurality of flow engines, wherein the plurality of flow engines are unclocked; randomly transforming, by the first set of flow engines, the first random number to a second random number; and buffering the second random number from the first set of flow engines for output to the random number consumer.

## Claims

### Claim 1

An apparatus for random number generation, comprising:
a memory system comprising instructions; and
a processor system coupled the memory system, wherein the processor system is configured to:
generate, using a first random number generator of a plurality of random number generators, a first random number;
input the first random number to a first flow engine of a plurality of flow engines, wherein the first flow engine is coupled to a random number consumer, of one or more random number consumers, through a first set of flow engines, of the plurality of flow engines, wherein the plurality of flow engines are unclocked;
randomly transform, by the first set of flow engines, the first random number to a second random number; and
buffer the second random number from the first set of flow engines for output to the random number consumer.

### Claim 2 (depends on 1)

The apparatus of claim 1, wherein flow engines, of the plurality of flow engines, are placed around the random number consumer, and wherein the flow engines placed around the random number consumer generate noise emissions to mask emissions of at least one of the random number consumer, or one or more flow engines of the first set of flow engines.

### Claim 3 (depends on 1)

The apparatus of claim 1, wherein the plurality of flow engines includes one or more dummy flow engines separate from the first set of flow engines, and wherein the one or more dummy flow engines perform operations to generate noise emissions.

### Claim 4 (depends on 3)

The apparatus of claim 3, wherein the one or more dummy flow engines obtains an input value from a separate source than the first flow engine.

### Claim 5 (depends on 1)

The apparatus of claim 1, wherein each flow engine, of the plurality of flow engines are configured to perform an operation comprising at least one of:
a permutation operation;
an exclusive or (XOR) operation;
a buffer operation;
a zeroing operation; or
an audit operation.

### Claim 6 (depends on 5)

The apparatus of claim 5, wherein a minimum number of permutation operations are performed to randomly transform the first random number to the second random number.

### Claim 7 (depends on 5)

The apparatus of claim 5, wherein a number of flow engines in the first set of flow engines is randomly determined, and wherein operations performed by the number of flow engines in the first set of flow engines are randomly determined.

### Claim 8 (depends on 7)

The apparatus of claim 7 wherein the number of flow engines in the first set of flow engines is randomly determined by a place and route tool, and wherein the operations performed by the number of flow engines in the first set of flow engines are randomly determined by the place and route tool.

### Claim 9 (depends on 8)

The apparatus of claim 8, wherein the number of flow engines in the first set of flow engines is randomly determined by a place and route tool based on at least one bit of metadata for the place and route tool, command line argument for the place and route tool, or a configuration file of the place and route tool, and wherein the operations performed by the number of flow engines in the first set of flow engines are randomly determined by the place and route tool based on at least one bit of metadata for the place and route tool, command line argument for the place and route tool, or a configuration file of the place and route tool.

### Claim 10 (depends on 5)

The apparatus of claim 5, wherein the XOR operation is performed by a second flow engine of the first set of flow engines and wherein the XOR operation is performed on a set of bits randomly selected from bits input to the second flow engine.

### Claim 11 (depends on 10)

The apparatus of claim 10, wherein the set of bits randomly selected from bits input to the second flow engine by a place and route tool.

### Claim 12 (depends on 10)

The apparatus of claim 10, where at most K−1 constants in some XOR gate with K inputs are constants decided by a ROT secure enclave at boot time or at one personalization or device firmware update stage.

### Claim 13 (depends on 5)

The apparatus of claim 5, wherein the buffer operation buffers the second random number for the first set of flow engines for output to the random number consumer.

### Claim 14 (depends on 5)

The apparatus of claim 5, wherein a second flow engine is configured to perform an audit operation, and wherein the second flow engine is configured to output one of an alarm signal or an indication to throttle signal.

### Claim 15 (depends on 1)

The apparatus of claim 1, wherein a third flow engine is included in the first set of flow engines and a second set of flow engines, and wherein the third flow engine mixes values of the first set of flow engines and the second set of flow engines.

### Claim 16 (depends on 1)

The apparatus of claim 1, wherein the first set of flow engines includes special constants, which are input bits which can be fixed or specified by a place and route tool.

### Claim 17

A method for random number generation, comprising:
generating, using a first random number generator of a plurality of random number generators, a first random number;
inputting the first random number to a first flow engine of a plurality of flow engines, wherein the first flow engine is coupled to a random number consumer, of one or more random number consumers, through a first set of flow engines, of the plurality of flow engines, wherein the plurality of flow engines are unclocked;
randomly transforming, by the first set of flow engines, the first random number to a second random number; and
buffering the second random number from the first set of flow engines for output to the random number consumer.

### Claim 18 (depends on 17)

The method of claim 17, wherein flow engines, of the plurality of flow engines, are placed around the random number consumer, and wherein the flow engines placed around the random number consumer generate noise emissions to mask emissions of at least one of the random number consumer, or one or more flow engines of the first set of flow engines.

### Claim 19 (depends on 17)

The method of claim 17, wherein the plurality of flow engines includes one or more dummy flow engines separate from the first set of flow engines, and wherein the one or more dummy flow engines perform operations to generate noise emissions.

### Claim 20 (depends on 17)

The method of claim 17, wherein each flow engine, of the plurality of flow engines are configured to perform an operation comprising at least one of:
a permutation operation;
an exclusive or (XOR) operation;
a buffer operation;
a zeroing operation; or
an audit operation.
