USA As Represented by Secretary of the Navy

University of Illinois

Imperial College Innovations Limited

Ryan Christopher Gabrys

Sunny James Fugate

Luis M Martinez

Olgica Milenkovic

Mark Bilinski

S M Hossein Tabatabaei Yazdi

Jayson T Durham

João Ribeiro

Mahdi Cheraghchi Bashi Astaneh

Mike Tall

The present disclosure provides systems and methods that relate to storing encoded information in, and reading the encoded information from, nucleotide sequences. An example method includes receiving, at a DNA readout system, a nucleotide sequence. The method also includes reading the nucleotide sequence based on an alphabet consisting of {adenine (A), cytosine (C), guanine (G), and thymine (T)}. The method further includes determining positions of unique markers between a plurality of encoded blocks in the nucleotide sequence. The method yet further includes decoding each encoded block of the plurality of encoded blocks according to an inner code, so as to form a plurality of decoded blocks. The method also includes appending the decoded blocks to one another to provide a decoded message with message length n bits.

Coded trace reconstruction

A system and related methods that generate encryption keys using two inputs. The first input is random data measured or supplied at the time the encryption keys are created. The second input is predetermined data held by the server and device. Given knowledge of the predetermined data and the random data, the UxS will be able to regenerate its previous encryption keys and also to re-establish communication by the server and device.

System for providing secure communications and related methods

A method for hiding information in executable code comprising: identifying a set of pairs of interchangeable instructions, wherein each pair has an instruction order of execution that is reversible without changing a functionality of the executable code; organizing the pairs into a plurality of matrices based on a set of random seeds; for each matrix, inverting a submatrix consisting of a subset of columns from each matrix to identify a subset of pairs; identifying a matrix that has full column rank on a subset of columns that is a function of the pairs' location; storing an index of the identified matrix's associated seed in a secure data storage location; and encoding data into the executable code by reversing the order of execution of the subset of pairs and treating each pair having reversed instructions as a '1' and each pair of non-reversed instructions as a '0' or vice versa.

Method for swapping adjacent instructions midstream in software executables in order to hide information therein

At a physical data-link in a network, a current status of a plurality of logical data-channels in the network is determined, using machine learning to infer the current status. A plurality of cross-layer error correction coding schemes for transmissions is adaptively adjusted, based on the determined current status, and based on an application transmitting data. Transmission of the data, and a plurality of information-exchange requirements, are supported, using the adaptively adjusted plurality of error correction coding schemes.

Adaptive cross-layer error control coding for heterogeneous application environments

A method for synchronizing datasets comprising the steps of: (1) partitioning each dataset into a plurality of bins according to a first partitioning rule, wherein each bin contains a random subset of elements of symmetric difference taken from a universe of all possible elements, (2) performing a first round of polynomial interpolation (PI) at a first encoding threshold on each bin of the first-partitioned datasets, wherein if any bin contains a number of elements that is less than or equal to the first encoding threshold the elements contained therein are decoded during the first PI round, and wherein if any bin contains a number of elements that is greater than the first encoding threshold the elements contained therein are not decoded during the first PI round; and (3) synchronizing the datasets based on the decoded elements.

Dataset reconciliation through partitioning and polynomial interpolation

A method synchronizes related data across networked host devices. At each of a first and a second host device, string vectors are created for each document stored within the host device. The respective set of string vectors are encoded using a two-dimensional hash, where a first dimension of the two-dimensional hash stores string vector differences between all elements that reside in a symmetric difference and a second dimension of the two-dimensional hash stores one string vector from the symmetric difference. The respective encoded set of string vectors is transmitted to the other host device, which then decodes the respective encoded set of string vectors received to arrive at the symmetric difference. The host device determines which string vectors it is missing and requests from the other host device the missing documents pertaining to the missing string vectors. The missing documents are received by the requesting host device.

Method for reconciling similar data sets

The present disclosure provides DNA-based storage system demonstrated through experimental and theoretical verification that such a platform can easily be implemented in practice using portable, nanopore-based sequencers. The gist of the approach is to design an integrated pipeline that encodes data to avoid synthesis and sequencing errors, enables random access through addressing, and leverages efficient portable nanopore sequencing via new anchored iterative alignment and insertion/deletion error-correcting codes. The embodiments herein represent the only known random access DNA-based data storage system that uses error-prone portable, nanopore-based sequencers and produces low-error readouts with the highest reported information rate and density.

Growing community of inventors

San Diego, CA, United States of America

Ryan Christopher Gabrys