# US 2026/0093455 A1 · Device and method for configuring a random number generator and method for generating random numbers

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

- Number: US 2026/0093455 A1
- Document ID: US20260093455A1
- Status: Published application
- Kind: A1
- Application number: 19/336,982
- Filed: 2025-09-23
- Published: 2026-04-02
- Earliest claimed: 2024-09-23
- Assignees: Infineon Technologies AG
- Applicants: Infineon Technologies AG
- Inventors: Lars Tebelmann; Berndt Gammel; Rainer Göttfert
- Web page: https://patentgrep.com/patent/US20260093455A1

## CPC

- G06F 7/582: {Pseudo-random number generators}
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)

## Abstract

Data processing device having a defining apparatus to define multi-bit output symbols of a random symbol source used to generate a single random number, a determination apparatus configured to use predetermined transition probabilities between output symbols of the random symbol source to determine, for every possible sequence of the specified number of multi-bit output symbols, a probability that the random symbol source outputs that sequence, a grouping apparatus to group the possible sequences into groups such that the overall probabilities of the groups are as equal as possible, wherein each group's overall probability is the sum of the determined probabilities of the sequences belonging to that group, and an assignment apparatus to assign a random number to each group as the random number to be output by the random number generator for the sequences of random symbols belonging to that group.

## Claims

### Claim at position 1

1-17. (canceled)

### Claim 18

A data processing device, comprising:
a defining apparatus configured to define a number of multi-bit output symbols of a random symbol source used to generate a single random number;
a determination apparatus configured to use predetermined transition probabilities between two or more output symbols of the random symbol source to determine, for every possible sequence of the number of multi-bit output symbols of the random symbol source, a probability that the random symbol source outputs that sequence;
a grouping apparatus configured to group the possible sequences of output symbols of the random symbol source into groups according to a criterion that overall probabilities of the groups are as equal as possible, wherein for each group the overall probability is determined as a sum of the determined probabilities of the random symbol source outputting the sequences belonging to the group; and
an assignment apparatus configured to assign a random number to each group as a random number that is to be output by the random number generator for the sequences of the random symbols that belong to the group.

### Claim 19 (depends on 18)

The data processing device as claimed in claim 18, further comprising:
a function forming apparatus configured to form a compression function by forming a Boolean function for each bit position of the random number to be generated, wherein, for each sequence of the possible sequences of the number of multi-bit output symbols, the compression function maps the sequence onto the random number which is assigned to the group to which the sequence belongs; and
an implementation apparatus configured to implement the compression function in the random number generator.

### Claim 20 (depends on 19)

The data processing device as claimed in claim 19, wherein the implementation apparatus is set up for implementing the compression function in the form of a hardware implementation which implements the Boolean functions as logic gate arrangements.

### Claim 21 (depends on 18)

The data processing device as claimed in claim 18, wherein the determination apparatus is further configured to determine, for every possible sequence of the number of multi-bit output symbols of the random symbol source, the probability that the random symbol source outputs the sequence according to a Markov model for the random symbol source.

### Claim 22 (depends on 18)

The data processing device as claimed in claim 18, wherein at least some of the groups contain a different number of the possible sequences of output symbols.

### Claim 23 (depends on 18)

The data processing device as claimed in claim 18, further comprising:
a control device configured to control the random number generator for generating one or more random numbers by receiving a sequence of the number of multi-bit output symbols of the random symbol source for each random number and outputting the random number that is assigned to the group to which the received sequence of output symbols belongs.

### Claim 24 (depends on 19)

The data processing device as claimed in claim 19, further comprising:
a control device configured to control the random number generator for generating one or more random numbers by receiving a sequence of the number of multi-bit output symbols of the random symbol source for each random number and determining the random number which is assigned to the group to which the received sequence of output symbols belongs by applying the compression function to the sequence of output symbols that is received and outputting the random number that is determined.

### Claim 25 (depends on 23)

The data processing device as claimed in claim 23, further comprising a configuration apparatus configured to configure the random symbol source as the random number generator.

### Claim 26

A method for configuring a random number generator, comprising:
defining a number of multi-bit output symbols of a random symbol source to be used for generating a single random number;
using predetermined transition probabilities between two or more output symbols of the random symbol source to determine, for every possible sequence of the number of multi-bit output symbols of the random symbol source, a probability that the random symbol source outputs that sequence;
grouping the possible sequences of output symbols of the random symbol source into groups according to a criterion that overall probabilities of the groups are as equal as possible, wherein for each group the overall probability is determined as a sum of the determined probabilities of the random symbol source outputting the sequences belonging to the group; and
assigning a random number to each group as a random number that is to be output by the random number generator for the sequences of the random symbols that belong to the group.

### Claim 27 (depends on 26)

The method as claimed in claim 26, further comprising:
forming a compression function by forming a Boolean function for each bit position of the random number to be generated, wherein, for each sequence of the possible sequences of the number of multi-bit output symbols, the compression function maps the sequence onto the random number which is assigned to the group to which the sequence belongs; and
implementing the compression function in the random number generator.

### Claim 28 (depends on 27)

The method as claimed in claim 27, further comprising:
implementing the compression function in the form of a hardware implementation that implements the Boolean functions as logic gate arrangements.

### Claim 29 (depends on 26)

The method as claimed in claim 26, further comprising:
determining, for every possible sequence of the number of multi-bit output symbols of the random symbol source, the probability that the random symbol source outputs the sequence according to a Markov model for the random symbol source.

### Claim 30 (depends on 26)

The method as claimed in claim 26, wherein at least some of the groups contain a different number of the possible sequences of output symbols.

### Claim 31 (depends on 26)

A method for generating random numbers, comprising:
configuring a random number generator as claimed in claim 26; and
generating one or more random numbers by receiving a sequence of the number of multi-bit output symbols of the random symbol source for each random number and outputting the random number which is assigned to the group to which the received sequence of output symbols belongs.

### Claim 32 (depends on 27)

A method for generating random numbers, comprising:
configuring a random number generator as claimed in claim 27; and
generating one or more random numbers by receiving a sequence of the number of multi-bit output symbols of the random symbol source for each random number and determining the random number which is assigned to the group to which the received sequence of output symbols belongs by applying the compression function to the sequence of output symbols that is received and outputting the random number that is determined.

### Claim 33 (depends on 31)

The method as claimed in claim 31, comprising configuring the random symbol source as the random number generator.

### Claim 34 (depends on 26)

A random number generator configured according to the method as claimed in claim 26.
