US 11,818,262 B2
Method and system for one-to-many symmetric cryptography and a network employing the same
Glen Arthur Henderson, Ottawa (CA); Brent Eric Nordin, Ottawa (CA); Daniel Marcel Joseph Seguin, Navan (CA); Prateek Srivastava, Ottawa (CA); and Ian Hugh Curry, Collex (CH)
Assigned to CORD3 INNOVATION INC., Ottawa (CA)
Filed by CORD3 INNOVATION INC., Ottawa (CA)
Filed on Sep. 19, 2022, as Appl. No. 17/947,920.
Application 17/947,920 is a continuation of application No. 17/157,864, filed on Jan. 25, 2021, granted, now 11,451,386, issued on Sep. 20, 2022.
Application 17/157,864 is a continuation of application No. 16/728,332, filed on Dec. 27, 2019, granted, now 10,903,994, issued on Jan. 26, 2021.
Application 16/728,332 is a continuation of application No. 15/905,232, filed on Feb. 26, 2018, granted, now 10,742,408, issued on Aug. 11, 2020.
Claims priority of provisional application 62/524,576, filed on Jun. 25, 2017.
Claims priority of provisional application 62/464,160, filed on Feb. 27, 2017.
Prior Publication US 2023/0224151 A1, Jul. 13, 2023
This patent is subject to a terminal disclaimer.
Int. Cl. H04L 9/08 (2006.01); G06F 21/60 (2013.01); G09C 1/00 (2006.01); H04L 9/14 (2006.01); H04L 9/32 (2006.01); H04L 9/40 (2022.01); H04L 9/06 (2006.01)
CPC H04L 9/0869 (2013.01) [G06F 21/602 (2013.01); G09C 1/00 (2013.01); H04L 9/088 (2013.01); H04L 9/0861 (2013.01); H04L 9/0891 (2013.01); H04L 9/14 (2013.01); H04L 9/3213 (2013.01); H04L 63/0435 (2013.01); H04L 63/10 (2013.01); H04L 9/0618 (2013.01); H04L 2209/04 (2013.01)] 20 Claims
OG exemplary drawing
 
1. A one-to-many symmetric cryptographic system, comprising:
a central location being in communication with at least one remote location;
the central location having a memory having computer executable instructions stored thereon for execution by a processor, causing the processor to:
receive a document from said at least one remote location; and
provide the document to a cryptographic module for encryption, comprising:
receiving a token;
performing a walk through an entropy space, which is a large set of random bits, to fetch a string of bits, the walk through and the fetched string of bits depending on the token;
generating a secret key for encrypting the document based on the fetched string of bits, thereby generating an encrypted document; and
destroying the secret key upon encrypting the document;
the computer executable instructions further causing the processor to provide the encrypted document to the cryptographic module for decryption, comprising:
receiving the token;
performing the walk through the entropy space to fetch the string of bits; and
generating the secret key for decrypting the encrypted document based on the fetched string of bits;
thereby avoiding storing or communicating the secret key.