Abstract: Data is stored in DNA. To enable random access to the data, a delimiter is utilised at the end of each file in this system. Use of a specialised Huffman tree will be used to encrypt the data. If necessary, it is possible to encode each file separately using a Huffman tree, which will both strengthen data security and compress the data. Any data fault that occurs while encoding is exclusive to that particular file. Data compression is accomplished via encoding with the Huffman tree. Since no one can decode it without the original tree, it offers security. There is a lot of specialised equipment required for DNA strand sequencing. DNA cannot therefore be read without the necessary tools. DNA contains a maximum of 2 nucleotide repetitions, excluding delimiters. It is possible to keep data for a considerable amount of time since DNA can preserve info for many years. This method allows for the packing of data and the provision of data security. Users can read many files simultaneously thanks to the possibility of parallel file reading. This method keeps two copies of the data. Consequently, its copy can be utilised to read data in the event of data damage. With minimal computational cost, this method can be utilised to store large amounts of data in a very tiny amount of space. This approach is scalable and works well for storing massive files. Additionally, making many copies is simple. Information can be kept in large data or archive systems using this technique.

Keywords: Digital data, data storage, encoding, synthesis, retrieval, decoding, and sequencing

| DOI: 10.17148/IARJSET.2022.9652