# US 11,122,017 B2 · Systems, devices, and methods for encrypting genetic information > Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt - Number: US 11,122,017 B2 - Document ID: US11122017B2 - Status: Granted - Kind: B2 - Application number: 16/877,728 - Filed: 2020-05-19 - Published: 2020-12-03 - Granted: 2021-09-14 - Earliest claimed: 2015-02-09 - Assignees: Arc Bio, LLC - Applicants: Arc Bio, LLC - Inventors: David Andrew Sinclair; Alejandro Quiroz-Zarate; Roberto Olivares-Amaya; Thomas J. Watson, Jr.; Jason Michael Anderson; Pablo G. Coste - Web page: https://patentgrep.com/patent/US11122017B2 ## CPC - H04L 63/0428: {wherein the data content is protected, e.g. by encrypting or encapsulating the payload} - G06F 21/6245: {Protecting personal data, e.g. for financial or medical purposes} - H04L 9/0618: {Block ciphers, i.e. encrypting groups of characters of a plain text message using fixed encryption transformation} - H04L 9/0869: {involving random numbers or seeds} - H04L 9/12: Transmitting and receiving encryption devices synchronised or initially set up in a particular manner - H04L 2209/30: Compression, e.g. Merkle-Damgard construction - H04L 2209/34: Encoding or coding, e.g. Huffman coding or error correction - H04L 2209/88: Medical equipments - H04L: TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION (arrangements common to telegraphic and telephonic communication H04M) - G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N) ## Abstract Systems, devices, and methods for encrypting genetic information are provided herein. Also provided herein are systems, devices, and methods for encrypting compressed genetic data, transmitting encrypted compressed genetic data, and receiving, storing, accessing encrypted compressed genetic data. In some cases, a user interface is in communication with a system or device provided herein. ## Claims ### Claim 1 A method for encrypting genetic information, the method comprising: receiving genetic information comprising data generated using a genetic sequencing device; parsing the genetic information into multiple nodes of a graph, wherein each of the multiple nodes represents at least one read of a plurality of reads having a length of at least n bases; associating each of the multiple nodes with an encryption key of a plurality of encryption keys, wherein each of the plurality of encryption keys comprises a string of at least n base values of bases, wherein a first encryption key of the plurality of encryption keys comprises a first string of at least n base values, and a second encryption key of the plurality of encryption keys comprises a second string of at least n base values; encrypting a first node of the multiple nodes by modulo adding the first encryption key to a first read to generate a first cipher; encrypting a second node of the multiple nodes by modulo adding the second encryption key to a first read to generate a second cipher; compressing the first cipher and the second cipher to generate compressed encrypted genetic information representing at least a portion of the genetic information, wherein compressing the first cipher and the second cipher comprises: forming a compound read string corresponding to at least a portion of the first node using at least a portion of the first cipher; comparing the compound read string to a reference string that is based on a concatenation of a plurality of n-mers from a group of n-mers that occur most frequently in the genetic information, wherein the reference string is a reference cipher generated by modulo adding a reference key to the concatenation of the plurality of n-mers from the group of n-mers that occur most frequently in the genetic information; determining, based on the comparison, that the compound read string is found in the reference string; and recording a position and length at which the compound read string is found in the reference string; and transmitting at least a portion of the encrypted compressed genetic information over a network to a remote computing device. ### Claim 2 (depends on 1) The method of claim 1, wherein the genetic information is received as a BAM file. ### Claim 3 (depends on 1) The method of claim 1, further comprising: in response to determining that the compound read string is found in the reference string, adding a next element in the first cipher to the compound read string to generate an updated compound read string; comparing the updated compound read string to the reference string; determining, based on the comparison, that the updated compound read string is not found in the reference string; determining that the compound read string has a length that is greater than a threshold length k; and in response to determining that the compound read string has a length that is greater than the threshold length k, recording the position and length at which the compound read string is found in the reference string. ### Claim 4 (depends on 3) The method of claim 3, wherein compressing the first cipher further comprises recording a representation of a second portion of the first cipher that does not correspond to the compound read string and that has a length that is less than or equal to the threshold length k using a fixed encoding scheme. ### Claim 5 (depends on 4) The method of claim 4, wherein the fixed encoding scheme is based on Huffman codes. ### Claim 6 (depends on 1) The method of claim 1, wherein transmitting at least the portion of the encrypted compressed genetic information over the network to the remote computing device comprises: transmitting a first portion of the compressed encrypted genetic information that represents the first node to the remote computing device; and transmitting a second portion of the compressed encrypted genetic information that represents the second node to a second remote computing device. ### Claim 7 (depends on 6) The method of claim 6, wherein transmitting the first portion of the compressed encrypted genetic information that represents the first node to the remote computing device comprises transmitting a first position and length at which at least a portion of the first cipher is found in a reference string, and wherein transmitting the second portion of the compressed encrypted genetic information that represents the second node to the second remote computing device comprises transmitting a second position and length at which at least a portion of the second cipher is found in the reference string. ### Claim 8 (depends on 1) The method of claim 1, wherein the first encryption key is random. ### Claim 9 (depends on 1) The method of claim 1, wherein the second encryption key is generated from data encoded in the genetic information. ### Claim 10 A system for encrypting genetic information, the system comprising: at least one processor that is programmed to: receive genetic information comprising data generated using a genetic sequencing device; parse the genetic information into multiple nodes of a graph, wherein each of the multiple nodes represents at least one read of a plurality of reads having a length of at least n bases; associate each of the multiple nodes with an encryption key of a plurality of encryption keys, wherein each of the plurality of encryption keys comprises a string of at least n base values of bases, wherein a first encryption key of the plurality of encryption keys comprises a first string of at least n base values, and a second encryption key of the plurality of encryption keys comprises a second string of at least n base values; encrypt a first node of the multiple nodes by modulo adding the first encryption key to a first read to generate a first cipher; encrypt a second node of the multiple nodes by modulo adding the second encryption key to a first read to generate a second cipher; compress the first cipher and the second cipher to generate compressed encrypted genetic information representing at least a portion of the genetic information, wherein the at least one processor is further programmed to: form a compound read string corresponding to at least a portion of the first node using at least a portion of the first cipher; compare the compound read string to a reference string that is based on a concatenation of a plurality of n-mers from a group of n-mers that occur most frequently in the genetic information, wherein the reference string is a reference cipher generated by modulo adding a reference key to the concatenation of the plurality of n-mers from the group of n-mers that occur most frequently in the genetic information; determine, based on the comparison, that the compound read string is found in the reference string; and record a position and length at which the compound read string is found in the reference string; and transmit at least a portion of the encrypted compressed genetic information over a network to a remote computing device. ### Claim 11 (depends on 10) The system of claim 10, wherein the genetic information is received as a BAM file. ### Claim 12 (depends on 10) The system of claim 10, wherein the at least one processor is further programmed to: in response to determining that the compound read string is found in the reference string, add a next element in the first cipher to the compound read string to generate an updated compound read string; compare the updated compound read string to the reference string; determine, based on the comparison, that the updated compound read string is not found in the reference string; determine that the compound read string has a length that is greater than a threshold length k; and in response to determining that the compound read string has a length that is greater than the threshold length k, record the position and length at which the compound read string is found in the reference string. ### Claim 13 (depends on 12) The system of claim 12, wherein the at least one processor is further programmed to record a representation of a second portion of the first cipher that does not correspond to the compound read string and that has a length that is less than or equal to the threshold length k using a fixed encoding scheme. ### Claim 14 (depends on 13) The system of claim 13, wherein the fixed encoding scheme is based on Huffman codes. ### Claim 15 (depends on 10) The system of claim 10, wherein the at least one processor is further programmed to: transmit a first portion of the compressed encrypted genetic information that represents the first node to the remote computing device; and transmit a second portion of the compressed encrypted genetic information that represents the second node to a second remote computing device. ### Claim 16 (depends on 15) The system of claim 15, wherein the at least one processor is further programmed to: transmit a first position and length at which at least a portion of the first cipher is found in a reference string, and transmit a second position and length at which at least a portion of the second cipher is found in the reference string. ### Claim 17 (depends on 10) The system of claim 10, wherein the first encryption key is random. ### Claim 18 (depends on 10) The system of claim 10, wherein the second encryption key is generated from data encoded in the genetic information.