IP Library › Granted Patent US 12,494,907
Granted Patent B2
US 12,494,907 · App. 17/934,832 · Granted Dec 9, 2025

Delivering random number keys securely for one-time pad symmetric key encryption

Inventors: William R. Bandy (Gambrills, MD); Michael R. Arneson (Warba, MN)
Assignee: Matrics2, Inc.
H04L9/0869H04L9/0894H04L9/14G06K19/06037H04L9/0891H04L63/083
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 12,494,907
App. No.
17/934,832
Granted
Dec 9, 2025
Kind
B2
Abstract

Techniques are disclosed for the provisioning of secure keys to an application. A first globally-unique value of a plurality of globally-unique values is received via a user interface of the application. The first globally-unique value and an application identifier of the application is provided to a computing system via a network. The computing system is configured to determine a second globally-unique value and a third globally-unique value associated with the first globally-unique value based on the application identifier. The second globally-unique value is then received via the user interface. The second globally-unique value is designated as a first secure key. The first secure key is stored in a first location of a memory of the computing device allocated for the application. A third globally-unique value is received via the user interface. The third globally-unique value is designated as a buffer key.

Claims (64)

1 . A method performed by an application executing on a computing device, comprising:

receiving a first globally-unique value of a plurality of globally-unique values via a user interface of an application executing on the computing device, the first globally-unique value, a second globally-unique value of the plurality, and a third globally-unique value of the plurality being physically implemented as a first machine-readable format, a second machine-readable format, and a third machine-readable format, respectively;

providing, via a network, the first globally-unique value and an application identifier associated with the application to a computing system, the computing system configured to determine the second globally-unique value and the third globally-unique value based on the application identifier;

receiving the second globally-unique value via the user interface of the application;

designating the second globally-unique value as a first secure key;

storing the first secure key in a first location of a memory of the computing device allocated for the application;

receiving the third globally-unique value via the user interface of the application; and

designating the third globally-unique value as a buffer key.

2 . The method of claim 1 , wherein the first machine-readable format is a first quick response code, wherein the second machine-readable format is a second quick response code, and wherein the third machine-readable format is a third quick response code.

3 . The method of claim 2 , wherein said receiving the first globally-unique value via the user interface comprises:

capturing the first quick response code via the application; and

decoding the first quick response code to obtain the first globally-unique value;

wherein said receiving the second globally-unique value via the user interface comprises:

capturing the second quick response code via the application, and

decoding the second quick response code to obtain the second globally-unique value; and

wherein said receiving the third globally-unique value via the user interface comprises:

capturing the third quick response code via the application, and

decoding the third quick response code to obtain the third globally-unique value.

4 . The method of claim 1 , further comprising:

storing the buffer key in a second location of the memory of the computing device allocated for the application.

5 . The method of claim 1 , further comprising:

receiving, via the network, a command from the computing system that instructs the application to perform a key flush operation to replace the first secure key stored in the first location of the memory with another secure key; and

replacing the first secure key with the other secure key in accordance with the key flush operation.

6 . The method of claim 5 , wherein key flush operation comprises:

generating a first encoded key based on at least the buffer key;

receiving, via the network, an encrypted second secure key from the computing system;

decrypting the encrypted second secure key using the first encoded key;

bit shuffling the buffer key based on the decrypted second secure key;

generating a second encoded key based on at least the bit-shuffled buffer key;

receiving, via the network, an encrypted third secure key from the computing system; and

decrypting the encrypted third secure key using the bit-shuffled buffer key.

7 . The method of claim 6 , further comprising:

storing the decrypted third secure key in the first location of the memory, the decrypted third secure key being the other secure key that replaces the first secure key.

8 . A method performed by a computing system, comprising:

generating a plurality of globally-unique values comprising a first globally-unique value, second globally-unique value, and a third globally-unique value;

storing the plurality of globally-unique values in a database of the computing system, each of the plurality of globally-unique values also being physically implemented as a machine-readable format;

associating, in the database, the first globally-unique value with the second globally-unique value and the third globally-unique value;

receiving, via a network, one of the plurality of globally-unique values from an application executing on a computing device that reads the one of the plurality of globally-unique values from the physically-implemented machine-readable format;

designating the second globally-unique value associated with the globally-unique value as a first secure key for the application; and

designating the third globally-unique value associated with the globally-unique value as a buffer key for the application.

9 . The method of claim 8 , wherein each of the plurality of globally-unique values are randomly-generated values.

10 . The method of claim 9 , wherein the randomly-generated values are generated by a quantum random number generator.

11 . The method of claim 8 , further comprising:

generating a first encoded key based on at least the buffer key;

generating a second secure key;

sending to the application, via the network, the second secure key encrypted using the first encoded key;

bit shuffling the buffer key based on an unencrypted version of the second secure key;

generating a third secure key;

generating a second encoded key based on the bit-shuffled buffer key and the third secure key;

generating a fourth secure key; and

sending to the application, via the network, the fourth secure key encrypted using the second encoded key.

12 . The method of claim 11 , wherein generating a second encoded key comprises:

performing a bit-wise XOR operation on the bit-shuffled buffer key and the third secure key.

13 . A system, comprising:

at least one processor circuit; and

at least one memory stores program code that, when executed by the at least one processor circuit, perform operations, the operations comprising:

generating a plurality of globally-unique values comprising a first globally-unique value, second globally-unique value, and a third globally-unique value;

storing the plurality of globally-unique values in a database of the computing system, each of the plurality of globally-unique values also being physically implemented as a machine-readable format;

associating, in the database, the first globally-unique value with the second globally-unique value and the third globally-unique value;

receiving, via a network, one of the plurality of globally-unique values from an application executing on a computing device that reads the one of the plurality of globally-unique values from the physically-implemented machine-readable format;

designating the second globally-unique value associated with the globally-unique value as a first secure key for the application; and

designating the third globally-unique value associated with the globally-unique value as a buffer key for the application.

14 . The system of claim 13 , wherein each of the plurality of globally-unique values are randomly-generated values.

15 . The system of claim 14 , wherein the randomly-generated values are generated by a quantum random number generator.

Assignments (3)
CORRECTIVE ASSIGNMENT TO CORRECT THE THE ADDRESS OF RECEIVING PARTY SYMMATRICS, INC. FROM 17028 DOUGLAS AVE, WARBA, MN, US 55793 TO 523 BENFIELD ROAD, STE 205, SEVERNA PARK, MD, US 21146 PREVIOUSLY RECORDED ON REEL 73968 FRAME 970. ASSIGNOR(S) HEREBY CONFIRMS THE NAME CHANGE. Recorded Mar 12, 2026
From: MATRICS2, INC.
To: SYMMATRICS, INC.
Reel/Frame 075061/0902 →
CHANGE OF NAME Recorded Dec 19, 2025
From: MATRICS2, INC.
To: SYMMATRICS, INC.
Reel/Frame 073968/0970 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Sep 23, 2022
From: BANDY, WILLIAM R.; ARNESON, MICHAEL R.
To: MATRICS2, INC.
Reel/Frame 061197/0595 →
Continuity (2)
Provisional Application 63389753 · Jul 15, 2022
Related Publication 20240022403A1 · Jan 18, 2024
References Cited (11)
US 10579830B1 · Bendersky · 2020 [cited by examiner]
US 12278894B2 · Chu · 2025 [cited by examiner]
US 20160149879A1 · Haynes · 2016 [cited by examiner]
US 20170033925A1 · DeNeut · 2017 [cited by examiner]
US 20180069698A1 · Hong et al. · 2018 [cited by applicant]
US 20200344048A1 · Fischer · 2020 [cited by examiner]
US 20210211279A1 · Nix · 2021 [cited by applicant]
US 20220394026A1 · Liu · 2022 [cited by examiner]
US 20230147221A1 · Fileccia · 2023 [cited by examiner]
US 20240056438A1 · Bandy · 2024 [cited by examiner]
International Search Report and Written Opinion received for PCT Application No. PCT/US2022/076940, mailed on Jan. 5, 2023, 11 pages. [cited by applicant]