IP Library Granted Patent US 12,407,502
Granted Patent B2
US 12,407,502 · App. 17/988,710 · Granted Sep 2, 2025

System and method for secure end-to-end electronic communication using a mutating table of entropy

Inventors: Henry R. Tumblin (Castine, ME); Douglass A. Hill (Marco Island, FL)
Assignee: Real Random IP, LLC
H04L9/0869G06F21/602G06F21/6245H04L9/0894H04L63/0428H04L63/0435
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,407,502
App. No.
17/988,710
Granted
Sep 2, 2025
Kind
B2
Abstract

The various implementations described herein include methods and systems for using mutatable privacy tables to secure electronic communications. A first electronic device obtains a first version of a privacy table and applies a predefined hashing algorithm to the first version of the privacy table to generate a second version of the privacy table. The first electronic device obtains a first message for transmission to a second electronic device that (i) has a copy of the first version of the privacy table and (ii) has access to the predefined hashing algorithm. The first electronic device generates a primary key based on the second version of the privacy table. The first electronic device encrypts the first message using the primary key to form an encrypted first message and transmits the encrypted first message and a version identifier for the second version of the privacy table to the second electronic device.

Claims (63)

1. A method performed at a first electronic device, comprising:

obtaining a first version of a privacy table, the first version of the privacy table comprising N first bits, wherein N is a positive integer greater than 32;

applying a predefined hashing algorithm to the first version of the privacy table to generate a second version of the privacy table having N second bits;

obtaining a first message for transmission to a second electronic device;

generating a primary key based on the second version of the privacy table;

encrypting the first message using the primary key to form an encrypted first message; and

transmitting the encrypted first message and a version identifier for the second version of the privacy table to the second electronic device, wherein, prior to transmitting the encrypted first message and the version identifier to the second electronic device, the second electronic device: (i) has a copy of the first version of the privacy table, (ii) has access to the predefined hashing algorithm, and (iii) is configured to generate the second version of the privacy table at the second electronic device upon determining that a version identifier for the second version of the privacy table does not match a version identifier for the first version of the privacy table.

2. The method of claim 1 , wherein generating the primary key comprises:

generating a map based on the second version of the privacy table, wherein the map includes a set of parameter values that specify instructions to generate the primary key from the second version of the privacy table;

generating the primary key according to the instructions in the map; and

the method further comprises transmitting the map to the second electronic device.

3. The method of claim 2 , wherein the second electronic device decrypts the first message by:

applying the predefined hashing algorithm to the first version of the privacy table to generate the second version of the privacy table;

recreating the primary key from the second version of the privacy table according to the map; and

decrypting the encrypted first message using the recreated primary key.

4. The method of claim 1 , wherein the hashing algorithm includes applying one or more hash functions.

5. The method of claim 1 , further comprising applying the predefined hashing algorithm to the second version of the privacy table to generate a third version of the privacy table having N third bits.

6. The method of claim 1 , wherein applying the predefined hashing algorithm to the first version of the privacy table comprises sequentially hashing portions of the first version of the privacy table in a predefined order.

7. The method of claim 1 , wherein:

the predefined hashing algorithm includes one or more numeric parameters; and

applying the predefined hashing algorithm includes generating and using a corresponding parameter value for each of the one or more numeric parameters; and

the method further comprises transmitting the parameter values to the second electronic device along with the version identifier for the second version of the privacy table.

8. The method of claim 1 , further comprising transmitting the first version of the privacy table to the second electronic device over an encrypted channel.

9. The method of claim 1 , wherein the second version of the privacy table is generated in accordance with a preset amount of time having elapsed after creation of the first version of the privacy table.

10. The method of claim 1 , wherein the second version of the privacy table is generated in accordance with a preset number of messages being encrypted using the first version of the privacy table.

11. The method of claim 1 , wherein the second version of the privacy table is generated in response to a request from a user of the first electronic device.

12. The method of claim 1 , further comprising, after transmitting the encrypted first message:

applying the predefined hashing algorithm to the second version of the privacy table to generate a third version of the privacy table having N third bits;

obtaining a second message for transmission to the second electronic device;

generating a second primary key based on the third version of the privacy table;

encrypting the second message using the second primary key to form an encrypted second message; and

transmitting the encrypted second message and a version identifier for the third version of the privacy table to the second electronic device.

13. The method of claim 1 , further comprising:

obtaining a blockchain for the privacy table, the blockchain including a genesis block for the first version of the privacy table; and

in accordance with generating the second version of the privacy table, generating a second block and inserting the second block into the blockchain.

14. The method of claim 13 , further comprising:

after generating the second version of the privacy table, receiving a second encrypted message and a version identifier for the privacy table from the second electronic device, the version identifier indicating that the second encrypted message was generated using the first version of the privacy table; and

decrypting the second encrypted message using information from the genesis block of the blockchain.

15. A computing device, comprising:

one or more processors; and

memory coupled to the one or more processors, the memory storing one or more programs configured to be executed by the one or more processors, the one or more programs including instructions for:

obtaining a first version of a privacy table, the first version of the privacy table comprising N first bits, wherein N is a positive integer greater than 32;

applying a predefined hashing algorithm to the first version of the privacy table to generate a second version of the privacy table having N second bits;

obtaining a first message for transmission to a second electronic device;

generating a primary key based on the second version of the privacy table;

encrypting the first message using the primary key to form an encrypted first message; and

transmitting the encrypted first message and a version identifier for the second version of the privacy table to the second electronic device, wherein, prior to transmitting the encrypted first message and the version identifier to the second electronic device, the second electronic device: (i) has a copy of the first version of the privacy table, (ii) has access to the predefined hashing algorithm, and (iii) is configured to generate the second version of the privacy table at the second electronic device upon determining that a version identifier for the second version of the privacy table does not match a version identifier for the first version of the privacy table.

16. The computing device of claim 15 , wherein generating the primary key comprises:

generating a map based on the second version of the privacy table, wherein the map includes a set of parameter values that specify instructions to generate the primary key from the second version of the privacy table;

generating the primary key according to the instructions in the map; and

the one or more programs further include instructions for transmitting the map to the second electronic device.

17. The computing device of claim 15 , wherein applying the predefined hashing algorithm to the first version of the privacy table comprises sequentially hashing portions of the first version of the privacy table in a predefined order.

18. The computing device of claim 15 , wherein the second version of the privacy table is generated in accordance with a preset amount of time having elapsed after creation of the first version of the privacy table.

19. The computing device of claim 15 , wherein the one or more programs further include instructions for:

obtaining a blockchain for the privacy table, the blockchain including a genesis block for the first version of the privacy table; and

in accordance with generating the second version of the privacy table, generating a second block and inserting the second block into the blockchain.

20. A non-transitory computer-readable storage medium storing one or more programs configured for execution by a computer system having one or more processors and memory, the one or more programs comprising instructions for:

obtaining a first version of a privacy table, the first version of the privacy table comprising N first bits, wherein N is a positive integer greater than 32;

applying a predefined hashing algorithm to the first version of the privacy table to generate a second version of the privacy table having N second bits;

obtaining a first message for transmission to a second electronic device;

generating a primary key based on the second version of the privacy table;

encrypting the first message using the primary key to form an encrypted first message; and

transmitting the encrypted first message and a version identifier for the second version of the privacy table to the second electronic device, wherein, prior to transmitting the encrypted first message and the version identifier to the second electronic device, the second electronic device: (i) has a copy of the first version of the privacy table, (ii) has access to the predefined hashing algorithm, and (iii) is configured to generate the second version of the privacy table at the second electronic device upon determining that a version identifier for the second version of the privacy table does not match a version identifier for the first version of the privacy table.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Mar 16, 2023
From: TUMBLIN, HENRY R.; HILL, DOUGLASS A.
To: REAL RANDOM IP, LLC
Reel/Frame 063008/0222 →
Continuity (4)
Continuation In Part 17385817 · Jul 26, 2021
Continuation 17382282 · Jul 21, 2021
Provisional Application 63175548 · Apr 15, 2021
Related Publication 20250106015A1 · Mar 27, 2025
References Cited (41)
US 4227253A · Ehrsam et al. · 1980 [cited by applicant]
US 6343361B1 · Nendell et al. · 2002 [cited by applicant]
US 6668321B2 · Nendell et al. · 2003 [cited by applicant]
US 6904526B1 · Hongwei · 2005 [cited by applicant]
US 7003667B1 · Slick et al. · 2006 [cited by applicant]
US 10601443B1 · Tourani et al. · 2020 [cited by applicant]
US 20020120838A1 · Abdulkader · 2002 [cited by examiner]
US 20020186846A1 · Nyberg et al. · 2002 [cited by applicant]
US 20040266449A1 · Smetters et al. · 2004 [cited by applicant]
US 20080292098A1 · Akima et al. · 2008 [cited by applicant]
US 20110145894A1 · Garcia Morchon et al. · 2011 [cited by applicant]
US 20120063597A1 · Tropp et al. · 2012 [cited by applicant]
US 20120179735A1 · Ferguson et al. · 2012 [cited by applicant]
US 20120321077A1 · Shiota et al. · 2012 [cited by applicant]
US 20130067016A1 · Adkins · 2013 [cited by examiner]
US 20130329886A1 · Kipnis et al. · 2013 [cited by applicant]
US 20150365424A1 · Pelletier · 2015 [cited by applicant]
US 20170034167A1 · Figueira · 2017 [cited by examiner]
US 20180054305A1 · Djakovic et al. · 2018 [cited by applicant]
US 20180181604A1 · Marohn · 2018 [cited by examiner]
US 20180248691A1 · Henderson et al. · 2018 [cited by applicant]
US 20180332010A1 · Graber · 2018 [cited by examiner]
US 20190068558A1 · Jindal · 2019 [cited by examiner]
US 20190097789A1 · Rangayyan et al. · 2019 [cited by applicant]
US 20190207758A1 · Cambou · 2019 [cited by examiner]
US 20200053061A1 · Cambou · 2020 [cited by examiner]
US 20200169541A1 · Stein · 2020 [cited by examiner]
US 20200226952A1 · Lightowler · 2020 [cited by examiner]
US 20200351102A1 · Rocquelay et al. · 2020 [cited by applicant]
US 20200382293A1 · Cambou · 2020 [cited by examiner]
US 20210028935A1 · Wu et al. · 2021 [cited by applicant]
US 20210136044A1 · Dumitru · 2021 [cited by examiner]
US 20210173724A1 · Liu · 2021 [cited by examiner]
US 20210176217A1 · Liu · 2021 [cited by examiner]
US 20220337407A1 · Hill et al. · 2022 [cited by applicant]
US 20240064020A1 · Kiraz · 2024 [cited by examiner]
EP 3701664A1 · 2020 [cited by applicant]
WO WO2019067002 · 2019 [cited by applicant]
Real Random IP, LLC, International Search Report and Written Opinion, PCT/US2022/025113, Jul. 20, 2022, 11 pgs. [cited by applicant]
Real Random IP, LLC, International Preliminary Report on Patentability, PCT/US2022/025113, Oct. 12, 2023, 8 pgs. [cited by applicant]
Real Random IP, LLC, International Search Report and Written Opinion, PCT/US2023/079911, Mar. 21, 2024, 11 pgs. [cited by applicant]