Security and complexity of a DNA-based cipher

DNA cryptography is a new and promising field in information security. It combines the classical solutions in cryptography with the strength of the genetic material. In this work is evaluated an encryption algorithm that uses the genomic databases, where are stored the DNA sequences in digital form. Genomic databases represent a feasible solution to the One-Time-Pad (OTP) symmetric key generation problem. Complexity of the algorithm was evaluated by the theoretical analysis and practical measurements of its execution time. Different techniques have been used to evaluate the security level of the algorithm such as key space, cryptanalysis, and statistical measurements.