# US 12,003,626 B2 · System and method of verification, authentication, and/or certification using entangled photons

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

- Number: US 12,003,626 B2
- Document ID: US12003626B2
- Status: Granted
- Kind: B2
- Application number: 18/342,679
- Filed: 2023-06-27
- Published: 2023-10-19
- Granted: 2024-06-04
- Earliest claimed: 2020-11-25
- Assignees: Qubit Moving and Storage, LLC
- Applicants: Qubit Moving and Storage, LLC
- Inventors: Gary Vacon; Kristin A. Rauschenbach
- Web page: https://patentgrep.com/patent/US12003626B2

## CPC

- G06F 1/14: Time supervision arrangements, e.g. real time clock
- 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)}
- G06F 1/12: Synchronisation of different clock signals {provided by a plurality of clock generators}
- G06N 10/40: Physical realisations or architectures of quantum processors or components for manipulating qubits, e.g. qubit coupling or qubit control
- G06N 10/70: Quantum error correction, detection or prevention, e.g. surface codes or magic state distillation
- H04L 9/0866: {involving user or device identifiers, e.g. serial number, physical or biometrical information, DNA, hand-signature or measurable physical characteristics}
- H04L 9/321: {involving a third party or a trusted authority}
- H04L 9/50: {using hash chains, e.g. blockchains or hash trees}
- H04L 2209/56: Financial cryptography, e.g. electronic payment or e-cash
- 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)
- G06N: COMPUTING ARRANGEMENTS BASED ON SPECIFIC COMPUTATIONAL MODELS

## Abstract

A method of generating a nonce includes measuring a TOA and a corresponding first or second state value of a plurality of first photons, wherein respective ones of the plurality of first photons are entangled with respective ones of a plurality of second photons in a first basis, which is time, and entangled in a second basis. A first ordered list of the measured TOAs of the plurality of first photons is generated. A TOA and a corresponding first or second state value of the plurality of second photons are measured. A second ordered list of the measured TOA of the plurality of second photons is generated. TOA matches between the first ordered list and the second ordered list are determined. The first or second state values that correspond to the determined TOA matches between the first ordered list and the second ordered list are determined. A shared secret random number is determined using the first or second state values that correspond to the determined TOA matches. A nonce is established using at least part of the shared secret random number.

## Claims

### Claim 1

A method of generating a nonce, the method comprising:
a) measuring a time-of-arrival (TOA) and a corresponding first or second state value of a plurality of first photons, wherein respective ones of the plurality of first photons are entangled with respective ones of a plurality of second photons in a first basis, which is time, and entangled in a second basis;
b) generating a first ordered list of the measured times-of-arrival of the plurality of first photons;
c) measuring a time-of-arrival and a corresponding first or second state value of the plurality of second photons;
d) generating a second ordered list of the measured times-of-arrival of the plurality of second photons;
e) determining time-of-arrival matches between the first ordered list and the second ordered list;
f) determining first or second state values that correspond to the determined time-of-arrival matches between the first ordered list and the second ordered list;
g) generating a shared secret random number using at least some of the determined first or second state values that correspond to the determined time-of-arrival matches; and
h) establishing the nonce using at least part of the shared secret random number.

### Claim 2 (depends on 1)

The method of claim 1 further comprising associating the nonce with a user.

### Claim 3 (depends on 1)

The method of claim 1 further comprising authenticating a user with the nonce.

### Claim 4 (depends on 1)

The method of claim 1 further comprising performing verification with the nonce.

### Claim 5 (depends on 4)

The method of claim 4 further comprising proceeding with a transaction based on the verification.

### Claim 6 (depends on 1)

The method of claim 1 further comprising associating the nonce with a credential.

### Claim 7 (depends on 6)

The method of claim 6 wherein the transaction comprises at least one of a purchase, a financial transaction, a building entry, a country border entry or an exchange of sensor information.

### Claim 8 (depends on 1)

The method of claim 1 further comprising sending the nonce over a classical communication channel.

### Claim 9 (depends on 1)

The method of claim 1 further comprising encrypting the nonce.

### Claim 10 (depends on 9)

The method of claim 9 wherein the encrypting the nonce comprises encrypting a portion of the shared secret random number.

### Claim 11 (depends on 1)

The method of claim 1 further comprising generating a cryptographic key with a portion of the shared secret random number.

### Claim 12 (depends on 1)

The method of claim 1 further comprising physically moving the nonce from a first physical location to a second physical location.

### Claim 13 (depends on 12)

The method of claim 12 further comprising verifying that a user was physically at the first location using the nonce at the second location to verify.

### Claim 14 (depends on 1)

The method of claim 1 further comprising establishing a block chain with the nonce.

### Claim 15 (depends on 1)

The method of claim 1 further comprising generating a cryptographic key with a portion of the shared secret random number and securely checking the integrity of a block chain with the cryptographic key.

### Claim 16

A method of certifying a credential, the method comprising:
a) generating a first shared secret random number by measuring one of a first pair of entangled photons using a first device and by measuring another of the first pair of entangled photons using a second device;
b) dividing the first shared secret random number into a first cryptographic (crypto) key and a first nonce;
c) associating the first nonce with the credential;
d) storing the first crypto key, the first nonce, and the credential in the first device;
e) storing the first crypto key, the first nonce, and the credential in the second device;
f) generating a second shared secret random number by measuring one of a second pair of entangled photons using the first device and by measuring another of the second pair of entangled photons using a third device;
g) dividing the second shared secret random number into a second crypto key and a second nonce;
h) encrypting the first crypto key, the first nonce, and the credential with a second crypto key at the first device, and sending the encrypted first crypto key, first nonce, and credential from the first device to the third device;
i) decrypting the sent encrypted first crypto key, first nonce, and credential at the third device using the second crypto key;
j) sending from the third device to the second device, the first nonce from the decrypted sent encrypted first crypto key, first nonce, and credential;
k) determining at the second device if the first nonce sent by the third device matches the first nonce stored in the second device;
l) Encrypting at the second device, the credential stored in the second device, wherein the encryption is performed using the first crypto key, and sending the encrypted credential to the third device if the first nonce received from the third device is determined to match the first nonce stored in the second device;
m) decrypting the encrypted credential sent by the second device at the third device; and
n) determining at the third device if the decrypted encrypted credential sent by the first device matches the decrypted encrypted credential sent by the second device and certifying the credential if a match is determined.

### Claim 17 (depends on 16)

The method of claim 16 wherein generating the first shared secret random number by measuring one of the first pair of entangled photons using the first device and by measuring the other of the first pair of entangled photons using the second device further comprises sharing a comb between the first device and the second device.

### Claim 18 (depends on 17)

The method of claim 17 wherein the measuring one of the first pair of entangled photons comprises measuring a polarization value.

### Claim 19 (depends on 16)

The method of claim 16 further comprising storing in the first device, the second crypto key, and the second nonce; and storing in the third device the second crypto key, the second nonce and the credential.

### Claim 20

A method of certifying a credential, the method comprising:
a) generating a first and a second shared secret random number by performing matching processes on a first and on a second event list that contain correlated quantum state values;
b) dividing the first shared secret random number into a first cryptographic (crypto) key and a first nonce;
c) associating the first nonce with the credential;
d) dividing the second shared secret random number into a second crypto key and a second nonce;
e) encrypting the first crypto key, the first nonce, and the credential with the second crypto key;
f) decrypting the sent encrypted first crypto key, first nonce, and credential using the second crypto key;
g) determining if the first nonce matches the second nonce; and
h) certifying the credential if the first nonce matches the second nonce.