# US 2026/0312794 A1 · System and method for randomness extraction and method of performing quantum cryptography

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

- Number: US 2026/0312794 A1
- Document ID: US20260312794A1
- Status: Published application
- Kind: A1
- Application number: 19/477,301
- Filed: 2024-04-24
- Published: 2026-10-08
- Earliest claimed: 2023-04-24
- Assignees: National University of Singapore
- Applicants: National University of Singapore
- Inventors: Hong Jie NG; Wen Yu KON; Ignatius William PRIMAATMAJA; Chao WANG; Ci Wen LIM
- Web page: https://patentgrep.com/patent/US20260312794A1

## CPC

- H04L 9/0852: {Quantum cryptography (transmission systems employing electromagnetic waves other than radio waves, e.g. light, infrared H04B10/00; wavelength-division multiplex systems H04J14/02; WDM arrangements H04J14/03)}
- H04L 9/0643: {Hash functions, e.g. MD5, SHA, HMAC or f9 MAC}
- H04L: TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION (arrangements common to telegraphic and telephonic communication H04M)

## Abstract

A system and a method for randomness extraction for quantum cryptography and a method of performing quantum cryptography between two or more parties. The system for randomness extraction for quantum cryptography comprises a sampling module configured to sample a cryptographic key to generate one or more sub-blocks; an entropy module configured to determine a lower bound of the entropy in each sub-block, wherein the determining of the lower bound comprises consideration of correlations between each sub-block and unsampled bits of the cryptographic key and/or other sub-blocks; and a hashing module configured to hash each sub-block for randomness extraction on each sub-block.

## Claims

### Claim 1

A system for randomness extraction for quantum cryptography, comprising
a sampling module configured to sample a cryptographic key to generate one or more sub-blocks;
an entropy module configured to determine a lower bound of the entropy in each sub-block, wherein the determining of the lower bound comprises consideration of correlations between each sub-block and unsampled bits of the cryptographic key and/or other sub-blocks; and
a hashing module configured to hash each sub-block for randomness extraction on each sub-block.

### Claim 2 (depends on 1)

The system of claim 1, wherein the cryptographic key comprises either a raw key or a sifted key.

### Claim 3 (depends on 1)

The system of claim 1, wherein the sampling module is configured to sample the cryptographic key into the one or more sampled sub-blocks in a random manner based on a pre-determined probability.

### Claim 4 (depends on 1)

The system of claim 1, comprising a sifting module configured to sift the cryptographic key or to sift the one or more sampled sub-blocks.

### Claim 5 (depends on 1)

The system of claim 1, wherein the sampling module is configured to apply a thresholding on the length of bit strings representing the respective sub-blocks and to abort the method if the length of the bit string for any sub-block exceeds a predetermined threshold.

### Claim 6 (depends on 1)

The system of claim 1, comprising a concatenation module configured to concatenate the hashed sub-blocks to generate a secret key.

### Claim 7 (depends on 1)

The system of claim 1, wherein the entropy module is configured to determine the lower bound based on the generalized entropy-accumulation theorem.

### Claim 8

A method of randomness extraction for quantum cryptography, comprising the steps of:
sampling a cryptographic key to generate one or more sub-blocks;
determining a lower bound of the entropy in each sub-block, wherein the determining of the lower bound comprises consideration of correlations between each sub-block and unsampled bits of the cryptographic key and/or other sub-blocks; and
hashing each sub-block for randomness extraction on each sub-block.

### Claim 9 (depends on 8)

The method according to claim 8, wherein the cryptographic key comprises either a raw key or a sifted key.

### Claim 10 (depends on 8)

The method according to claim 8, wherein the step of sampling the raw key into the one or more sub-blocks is performed in a random manner based on a pre-determined probability.

### Claim 11 (depends on 8)

The method of claim 8, comprising sifting the cryptographic key or sifting the one or more sampled sub-blocks.

### Claim 12 (depends on 8)

The method of claim 8, comprising applying a thresholding on the length of bit strings representing the respective sub-blocks and aborting the method if the length of the bit string for any sub-block exceeds a predetermined threshold.

### Claim 13 (depends on 8)

The method of claim 8, comprising concatenating the hashed sub-blocks to generate a secret key.

### Claim 14 (depends on 8)

The method of claim 8, wherein the step of determining the lower bound is based on the generalized entropy-accumulation theorem.

### Claim 15

A method of performing quantum cryptography between two or more parties, the method comprising announcing a uniform random variable Vi∈[1,NS] identifying which bit of the cryptographic key is sampled into which sub-block.

### Claim 16 (depends on 1, 15)

The method of claim 15, using the system for randomness extraction for quantum cryptography of claim 1.

### Claim 17 (depends on 8, 15)

The method of claim 15, comprising using the method for randomness extraction for quantum cryptography of claim 8.
