# US 8,787,564 B2 · Assessing cryptographic entropy

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

- Number: US 8,787,564 B2
- Document ID: US8787564B2
- Status: Granted
- Kind: B2
- Application number: 13/307,078
- Filed: 2011-11-30
- Published: 2013-05-30
- Granted: 2014-07-22
- Earliest claimed: 2011-11-30
- Assignees: Certicom Corp.
- Applicants: Daniel Richard L. Brown
- Inventors: Daniel Richard L. Brown
- Web page: https://patentgrep.com/patent/US8787564B2

## CPC

- H04L 9/001: {using chaotic signals}
- H04L 9/0869: {involving random numbers or seeds}
- H04L 2209/26: Testing cryptographic entity, e.g. testing integrity of encryption key or encryption algorithm
- H04L: TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION (arrangements common to telegraphic and telephonic communication H04M)

## Abstract

Systems, methods, software, and combinations thereof for evaluating entropy in a cryptography system are described. In some aspects, sample values are produced by an entropy source system. A typicality can be determined for each of the sample values. A grading is determined for preselected distributions based on the typicalities of the sample values. A subset of the preselected distributions are selected based on the gradings. An entropy of the entropy source system is calculated based on the subset of the plurality of distributions.

## Claims

### Claim 1

A method for assessing entropy in a cryptography system, the method comprising:
obtaining a sample value produced by an entropy source system;
determining a typicality grading for each of a preselected plurality of probability distributions, the typicality gradings providing a comparison among the plurality of probability distributions, the typicality grading for each individual probability distribution being determined based on the cumulative probability of values that are, according to that individual probability distribution, less probable than the sample value;
wherein the typicality grading gk(x,p) for each individual probability distribution is determined according to:
g
k
⁡
(
x
,
p
)
=
(
∑
y
:
P
p
⁡
(
y
)
<
P
p
⁡
(
x
)
⁢
⁢
P
p
⁡
(
y
)
)
+
k
(
∑
y
:
P
p
⁡
(
y
)
=
P
p
⁡
(
x
)
⁢
⁢
P
p
⁡
(
y
)
)
,
where k ε [0,1] represents an inclusivity level between zero and one inclusive, Pp (x) represents the probability of the sample value x according to the individual probability distribution p, and y: Pp (y) <Pp (x) represents the values that are less probable than the sample value;
selecting a subset of the plurality of probability distributions based on the typicality gradings; and
calculating an entropy of the entropy source system based on the subset of the plurality of probability distributions.

### Claim 2 (depends on 1)

The method of claim 1, wherein determining the typicality grading for an individual probability distribution comprises determining a typicality of the sample value for that individual probability distribution.

### Claim 3 (depends on 2)

The method of claim 2, wherein the typicality of the sample value indicates a probability that a randomly-selected value from the entropy source system is at most as probable as the sample value.

### Claim 4 (depends on 1)

The method of claim 1, further comprising:
determining whether the entropy source system has adequate entropy to achieve a specified security level in the cryptography system; and
modifying the entropy source system based on a determination that the entropy source system has inadequate entropy.

### Claim 5 (depends on 1)

The method of claim 1, further comprising:
seeding a pseudorandom number generator based on a sample value produced by the entropy source system; and
obtaining a cryptographic secret based on an output of the seeded pseudorandom number generator.

### Claim 6 (depends on 1)

The method of claim 1, comprising:
determining, based on the sample value, a typicality and a likelihood for each of the preselected plurality of probability distributions; and
computing the typicality gradings based on the typicalities and likelihoods.

### Claim 7 (depends on 1)

The method of claim 1, wherein selecting a subset of the plurality of probability distributions based on the typicality gradings includes at least one of:
selecting one or more probability distributions having a maximum typicality grading; or
selecting one or more probability distributions having a typicality grading above a specified threshold typicality grading.

### Claim 8 (depends on 1)

The method of claim 1, wherein calculating the entropy includes:
identifying side channel information and computational resources available to an adversary;
determining, for each probability distribution in the subset of probability distributions, a logarithm of a maximal probability of the adversary guessing the cryptographic secret using the side channel information and the resources available to the adversary; and
identifying as the entropy the minimal value of the logarithm determined for the subset of probability distributions.

### Claim 9

A method for assessing entropy in a cryptography system, the method comprising:
obtaining a sample value produced by an entropy source system;
determining a typicality grading for each of a preselected plurality of probability distributions, the typicality gradings providing a comparison among the plurality of probability distributions, the typicality grading for each individual probability distribution being determined based on the cumulative probability of values that are, according to that individual probability distribution, less probable than the sample value;
wherein the cumulative probability of values that are less probable than the sample value comprises the sum:
(
∑
y
:
P
p
⁡
(
y
)
<
P
p
⁡
(
x
)
⁢
⁢
P
p
⁡
(
y
)
)
,
where Pp (x) represents the probability of the sample value x according to the individual probability distribution p, and y: Pp (y) <Pp (x) represents the values that are less probable than the sample value;
selecting a subset of the plurality of probability distributions based on the typicality gradings; and
calculating an entropy of the entropy source system based on the subset of the plurality of probability distributions.

### Claim 10 (depends on 9)

The method of claim 9, wherein determining the typicality grading for an individual probability distribution comprises determining a typicality of the sample value for that individual probability distribution.

### Claim 11 (depends on 10)

The method of claim 10, wherein the typicality of the sample value indicates a probability that a randomly-selected value from the entropy source system is at most as probable as the sample value.

### Claim 12 (depends on 9)

The method of claim 9, further comprising:
determining whether the entropy source system has adequate entropy to achieve a specified security level in the cryptography system; and
modifying the entropy source system based on a determination that the entropy source system has inadequate entropy.

### Claim 13 (depends on 9)

The method of claim 9, further comprising:
seeding a pseudorandom number generator based on a sample value produced by the entropy source system; and
obtaining a cryptographic secret based on an output of the seeded pseudorandom number generator.

### Claim 14 (depends on 9)

The method of claim 9, comprising;
determining, based on the sample value, a typicality and a likelihood for each of the preselected plurality of probability distributions; and
computing the typicality gradings based on the typicalities and likelihoods.

### Claim 15 (depends on 9)

The method of claim 9, wherein selecting a subset of the plurality of probability distributions based on the typicality gradings includes at least one of:
selecting one or more probability distributions having a maximum typicality grading; or
selecting one or more probability distributions having a typicality grading above a specified threshold typicality grading.

### Claim 16 (depends on 9)

The method of claim 9, wherein calculating the entropy includes:
identifying side channel information and computational resources available to an adversary;
determining, for each probability distribution in the subset of probability distributions, a logarithm of a maximal probability of the adversary guessing the cryptographic secret using the side channel information and the resources available to the adversary; and
identifying as the entropy the minimal value of the logarithm determined for the subset of probability distributions.