US 11,997,200 B2
Generating unique cryptographic keys from a pool of random elements
Denis Mandich, New York, NY (US); Christopher Knapp, New York, NY (US); Austin Bradley, New York, NY (US); Samuel Wolfson, New York, NY (US); and Matthew Neal, New York, NY (US)
Assigned to QRYPT, INC., New York, NY (US)
Appl. No. 17/600,456
Filed by QRYPT, INC., New York, NY (US)
PCT Filed Aug. 11, 2020, PCT No. PCT/US2020/045747
§ 371(c)(1), (2) Date Sep. 30, 2021,
PCT Pub. No. WO2022/035422, PCT Pub. Date Feb. 17, 2022.
Application 17/600,456 is a continuation of application No. 16/375,921, filed on Apr. 5, 2019, granted, now 11,095,442, issued on Aug. 17, 2021.
Prior Publication US 2023/0145683 A1, May 11, 2023
This patent is subject to a terminal disclaimer.
Int. Cl. H04L 29/00 (2006.01); H04L 9/08 (2006.01)
CPC H04L 9/0869 (2013.01) 18 Claims
OG exemplary drawing
 
1. A method for encryption key generation, comprising the steps of:
receiving a plaintext message comprising a fixed character length for generating the encryption key;
receiving, from a source, a plurality of random numbers;
creating a matrix from the plurality random numbers, comprising at least one of a number of rows and a number of columns equal to or greater than the character length;
generating one or more arrays based on the matrix; and
creating the encryption key based on the one or more arrays,
wherein generating the one or more arrays comprises the steps of:
selecting an initial element within the matrix,
selecting subsequent unique elements from the matrix using a selection technique until a number of elements in the one or more arrays is respectively equal to or greater than the character length, and
truncating each array of the one or more arrays that is greater than the character length so that each array of the one or more arrays is equal to the character length.